./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sum_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sum_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/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 e17f830a1ee9b998b40fe12c0d4d25b23cde3738 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:31:27,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:31:27,036 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:31:27,045 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:31:27,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:31:27,046 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:31:27,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:31:27,048 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:31:27,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:31:27,051 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:31:27,052 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:31:27,052 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:31:27,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:31:27,053 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:31:27,055 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:31:27,055 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:31:27,056 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:31:27,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:31:27,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:31:27,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:31:27,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:31:27,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:31:27,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:31:27,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:31:27,064 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:31:27,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:31:27,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:31:27,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:31:27,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:31:27,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:31:27,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:31:27,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:31:27,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:31:27,068 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:31:27,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:31:27,069 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:31:27,069 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 00:31:27,080 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:31:27,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:31:27,081 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:31:27,082 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:31:27,082 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:31:27,082 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 00:31:27,082 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 00:31:27,082 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 00:31:27,082 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 00:31:27,083 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 00:31:27,083 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 00:31:27,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:31:27,083 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:31:27,083 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:31:27,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:31:27,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:31:27,084 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:31:27,084 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 00:31:27,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 00:31:27,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 00:31:27,084 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:31:27,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:31:27,084 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 00:31:27,085 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:31:27,085 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 00:31:27,085 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:31:27,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:31:27,085 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 00:31:27,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:31:27,085 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:31:27,086 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 00:31:27,086 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 00:31:27,086 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_9d68e414-9404-4874-a4e2-ca032ed7a951/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 -> e17f830a1ee9b998b40fe12c0d4d25b23cde3738 [2018-11-23 00:31:27,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:31:27,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:31:27,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:31:27,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:31:27,124 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:31:27,124 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-23 00:31:27,170 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/bin-2019/uautomizer/data/7ab51b05f/92f3a313c40647f2a05414b2581ed585/FLAGd5e3ac0b8 [2018-11-23 00:31:27,489 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:31:27,489 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/sv-benchmarks/c/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-11-23 00:31:27,493 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/bin-2019/uautomizer/data/7ab51b05f/92f3a313c40647f2a05414b2581ed585/FLAGd5e3ac0b8 [2018-11-23 00:31:27,501 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/bin-2019/uautomizer/data/7ab51b05f/92f3a313c40647f2a05414b2581ed585 [2018-11-23 00:31:27,504 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:31:27,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:31:27,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:31:27,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:31:27,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:31:27,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:31:27" (1/1) ... [2018-11-23 00:31:27,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6370e18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27, skipping insertion in model container [2018-11-23 00:31:27,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:31:27" (1/1) ... [2018-11-23 00:31:27,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:31:27,528 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:31:27,641 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:31:27,647 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:31:27,661 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:31:27,671 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:31:27,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27 WrapperNode [2018-11-23 00:31:27,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:31:27,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:31:27,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:31:27,672 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:31:27,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27" (1/1) ... [2018-11-23 00:31:27,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27" (1/1) ... [2018-11-23 00:31:27,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:31:27,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:31:27,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:31:27,698 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:31:27,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27" (1/1) ... [2018-11-23 00:31:27,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27" (1/1) ... [2018-11-23 00:31:27,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27" (1/1) ... [2018-11-23 00:31:27,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27" (1/1) ... [2018-11-23 00:31:27,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27" (1/1) ... [2018-11-23 00:31:27,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27" (1/1) ... [2018-11-23 00:31:27,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27" (1/1) ... [2018-11-23 00:31:27,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:31:27,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:31:27,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:31:27,758 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:31:27,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/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-11-23 00:31:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:31:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:31:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:31:27,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:31:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:31:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:31:28,004 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:31:28,004 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 00:31:28,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:31:28 BoogieIcfgContainer [2018-11-23 00:31:28,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:31:28,005 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 00:31:28,005 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 00:31:28,009 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 00:31:28,010 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:31:28,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:31:27" (1/3) ... [2018-11-23 00:31:28,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e4c962c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:31:28, skipping insertion in model container [2018-11-23 00:31:28,011 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:31:28,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:31:27" (2/3) ... [2018-11-23 00:31:28,012 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e4c962c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:31:28, skipping insertion in model container [2018-11-23 00:31:28,012 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:31:28,012 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:31:28" (3/3) ... [2018-11-23 00:31:28,014 INFO L375 chiAutomizerObserver]: Analyzing ICFG sum_true-unreach-call_true-termination.i [2018-11-23 00:31:28,065 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:31:28,065 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 00:31:28,065 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 00:31:28,066 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 00:31:28,066 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:31:28,066 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:31:28,066 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 00:31:28,066 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:31:28,066 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 00:31:28,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 00:31:28,099 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 00:31:28,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:31:28,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:31:28,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 00:31:28,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:31:28,106 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 00:31:28,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-23 00:31:28,108 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 00:31:28,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:31:28,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:31:28,108 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 00:31:28,108 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:31:28,115 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 14#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 13#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;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 9#L11-3true [2018-11-23 00:31:28,115 INFO L796 eck$LassoCheckResult]: Loop: 9#L11-3true assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 12#L11-2true sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 9#L11-3true [2018-11-23 00:31:28,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:28,121 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-23 00:31:28,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:28,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:28,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:28,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2018-11-23 00:31:28,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:28,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:28,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:28,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:28,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:28,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:28,231 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2018-11-23 00:31:28,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:28,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:28,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:28,413 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:31:28,414 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:31:28,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:31:28,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:31:28,414 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:31:28,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:31:28,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:31:28,415 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:31:28,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 00:31:28,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:31:28,415 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:31:28,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:28,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:31:28,859 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:31:28,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:28,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:28,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:28,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:28,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:31:28,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:28,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:28,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:28,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:28,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:28,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:28,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:28,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:28,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:28,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:28,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:28,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:28,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:31:28,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:31:28,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:28,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:28,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:28,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:28,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:28,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:28,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:28,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:28,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:28,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:28,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:28,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:28,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:28,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:28,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:28,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:28,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:28,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:28,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:28,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:28,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:28,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:28,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:28,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:28,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:28,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:28,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:28,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:28,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:31:28,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:31:28,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:31:28,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:28,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:31:28,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:28,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:28,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:28,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:28,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:31:28,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:31:28,957 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:31:28,997 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 00:31:28,997 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 00:31:28,999 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:31:29,000 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:31:29,001 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:31:29,001 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, ULTIMATE.start_sum_~x.offset, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -4*ULTIMATE.start_sum_~i~0 - 1*ULTIMATE.start_sum_~x.offset + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2018-11-23 00:31:29,024 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 00:31:29,029 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 00:31:29,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:29,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:29,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:29,100 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-11-23 00:31:29,101 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2018-11-23 00:31:29,158 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 51 states and 69 transitions. Complement of second has 8 states. [2018-11-23 00:31:29,162 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-11-23 00:31:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 00:31:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-23 00:31:29,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-23 00:31:29,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:31:29,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 00:31:29,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:31:29,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-23 00:31:29,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:31:29,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2018-11-23 00:31:29,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 00:31:29,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2018-11-23 00:31:29,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 00:31:29,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 00:31:29,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-23 00:31:29,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:31:29,176 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 00:31:29,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-23 00:31:29,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 00:31:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 00:31:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-11-23 00:31:29,196 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 00:31:29,196 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-23 00:31:29,196 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 00:31:29,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-11-23 00:31:29,197 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 00:31:29,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:31:29,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:31:29,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 00:31:29,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:31:29,198 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 146#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 145#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;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 141#L11-3 assume !(sum_~i~0 < ~N~0); 137#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 138#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 150#L11-8 [2018-11-23 00:31:29,198 INFO L796 eck$LassoCheckResult]: Loop: 150#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 151#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 150#L11-8 [2018-11-23 00:31:29,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:29,198 INFO L82 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2018-11-23 00:31:29,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:29,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:29,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:29,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:29,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:31:29,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:31:29,241 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:31:29,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-11-23 00:31:29,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:29,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:29,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:29,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:29,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:31:29,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:31:29,287 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 00:31:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:29,309 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-23 00:31:29,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:31:29,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-23 00:31:29,310 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 00:31:29,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-11-23 00:31:29,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 00:31:29,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 00:31:29,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-23 00:31:29,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:31:29,311 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-23 00:31:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-23 00:31:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 00:31:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 00:31:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-23 00:31:29,313 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 00:31:29,313 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 00:31:29,313 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 00:31:29,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-23 00:31:29,314 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 00:31:29,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:31:29,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:31:29,315 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:31:29,315 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:31:29,315 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 187#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 186#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;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 182#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 183#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 184#L11-3 assume !(sum_~i~0 < ~N~0); 178#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 179#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 191#L11-8 [2018-11-23 00:31:29,315 INFO L796 eck$LassoCheckResult]: Loop: 191#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 192#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 191#L11-8 [2018-11-23 00:31:29,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:29,315 INFO L82 PathProgramCache]: Analyzing trace with hash 123162473, now seen corresponding path program 1 times [2018-11-23 00:31:29,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:29,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:29,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:29,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:29,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:31:29,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/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-11-23 00:31:29,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:29,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:29,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:31:29,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 00:31:29,434 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:31:29,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:29,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 2 times [2018-11-23 00:31:29,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:29,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:29,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:29,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:29,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:31:29,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:31:29,470 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-23 00:31:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:29,509 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-23 00:31:29,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:31:29,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-11-23 00:31:29,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 00:31:29,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 00:31:29,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 00:31:29,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 00:31:29,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-11-23 00:31:29,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:31:29,511 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 00:31:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-11-23 00:31:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 00:31:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 00:31:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-23 00:31:29,513 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-23 00:31:29,513 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-23 00:31:29,513 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 00:31:29,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-23 00:31:29,514 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 00:31:29,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:31:29,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:31:29,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 00:31:29,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:31:29,515 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 255#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 254#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;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 249#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 250#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 251#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 252#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 261#L11-3 assume !(sum_~i~0 < ~N~0); 245#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 246#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 259#L11-8 [2018-11-23 00:31:29,516 INFO L796 eck$LassoCheckResult]: Loop: 259#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 260#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 259#L11-8 [2018-11-23 00:31:29,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:29,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228857, now seen corresponding path program 2 times [2018-11-23 00:31:29,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:29,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:29,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:31:29,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:29,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:29,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 3 times [2018-11-23 00:31:29,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:29,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:31:29,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:29,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:29,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1163170153, now seen corresponding path program 1 times [2018-11-23 00:31:29,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:29,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:29,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:31:29,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:29,823 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2018-11-23 00:31:29,959 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-23 00:31:29,960 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:31:29,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:31:29,960 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:31:29,960 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:31:29,961 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:31:29,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:31:29,961 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:31:29,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:31:29,961 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration4_Lasso [2018-11-23 00:31:29,961 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:31:29,961 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:31:29,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-11-23 00:31:29,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:29,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:29,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:29,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:29,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:30,230 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-11-23 00:31:30,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-11-23 00:31:30,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:30,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:30,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-11-23 00:31:30,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-11-23 00:31:30,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-11-23 00:31:30,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-11-23 00:31:30,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-11-23 00:31:30,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-11-23 00:31:30,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-11-23 00:31:30,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-11-23 00:31:30,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:30,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:30,455 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:31:30,456 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:31:30,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:30,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:30,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:30,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:30,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:30,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:30,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:30,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:30,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:30,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:30,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:30,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:30,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:30,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:30,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:30,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:30,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:30,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:30,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:30,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:30,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:30,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:30,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:30,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:30,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:30,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:30,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:30,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:30,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:30,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:30,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:30,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:30,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:30,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:30,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:30,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:30,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:30,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:30,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:30,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:30,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:30,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:31:30,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:31:30,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:30,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:31:30,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:30,468 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:31:30,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:30,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:30,469 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:31:30,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:31:30,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:30,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:30,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:30,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:30,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:30,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:30,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:30,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:30,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:30,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:30,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:30,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:30,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:30,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:30,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:30,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:31:30,480 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:31:30,492 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:31:30,509 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 00:31:30,509 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 00:31:30,510 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:31:30,511 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:31:30,511 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:31:30,511 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, v_rep(select #length ULTIMATE.start_sum_~x.base)_2, ULTIMATE.start_sum_~x.offset) = -4*ULTIMATE.start_sum_~i~0 + 1*v_rep(select #length ULTIMATE.start_sum_~x.base)_2 - 1*ULTIMATE.start_sum_~x.offset Supporting invariants [] [2018-11-23 00:31:30,535 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-23 00:31:30,538 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 00:31:30,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:30,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:30,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:30,596 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-11-23 00:31:30,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 00:31:30,620 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 26 states and 33 transitions. Complement of second has 7 states. [2018-11-23 00:31:30,621 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-11-23 00:31:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 00:31:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 00:31:30,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-23 00:31:30,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:31:30,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 2 letters. [2018-11-23 00:31:30,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:31:30,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 00:31:30,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:31:30,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-11-23 00:31:30,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 00:31:30,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 24 transitions. [2018-11-23 00:31:30,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 00:31:30,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 00:31:30,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-11-23 00:31:30,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:31:30,624 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-23 00:31:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-11-23 00:31:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 00:31:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 00:31:30,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-11-23 00:31:30,630 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-23 00:31:30,630 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-23 00:31:30,630 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 00:31:30,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2018-11-23 00:31:30,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 00:31:30,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:31:30,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:31:30,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:31:30,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:31:30,634 INFO L794 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 376#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 375#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;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 370#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 371#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 372#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 373#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 383#L11-3 assume !(sum_~i~0 < ~N~0); 366#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 367#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 380#L11-8 assume !(sum_~i~0 < ~N~0); 378#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 379#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 368#L32-3 [2018-11-23 00:31:30,634 INFO L796 eck$LassoCheckResult]: Loop: 368#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 369#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 368#L32-3 [2018-11-23 00:31:30,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1698534614, now seen corresponding path program 1 times [2018-11-23 00:31:30,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:30,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:30,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:30,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:30,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:31:30,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:31:30,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:31:30,667 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:31:30,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:30,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 1 times [2018-11-23 00:31:30,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:30,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:30,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:30,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:30,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:31:30,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:31:30,709 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 00:31:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:30,734 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 00:31:30,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:31:30,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-11-23 00:31:30,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 00:31:30,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 00:31:30,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 00:31:30,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 00:31:30,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-11-23 00:31:30,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:31:30,736 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 00:31:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-11-23 00:31:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-23 00:31:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 00:31:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 00:31:30,738 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 00:31:30,738 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 00:31:30,738 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 00:31:30,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-23 00:31:30,738 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 00:31:30,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:31:30,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:31:30,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:31:30,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:31:30,739 INFO L794 eck$LassoCheckResult]: Stem: 427#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 426#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 425#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;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 420#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 421#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 422#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 423#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 433#L11-3 assume !(sum_~i~0 < ~N~0); 416#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 417#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 430#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 431#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 432#L11-8 assume !(sum_~i~0 < ~N~0); 428#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 429#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 418#L32-3 [2018-11-23 00:31:30,739 INFO L796 eck$LassoCheckResult]: Loop: 418#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 419#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 418#L32-3 [2018-11-23 00:31:30,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:30,739 INFO L82 PathProgramCache]: Analyzing trace with hash 205910964, now seen corresponding path program 1 times [2018-11-23 00:31:30,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:30,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:30,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:30,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:30,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:31:30,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:31:30,769 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d68e414-9404-4874-a4e2-ca032ed7a951/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-11-23 00:31:30,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:30,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 00:31:30,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:31:30,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 00:31:30,847 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:31:30,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:30,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 2 times [2018-11-23 00:31:30,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:30,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:30,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:30,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:30,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:30,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:31:30,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:31:30,894 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-23 00:31:30,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:30,979 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 00:31:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:31:30,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-11-23 00:31:30,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 00:31:30,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 00:31:30,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-23 00:31:30,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-23 00:31:30,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-11-23 00:31:30,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:31:30,982 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 00:31:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-11-23 00:31:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-11-23 00:31:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 00:31:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 00:31:30,984 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 00:31:30,984 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 00:31:30,984 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 00:31:30,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-23 00:31:30,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 00:31:30,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:31:30,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:31:30,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:31:30,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:31:30,985 INFO L794 eck$LassoCheckResult]: Stem: 529#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 528#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 527#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;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 522#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 523#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 524#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 525#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 536#L11-3 assume !(sum_~i~0 < ~N~0); 518#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 519#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 532#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 533#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 534#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 535#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 537#L11-8 assume !(sum_~i~0 < ~N~0); 530#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 531#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 520#L32-3 [2018-11-23 00:31:30,988 INFO L796 eck$LassoCheckResult]: Loop: 520#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 521#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 520#L32-3 [2018-11-23 00:31:30,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:30,988 INFO L82 PathProgramCache]: Analyzing trace with hash 313660178, now seen corresponding path program 2 times [2018-11-23 00:31:30,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:30,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:30,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:30,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:31:30,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:31,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:31,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 3 times [2018-11-23 00:31:31,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:31,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:31,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:31:31,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:31,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:31,027 INFO L82 PathProgramCache]: Analyzing trace with hash 779721780, now seen corresponding path program 1 times [2018-11-23 00:31:31,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:31,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:31,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:31,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:31:31,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:31,426 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 134 [2018-11-23 00:31:55,805 WARN L180 SmtUtils]: Spent 24.36 s on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2018-11-23 00:31:55,806 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:31:55,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:31:55,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:31:55,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:31:55,807 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:31:55,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:31:55,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:31:55,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:31:55,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-23 00:31:55,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:31:55,807 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:31:55,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:55,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:55,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:55,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:55,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:55,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:55,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:55,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:55,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:55,880 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 00:31:56,102 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2018-11-23 00:31:56,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:56,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:56,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:56,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:56,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:56,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:56,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:31:56,349 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-23 00:31:56,652 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-11-23 00:31:56,663 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:31:56,664 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:31:56,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:31:56,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:56,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:56,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:56,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:56,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:56,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:56,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:56,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:56,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:56,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:56,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:56,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:56,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:56,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:56,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:56,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:56,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:56,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:31:56,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:56,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:56,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:56,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:56,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:31:56,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:31:56,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:56,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-11-23 00:31:56,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:56,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:56,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:56,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:56,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:56,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:56,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:56,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:56,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:56,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:56,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:56,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:56,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:56,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:56,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:56,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:56,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:56,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-11-23 00:31:56,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:56,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:56,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:56,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:56,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:56,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:56,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:56,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:56,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:31:56,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:56,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:31:56,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:56,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:56,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:56,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:31:56,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:31:56,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:56,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-11-23 00:31:56,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:56,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:56,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:56,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:56,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:31:56,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:31:56,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:56,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-11-23 00:31:56,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:56,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:56,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:56,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:56,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:31:56,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:31:56,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:56,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:31:56,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:56,684 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:31:56,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:56,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:56,685 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:31:56,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:31:56,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:31:56,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:31:56,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:31:56,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:31:56,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:31:56,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:31:56,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:31:56,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:31:56,711 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:31:56,721 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 00:31:56,721 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 00:31:56,722 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:31:56,722 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-23 00:31:56,723 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:31:56,723 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 1 Supporting invariants [-1*~N~0 + 2 >= 0] [2018-11-23 00:31:56,775 INFO L297 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2018-11-23 00:31:56,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:56,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:56,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:31:56,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:31:56,861 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-11-23 00:31:56,861 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-23 00:31:57,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 50 states and 62 transitions. Complement of second has 15 states. [2018-11-23 00:31:57,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-23 00:31:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 00:31:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2018-11-23 00:31:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 43 transitions. Stem has 17 letters. Loop has 2 letters. [2018-11-23 00:31:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:31:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 43 transitions. Stem has 19 letters. Loop has 2 letters. [2018-11-23 00:31:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:31:57,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 43 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-23 00:31:57,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:31:57,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. [2018-11-23 00:31:57,006 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 00:31:57,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 46 states and 55 transitions. [2018-11-23 00:31:57,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 00:31:57,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 00:31:57,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 55 transitions. [2018-11-23 00:31:57,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:31:57,007 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-23 00:31:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 55 transitions. [2018-11-23 00:31:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-11-23 00:31:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 00:31:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 00:31:57,009 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 00:31:57,009 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 00:31:57,009 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 00:31:57,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2018-11-23 00:31:57,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 00:31:57,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:31:57,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:31:57,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:31:57,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:31:57,011 INFO L794 eck$LassoCheckResult]: Stem: 754#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 753#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 752#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;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 747#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 748#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 749#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 750#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 774#L11-3 assume !(sum_~i~0 < ~N~0); 773#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 772#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 771#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 770#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 769#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 765#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 764#L11-8 assume !(sum_~i~0 < ~N~0); 755#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 756#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 762#L32-3 assume !(main_~i~1 < ~N~0 - 1); 739#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 740#L11-13 [2018-11-23 00:31:57,011 INFO L796 eck$LassoCheckResult]: Loop: 740#L11-13 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 751#L11-12 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 740#L11-13 [2018-11-23 00:31:57,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:57,011 INFO L82 PathProgramCache]: Analyzing trace with hash 779721722, now seen corresponding path program 1 times [2018-11-23 00:31:57,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:57,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:57,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:57,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:57,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:31:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 00:31:57,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:31:57,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:31:57,063 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:31:57,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2018-11-23 00:31:57,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:57,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:57,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:57,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:57,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:57,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:31:57,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:31:57,087 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-23 00:31:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:31:57,114 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-23 00:31:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:31:57,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2018-11-23 00:31:57,117 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 00:31:57,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 48 transitions. [2018-11-23 00:31:57,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 00:31:57,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 00:31:57,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 48 transitions. [2018-11-23 00:31:57,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:31:57,118 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-23 00:31:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 48 transitions. [2018-11-23 00:31:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-23 00:31:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 00:31:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-23 00:31:57,120 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-23 00:31:57,120 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-23 00:31:57,120 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 00:31:57,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-11-23 00:31:57,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-23 00:31:57,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:31:57,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:31:57,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:31:57,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:31:57,121 INFO L794 eck$LassoCheckResult]: Stem: 843#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 842#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 841#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;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 833#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 834#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 835#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 836#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 863#L11-3 assume !(sum_~i~0 < ~N~0); 862#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 861#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 847#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 848#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 849#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 850#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 852#L11-8 assume !(sum_~i~0 < ~N~0); 844#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 845#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 853#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 832#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 831#L32-3 assume !(main_~i~1 < ~N~0 - 1); 825#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 826#L11-13 [2018-11-23 00:31:57,121 INFO L796 eck$LassoCheckResult]: Loop: 826#L11-13 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 838#L11-12 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 826#L11-13 [2018-11-23 00:31:57,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1988322460, now seen corresponding path program 1 times [2018-11-23 00:31:57,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:57,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:57,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:57,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:57,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2018-11-23 00:31:57,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:57,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:57,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:57,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:31:57,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:57,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:31:57,149 INFO L82 PathProgramCache]: Analyzing trace with hash -482560770, now seen corresponding path program 1 times [2018-11-23 00:31:57,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:31:57,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:31:57,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:57,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:31:57,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:31:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:31:57,863 WARN L180 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 172 [2018-11-23 00:32:00,230 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2018-11-23 00:32:00,231 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:32:00,232 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:32:00,232 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:32:00,232 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:32:00,232 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:32:00,232 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:32:00,232 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:32:00,232 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:32:00,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-23 00:32:00,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:32:00,232 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:32:00,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,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-11-23 00:32:00,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-11-23 00:32:00,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,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-11-23 00:32:00,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-11-23 00:32:00,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-11-23 00:32:00,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,316 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 00:32:00,539 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2018-11-23 00:32:00,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:32:00,911 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:32:00,911 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:32:00,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:32:00,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:32:00,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:32:00,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:32:00,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:32:00,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:32:00,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:32:00,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:32:00,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:32:00,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:32:00,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:32:00,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:32:00,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:32:00,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,957 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:32:00,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,959 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:32:00,959 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:32:00,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:32:00,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,970 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:32:00,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,971 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:32:00,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:32:00,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,980 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:32:00,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:32:00,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:32:00,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:32:00,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:32:00,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:00,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:00,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:00,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:00,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:32:00,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:32:00,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:32:00,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:32:01,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:32:01,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:32:01,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:32:01,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:32:01,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:32:01,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:32:01,014 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:32:01,031 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 00:32:01,031 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 00:32:01,031 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:32:01,032 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:32:01,032 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:32:01,032 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, v_rep(select #length ULTIMATE.start_sum_~x.base)_4, ULTIMATE.start_sum_~x.offset) = -4*ULTIMATE.start_sum_~i~0 + 1*v_rep(select #length ULTIMATE.start_sum_~x.base)_4 - 1*ULTIMATE.start_sum_~x.offset Supporting invariants [] [2018-11-23 00:32:01,070 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-23 00:32:01,071 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 00:32:01,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:01,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:32:01,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:32:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:32:01,130 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-11-23 00:32:01,130 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 00:32:01,138 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 41 states and 49 transitions. Complement of second has 4 states. [2018-11-23 00:32:01,138 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-11-23 00:32:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 00:32:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-23 00:32:01,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-23 00:32:01,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:32:01,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 23 letters. Loop has 2 letters. [2018-11-23 00:32:01,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:32:01,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 4 letters. [2018-11-23 00:32:01,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:32:01,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 49 transitions. [2018-11-23 00:32:01,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 00:32:01,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 24 states and 26 transitions. [2018-11-23 00:32:01,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 00:32:01,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 00:32:01,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2018-11-23 00:32:01,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:32:01,141 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 00:32:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2018-11-23 00:32:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 00:32:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 00:32:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 00:32:01,142 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 00:32:01,142 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 00:32:01,142 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 00:32:01,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-11-23 00:32:01,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 00:32:01,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:32:01,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:32:01,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:32:01,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:32:01,144 INFO L794 eck$LassoCheckResult]: Stem: 1028#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1027#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 1026#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;sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1022#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1023#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1024#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1025#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1037#L11-3 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1036#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1035#L11-3 assume !(sum_~i~0 < ~N~0); 1018#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1019#L14 main_#t~ret3 := sum_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1031#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1032#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1033#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1034#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1040#L11-8 assume !!(sum_~i~0 < ~N~0);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1039#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1038#L11-8 assume !(sum_~i~0 < ~N~0); 1029#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1030#L14-1 main_#t~ret6 := sum_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 1020#L32-3 [2018-11-23 00:32:01,144 INFO L796 eck$LassoCheckResult]: Loop: 1020#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 1021#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 1020#L32-3 [2018-11-23 00:32:01,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:01,144 INFO L82 PathProgramCache]: Analyzing trace with hash 972468242, now seen corresponding path program 3 times [2018-11-23 00:32:01,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:01,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:01,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:01,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:32:01,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:32:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:32:01,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:01,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 4 times [2018-11-23 00:32:01,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:01,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:01,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:01,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:32:01,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:32:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:32:01,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:32:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1760888524, now seen corresponding path program 2 times [2018-11-23 00:32:01,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:32:01,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:32:01,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:01,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:32:01,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:32:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:32:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:32:01,696 WARN L180 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 155 [2018-11-23 00:33:26,428 WARN L180 SmtUtils]: Spent 1.41 m on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2018-11-23 00:33:26,429 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:33:26,429 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:33:26,429 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:33:26,429 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:33:26,429 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:33:26,430 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:33:26,430 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:33:26,430 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:33:26,430 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration10_Lasso [2018-11-23 00:33:26,430 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:33:26,430 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:33:26,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,552 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 00:33:26,818 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2018-11-23 00:33:26,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:26,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:33:27,092 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-11-23 00:33:27,392 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-11-23 00:33:27,402 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:33:27,402 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:33:27,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:33:27,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:33:27,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:33:27,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:33:27,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:33:27,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:33:27,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:33:27,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:33:27,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:33:27,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:33:27,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:33:27,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:33:27,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:33:27,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:33:27,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:33:27,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:33:27,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:33:27,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:33:27,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:33:27,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:33:27,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:33:27,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:33:27,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:33:27,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:33:27,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:33:27,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:33:27,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:33:27,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:33:27,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:33:27,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:33:27,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:33:27,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:33:27,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:33:27,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:33:27,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:33:27,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,429 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:33:27,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,430 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 00:33:27,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:33:27,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:33:27,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:33:27,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:33:27,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-11-23 00:33:27,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:33:27,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:33:27,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:33:27,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:33:27,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:33:27,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:33:27,453 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:33:27,462 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 00:33:27,462 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 00:33:27,463 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:33:27,463 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:33:27,463 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:33:27,464 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_main_~i~1) = 1*~N~0 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-23 00:33:27,561 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 00:33:27,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:33:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:27,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:33:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:33:27,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:33:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:33:27,588 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-11-23 00:33:27,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 00:33:27,592 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 28 transitions. Complement of second has 4 states. [2018-11-23 00:33:27,593 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-11-23 00:33:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 00:33:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-23 00:33:27,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 21 letters. Loop has 2 letters. [2018-11-23 00:33:27,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:33:27,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 23 letters. Loop has 2 letters. [2018-11-23 00:33:27,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:33:27,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 21 letters. Loop has 4 letters. [2018-11-23 00:33:27,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:33:27,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2018-11-23 00:33:27,594 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:33:27,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-11-23 00:33:27,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 00:33:27,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 00:33:27,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 00:33:27,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:33:27,594 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:33:27,594 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:33:27,594 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:33:27,595 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 00:33:27,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:33:27,595 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:33:27,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 00:33:27,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:33:27 BoogieIcfgContainer [2018-11-23 00:33:27,599 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 00:33:27,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:33:27,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:33:27,599 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:33:27,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:31:28" (3/4) ... [2018-11-23 00:33:27,602 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:33:27,602 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:33:27,603 INFO L168 Benchmark]: Toolchain (without parser) took 120099.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 959.1 MB in the beginning and 971.7 MB in the end (delta: -12.5 MB). Peak memory consumption was 155.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,603 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:33:27,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.56 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,605 INFO L168 Benchmark]: Boogie Preprocessor took 59.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,605 INFO L168 Benchmark]: RCFGBuilder took 246.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,605 INFO L168 Benchmark]: BuchiAutomizer took 119593.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 971.7 MB in the end (delta: 110.3 MB). Peak memory consumption was 176.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:33:27,606 INFO L168 Benchmark]: Witness Printer took 3.35 ms. Allocated memory is still 1.2 GB. Free memory is still 971.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:33:27,608 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.56 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 246.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 119593.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 971.7 MB in the end (delta: 110.3 MB). Peak memory consumption was 176.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.35 ms. Allocated memory is still 1.2 GB. Free memory is still 971.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 10 terminating modules (5 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] and consists of 5 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 -2 * i + 1 and consists of 12 locations. One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] + -1 * x and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 119.5s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 118.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 115 SDtfs, 151 SDslu, 56 SDs, 0 SdLazy, 214 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital375 mio100 ax100 hnf99 lsp109 ukn63 mio100 lsp53 div105 bol100 ite100 ukn100 eq166 hnf79 smp82 dnf270 smp55 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms 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...