./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/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_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/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-635dfa2 [2018-12-09 11:34:31,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:34:31,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:34:31,575 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:34:31,575 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:34:31,576 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:34:31,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:34:31,577 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:34:31,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:34:31,578 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:34:31,579 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:34:31,579 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:34:31,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:34:31,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:34:31,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:34:31,581 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:34:31,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:34:31,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:34:31,583 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:34:31,584 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:34:31,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:34:31,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:34:31,586 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:34:31,586 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:34:31,586 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:34:31,587 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:34:31,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:34:31,587 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:34:31,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:34:31,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:34:31,589 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:34:31,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:34:31,589 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:34:31,589 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:34:31,590 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:34:31,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:34:31,590 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-09 11:34:31,598 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:34:31,598 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:34:31,599 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:34:31,599 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:34:31,599 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 11:34:31,599 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 11:34:31,599 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 11:34:31,599 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 11:34:31,599 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 11:34:31,599 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 11:34:31,599 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 11:34:31,600 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:34:31,600 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:34:31,600 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 11:34:31,600 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:34:31,600 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:34:31,600 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:34:31,600 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 11:34:31,600 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 11:34:31,600 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 11:34:31,600 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:34:31,600 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:34:31,600 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 11:34:31,601 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:34:31,601 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 11:34:31,601 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:34:31,601 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:34:31,601 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 11:34:31,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:34:31,601 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 11:34:31,601 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 11:34:31,602 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 11:34:31,602 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_e63aebf8-24aa-4005-a227-528c65b88b55/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-12-09 11:34:31,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:34:31,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:34:31,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:34:31,629 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:34:31,629 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:34:31,630 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-12-09 11:34:31,666 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/data/ec20898f3/e2f155b81fe24067bc37d651909e0f9e/FLAGa926b59c8 [2018-12-09 11:34:32,057 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:34:32,057 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/sv-benchmarks/c/reducercommutativity/sum_true-unreach-call_true-termination.i [2018-12-09 11:34:32,060 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/data/ec20898f3/e2f155b81fe24067bc37d651909e0f9e/FLAGa926b59c8 [2018-12-09 11:34:32,069 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/data/ec20898f3/e2f155b81fe24067bc37d651909e0f9e [2018-12-09 11:34:32,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:34:32,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:34:32,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:34:32,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:34:32,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:34:32,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:34:32" (1/1) ... [2018-12-09 11:34:32,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343f3083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32, skipping insertion in model container [2018-12-09 11:34:32,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:34:32" (1/1) ... [2018-12-09 11:34:32,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:34:32,094 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:34:32,192 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:34:32,197 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:34:32,209 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:34:32,217 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:34:32,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32 WrapperNode [2018-12-09 11:34:32,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:34:32,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:34:32,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:34:32,218 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:34:32,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32" (1/1) ... [2018-12-09 11:34:32,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32" (1/1) ... [2018-12-09 11:34:32,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:34:32,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:34:32,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:34:32,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:34:32,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32" (1/1) ... [2018-12-09 11:34:32,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32" (1/1) ... [2018-12-09 11:34:32,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32" (1/1) ... [2018-12-09 11:34:32,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32" (1/1) ... [2018-12-09 11:34:32,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32" (1/1) ... [2018-12-09 11:34:32,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32" (1/1) ... [2018-12-09 11:34:32,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32" (1/1) ... [2018-12-09 11:34:32,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:34:32,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:34:32,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:34:32,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:34:32,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 11:34:32,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 11:34:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:34:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:34:32,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:34:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 11:34:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:34:32,468 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:34:32,468 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-12-09 11:34:32,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:34:32 BoogieIcfgContainer [2018-12-09 11:34:32,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:34:32,469 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 11:34:32,469 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 11:34:32,471 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 11:34:32,472 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:34:32,472 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 11:34:32" (1/3) ... [2018-12-09 11:34:32,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67b681e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 11:34:32, skipping insertion in model container [2018-12-09 11:34:32,473 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:34:32,473 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:34:32" (2/3) ... [2018-12-09 11:34:32,473 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67b681e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 11:34:32, skipping insertion in model container [2018-12-09 11:34:32,474 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:34:32,474 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:34:32" (3/3) ... [2018-12-09 11:34:32,475 INFO L375 chiAutomizerObserver]: Analyzing ICFG sum_true-unreach-call_true-termination.i [2018-12-09 11:34:32,516 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 11:34:32,517 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 11:34:32,517 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 11:34:32,517 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 11:34:32,517 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:34:32,517 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:34:32,517 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 11:34:32,517 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:34:32,517 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 11:34:32,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-09 11:34:32,540 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 11:34:32,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:34:32,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:34:32,545 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 11:34:32,545 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:34:32,545 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 11:34:32,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-12-09 11:34:32,546 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-09 11:34:32,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:34:32,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:34:32,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 11:34:32,547 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:34:32,552 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-12-09 11:34:32,552 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-12-09 11:34:32,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:32,556 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-12-09 11:34:32,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:32,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:32,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:32,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:32,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:32,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2018-12-09 11:34:32,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:32,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:32,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:32,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:32,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:32,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:32,641 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2018-12-09 11:34:32,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:32,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:32,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:32,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:32,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:32,766 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 11:34:32,767 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 11:34:32,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 11:34:32,767 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 11:34:32,768 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 11:34:32,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 11:34:32,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 11:34:32,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 11:34:32,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-09 11:34:32,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 11:34:32,768 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 11:34:32,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:32,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:33,025 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 11:34:33,028 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 11:34:33,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:33,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:33,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:33,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:33,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:33,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:33,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:33,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:33,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:33,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:33,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:33,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:33,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:33,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:33,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:33,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:33,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:33,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:33,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:33,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:33,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:33,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:33,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:33,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:33,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:33,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:33,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:33,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:33,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:33,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:33,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:33,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:33,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:33,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:33,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:33,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:33,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:33,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:33,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:33,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:33,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:33,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:33,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:33,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:33,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:33,101 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 11:34:33,127 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-09 11:34:33,127 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 11:34:33,129 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 11:34:33,130 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 11:34:33,130 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 11:34:33,130 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_sum_~x.offset) = -4*ULTIMATE.start_sum_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 1*ULTIMATE.start_sum_~x.offset Supporting invariants [] [2018-12-09 11:34:33,140 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 11:34:33,148 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 11:34:33,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:33,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:34:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:33,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:34:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:34:33,214 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 11:34:33,215 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2018-12-09 11:34:33,259 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-12-09 11:34:33,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 11:34:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 11:34:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-12-09 11:34:33,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-09 11:34:33,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:33,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-09 11:34:33,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:33,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-09 11:34:33,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:33,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2018-12-09 11:34:33,267 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 11:34:33,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2018-12-09 11:34:33,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 11:34:33,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-09 11:34:33,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-12-09 11:34:33,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:34:33,271 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-09 11:34:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-12-09 11:34:33,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-09 11:34:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 11:34:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-12-09 11:34:33,287 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-09 11:34:33,287 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-09 11:34:33,287 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 11:34:33,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-12-09 11:34:33,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 11:34:33,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:34:33,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:34:33,288 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 11:34:33,288 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:34:33,289 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-12-09 11:34:33,289 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-12-09 11:34:33,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:33,289 INFO L82 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2018-12-09 11:34:33,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:33,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:33,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:33,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:33,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:34:33,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:34:33,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:34:33,320 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 11:34:33,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:33,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2018-12-09 11:34:33,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:33,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:33,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:33,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:34:33,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:34:33,348 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-09 11:34:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:34:33,367 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-12-09 11:34:33,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:34:33,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-12-09 11:34:33,368 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 11:34:33,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-12-09 11:34:33,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-09 11:34:33,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-09 11:34:33,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-12-09 11:34:33,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:34:33,369 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-09 11:34:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-12-09 11:34:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-09 11:34:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 11:34:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-12-09 11:34:33,371 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-09 11:34:33,371 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-09 11:34:33,371 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 11:34:33,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-12-09 11:34:33,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 11:34:33,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:34:33,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:34:33,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:34:33,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:34:33,373 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-12-09 11:34:33,373 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-12-09 11:34:33,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:33,373 INFO L82 PathProgramCache]: Analyzing trace with hash 123162473, now seen corresponding path program 1 times [2018-12-09 11:34:33,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:33,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:33,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:34:33,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:34:33,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:34:33,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:33,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:34:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:34:33,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:34:33,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-09 11:34:33,448 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 11:34:33,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:33,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 2 times [2018-12-09 11:34:33,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:33,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:33,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:33,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:33,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:34:33,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:34:33,470 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-12-09 11:34:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:34:33,496 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-12-09 11:34:33,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:34:33,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-12-09 11:34:33,497 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 11:34:33,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-12-09 11:34:33,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-09 11:34:33,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-09 11:34:33,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-09 11:34:33,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:34:33,498 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 11:34:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-09 11:34:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-09 11:34:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 11:34:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-12-09 11:34:33,499 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-09 11:34:33,499 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-12-09 11:34:33,499 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 11:34:33,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-12-09 11:34:33,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-09 11:34:33,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:34:33,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:34:33,500 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 11:34:33,500 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:34:33,500 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-12-09 11:34:33,500 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-12-09 11:34:33,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228857, now seen corresponding path program 2 times [2018-12-09 11:34:33,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:33,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:33,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:34:33,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:33,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:33,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 3 times [2018-12-09 11:34:33,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:33,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:33,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:34:33,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:33,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:33,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1163170153, now seen corresponding path program 1 times [2018-12-09 11:34:33,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:33,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:33,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:34:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:33,749 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-12-09 11:34:33,871 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-12-09 11:34:33,873 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 11:34:33,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 11:34:33,873 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 11:34:33,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 11:34:33,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 11:34:33,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 11:34:33,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 11:34:33,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 11:34:33,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration4_Lasso [2018-12-09 11:34:33,874 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 11:34:33,874 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 11:34:33,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:33,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:33,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:33,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:33,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:33,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,111 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-12-09 11:34:34,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:34,334 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 11:34:34,334 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 11:34:34,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:34,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:34,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:34,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:34,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:34,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:34,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:34,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:34,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:34,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:34,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:34,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:34,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:34,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:34,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:34,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:34,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:34,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:34,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:34,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:34,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:34,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:34,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:34,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:34,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:34,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:34,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:34,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:34,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:34,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:34,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:34,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:34,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:34,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:34,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:34,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:34,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:34,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:34,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:34,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:34,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:34,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:34,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:34,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:34,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:34,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:34,345 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 11:34:34,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:34,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:34,347 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 11:34:34,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:34,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:34,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:34,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:34,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:34,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:34,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:34,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:34,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:34,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:34,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:34,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:34,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:34,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:34,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:34,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:34,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:34,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:34,371 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 11:34:34,388 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 11:34:34,388 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 11:34:34,388 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 11:34:34,389 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 11:34:34,389 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 11:34:34,389 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_sum_~x.base)_2) = -4*ULTIMATE.start_sum_~i~0 - 1*ULTIMATE.start_sum_~x.offset + 1*v_rep(select #length ULTIMATE.start_sum_~x.base)_2 Supporting invariants [] [2018-12-09 11:34:34,397 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 11:34:34,397 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 11:34:34,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:34,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:34:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:34,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:34:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:34:34,437 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 11:34:34,438 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 11:34:34,455 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-12-09 11:34:34,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 11:34:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 11:34:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-09 11:34:34,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-09 11:34:34,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:34,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 2 letters. [2018-12-09 11:34:34,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:34,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-09 11:34:34,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:34,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-12-09 11:34:34,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-09 11:34:34,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 24 transitions. [2018-12-09 11:34:34,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 11:34:34,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 11:34:34,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-12-09 11:34:34,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:34:34,458 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-12-09 11:34:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-12-09 11:34:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 11:34:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 11:34:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2018-12-09 11:34:34,459 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-12-09 11:34:34,459 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-12-09 11:34:34,459 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 11:34:34,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2018-12-09 11:34:34,459 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-09 11:34:34,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:34:34,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:34:34,460 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:34:34,460 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:34:34,460 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-12-09 11:34:34,460 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-12-09 11:34:34,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1698534614, now seen corresponding path program 1 times [2018-12-09 11:34:34,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:34,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:34,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:34,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 11:34:34,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:34:34,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:34:34,483 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 11:34:34,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 1 times [2018-12-09 11:34:34,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:34,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:34,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:34,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:34,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:34:34,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:34:34,521 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 11:34:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:34:34,539 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-12-09 11:34:34,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:34:34,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-12-09 11:34:34,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-09 11:34:34,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2018-12-09 11:34:34,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 11:34:34,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-09 11:34:34,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2018-12-09 11:34:34,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:34:34,540 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-09 11:34:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2018-12-09 11:34:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-12-09 11:34:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 11:34:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-09 11:34:34,541 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 11:34:34,541 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 11:34:34,541 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 11:34:34,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-09 11:34:34,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-09 11:34:34,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:34:34,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:34:34,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:34:34,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:34:34,542 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-12-09 11:34:34,542 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-12-09 11:34:34,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash 205910964, now seen corresponding path program 1 times [2018-12-09 11:34:34,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:34,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:34,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:34,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 11:34:34,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:34:34,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e63aebf8-24aa-4005-a227-528c65b88b55/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:34:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:34,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:34:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 11:34:34,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:34:34,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-09 11:34:34,617 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 11:34:34,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 2 times [2018-12-09 11:34:34,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:34,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:34,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:34:34,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:34:34,646 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-12-09 11:34:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:34:34,683 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-09 11:34:34,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:34:34,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-12-09 11:34:34,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-09 11:34:34,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2018-12-09 11:34:34,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-09 11:34:34,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-09 11:34:34,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-12-09 11:34:34,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:34:34,685 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-09 11:34:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-12-09 11:34:34,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-12-09 11:34:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 11:34:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-12-09 11:34:34,686 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-09 11:34:34,686 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-09 11:34:34,687 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 11:34:34,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-12-09 11:34:34,687 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-09 11:34:34,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:34:34,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:34:34,688 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:34:34,688 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:34:34,688 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-12-09 11:34:34,688 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-12-09 11:34:34,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:34,688 INFO L82 PathProgramCache]: Analyzing trace with hash 313660178, now seen corresponding path program 2 times [2018-12-09 11:34:34,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:34,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:34,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:34:34,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:34,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:34,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 3 times [2018-12-09 11:34:34,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:34,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:34:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:34,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:34,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:34,712 INFO L82 PathProgramCache]: Analyzing trace with hash 779721780, now seen corresponding path program 1 times [2018-12-09 11:34:34,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:34,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:34,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:34:34,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:35,067 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 136 [2018-12-09 11:34:47,477 WARN L180 SmtUtils]: Spent 12.40 s on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2018-12-09 11:34:47,478 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 11:34:47,478 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 11:34:47,478 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 11:34:47,478 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 11:34:47,478 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 11:34:47,479 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 11:34:47,479 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 11:34:47,479 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 11:34:47,479 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-09 11:34:47,479 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 11:34:47,479 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 11:34:47,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-12-09 11:34:47,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-12-09 11:34:47,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:47,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-12-09 11:34:47,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:47,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:47,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:47,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:47,566 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 11:34:47,813 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2018-12-09 11:34:47,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-12-09 11:34:47,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:47,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:47,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:47,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:47,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:47,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:47,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:48,043 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-12-09 11:34:48,315 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-12-09 11:34:48,327 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 11:34:48,327 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 11:34:48,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:48,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:48,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:48,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:48,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:48,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:48,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:48,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:48,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:48,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:48,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:48,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:48,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:48,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:48,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:48,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:48,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:48,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:48,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:48,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:48,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:48,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:48,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:48,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:48,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:48,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:48,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:48,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:48,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:48,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:48,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:48,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:48,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:48,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:48,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:48,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:48,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:48,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:48,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:48,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:48,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:48,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:48,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:48,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:48,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:48,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:48,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:48,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:48,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:48,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:48,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:48,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:48,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:48,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:48,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:48,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:48,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:48,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:48,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:48,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:48,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:48,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:48,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:48,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:48,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:48,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:48,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:48,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:48,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:48,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:48,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:48,344 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 11:34:48,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:48,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:48,345 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 11:34:48,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:48,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:48,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:48,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:48,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:48,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:48,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:48,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:48,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:48,361 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 11:34:48,366 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 11:34:48,366 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 11:34:48,367 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 11:34:48,367 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 11:34:48,368 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 11:34:48,368 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2018-12-09 11:34:48,385 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-09 11:34:48,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:48,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:34:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:48,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:34:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:34:48,427 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 11:34:48,427 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 11:34:48,438 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 27 states and 34 transitions. Complement of second has 6 states. [2018-12-09 11:34:48,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 11:34:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 11:34:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-09 11:34:48,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 2 letters. [2018-12-09 11:34:48,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:48,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 19 letters. Loop has 2 letters. [2018-12-09 11:34:48,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:48,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 4 letters. [2018-12-09 11:34:48,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:48,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-12-09 11:34:48,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 11:34:48,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 27 transitions. [2018-12-09 11:34:48,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 11:34:48,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 11:34:48,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-12-09 11:34:48,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:34:48,441 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-09 11:34:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-12-09 11:34:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-09 11:34:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 11:34:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-09 11:34:48,442 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-09 11:34:48,442 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-09 11:34:48,442 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 11:34:48,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-12-09 11:34:48,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 11:34:48,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:34:48,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:34:48,442 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:34:48,442 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:34:48,443 INFO L794 eck$LassoCheckResult]: Stem: 695#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 694#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; 693#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; 688#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; 689#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 690#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; 691#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 702#L11-3 assume !(sum_~i~0 < ~N~0); 683#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 684#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; 698#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; 699#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 700#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; 701#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 703#L11-8 assume !(sum_~i~0 < ~N~0); 696#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 697#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; 685#L32-3 assume !(main_~i~1 < ~N~0 - 1); 681#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; 682#L11-13 [2018-12-09 11:34:48,443 INFO L796 eck$LassoCheckResult]: Loop: 682#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; 692#L11-12 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 682#L11-13 [2018-12-09 11:34:48,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:48,443 INFO L82 PathProgramCache]: Analyzing trace with hash 779721722, now seen corresponding path program 1 times [2018-12-09 11:34:48,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:48,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:48,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:48,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:48,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 11:34:48,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:34:48,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:34:48,468 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 11:34:48,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:48,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2018-12-09 11:34:48,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:48,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:48,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:48,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:48,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:48,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:34:48,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:34:48,486 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 11:34:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:34:48,502 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-12-09 11:34:48,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:34:48,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2018-12-09 11:34:48,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 11:34:48,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 27 transitions. [2018-12-09 11:34:48,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 11:34:48,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 11:34:48,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-12-09 11:34:48,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:34:48,503 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-09 11:34:48,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-12-09 11:34:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-09 11:34:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-09 11:34:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-09 11:34:48,504 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-09 11:34:48,504 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-09 11:34:48,504 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 11:34:48,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-12-09 11:34:48,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-09 11:34:48,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:34:48,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:34:48,505 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:34:48,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:34:48,505 INFO L794 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 748#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; 747#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; 742#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; 743#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 744#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; 745#L11-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 756#L11-3 assume !(sum_~i~0 < ~N~0); 737#L11-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 738#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; 752#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; 753#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 754#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; 755#L11-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 757#L11-8 assume !(sum_~i~0 < ~N~0); 750#L11-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 751#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; 739#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; 740#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 741#L32-3 assume !(main_~i~1 < ~N~0 - 1); 735#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; 736#L11-13 [2018-12-09 11:34:48,505 INFO L796 eck$LassoCheckResult]: Loop: 736#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; 746#L11-12 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 736#L11-13 [2018-12-09 11:34:48,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1988322460, now seen corresponding path program 1 times [2018-12-09 11:34:48,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:48,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:48,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:48,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:48,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:48,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2018-12-09 11:34:48,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:48,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:48,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:34:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:48,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:48,526 INFO L82 PathProgramCache]: Analyzing trace with hash -482560770, now seen corresponding path program 1 times [2018-12-09 11:34:48,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:34:48,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:34:48,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:48,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:34:48,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:34:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:34:49,272 WARN L180 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 174 [2018-12-09 11:34:51,211 WARN L180 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2018-12-09 11:34:51,213 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 11:34:51,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 11:34:51,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 11:34:51,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 11:34:51,213 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 11:34:51,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 11:34:51,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 11:34:51,213 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 11:34:51,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum_true-unreach-call_true-termination.i_Iteration9_Lasso [2018-12-09 11:34:51,214 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 11:34:51,214 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 11:34:51,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,268 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 11:34:51,479 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-12-09 11:34:51,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:34:51,747 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 11:34:51,747 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 11:34:51,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:51,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:51,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:51,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:51,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:51,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:51,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:51,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:51,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:51,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:51,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:51,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:51,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:51,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:51,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:51,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:51,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:51,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:51,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:51,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:51,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:51,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:51,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:51,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:51,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:51,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:51,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:51,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:51,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:51,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:51,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:51,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:51,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:51,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:51,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:51,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:51,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:51,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:51,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:51,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:51,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:51,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:51,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:51,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:51,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:51,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:51,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:51,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:51,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:51,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:51,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:51,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:51,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:51,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:51,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:51,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:51,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:51,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:51,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:51,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:51,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:51,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:51,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:51,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:51,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:51,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:51,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:51,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:51,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:51,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:51,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:51,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:51,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:34:51,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:51,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:51,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:51,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:34:51,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:34:51,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:51,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:51,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:51,759 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 11:34:51,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:51,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:51,759 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 11:34:51,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:51,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:34:51,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:34:51,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:34:51,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:34:51,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:34:51,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:34:51,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:34:51,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:34:51,769 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 11:34:51,776 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 11:34:51,776 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 11:34:51,776 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 11:34:51,776 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 11:34:51,777 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 11:34:51,777 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_sum_~x.base)_4) = -4*ULTIMATE.start_sum_~i~0 - 1*ULTIMATE.start_sum_~x.offset + 1*v_rep(select #length ULTIMATE.start_sum_~x.base)_4 Supporting invariants [] [2018-12-09 11:34:51,788 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 11:34:51,788 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 11:34:51,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:34:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:51,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:34:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:34:51,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:34:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:34:51,819 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 11:34:51,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 11:34:51,824 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 25 states and 29 transitions. Complement of second has 4 states. [2018-12-09 11:34:51,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-09 11:34:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 11:34:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-12-09 11:34:51,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 2 letters. [2018-12-09 11:34:51,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:51,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 23 letters. Loop has 2 letters. [2018-12-09 11:34:51,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:51,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 4 letters. [2018-12-09 11:34:51,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:34:51,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-12-09 11:34:51,825 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 11:34:51,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-12-09 11:34:51,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 11:34:51,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 11:34:51,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 11:34:51,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:34:51,825 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:34:51,825 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:34:51,825 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:34:51,826 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 11:34:51,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 11:34:51,826 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 11:34:51,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 11:34:51,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 11:34:51 BoogieIcfgContainer [2018-12-09 11:34:51,830 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 11:34:51,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:34:51,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:34:51,830 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:34:51,831 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:34:32" (3/4) ... [2018-12-09 11:34:51,833 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 11:34:51,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:34:51,833 INFO L168 Benchmark]: Toolchain (without parser) took 19762.84 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 959.8 MB in the beginning and 1.1 GB in the end (delta: -105.6 MB). Peak memory consumption was 200.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:34:51,834 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:34:51,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.03 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:34:51,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 949.0 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:34:51,835 INFO L168 Benchmark]: Boogie Preprocessor took 17.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 11:34:51,835 INFO L168 Benchmark]: RCFGBuilder took 179.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-09 11:34:51,835 INFO L168 Benchmark]: BuchiAutomizer took 19361.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 216.6 MB. Max. memory is 11.5 GB. [2018-12-09 11:34:51,836 INFO L168 Benchmark]: Witness Printer took 2.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:34:51,838 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.03 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 949.0 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 179.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19361.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.8 MB). Peak memory consumption was 216.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.85 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (5 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] + -1 * x and consists of 5 locations. One deterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -4 * i + -1 * x + unknown-#length-unknown[x] 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 19.3s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 18.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 108 SDtfs, 110 SDslu, 44 SDs, 0 SdLazy, 179 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital356 mio100 ax100 hnf99 lsp111 ukn63 mio100 lsp53 div104 bol100 ite100 ukn100 eq164 hnf81 smp85 dnf204 smp61 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...