./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/max05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/reducercommutativity/max05_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d02fdead04c3e6f93d11e2edd6641f56f1584022 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:09:56,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:09:56,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:09:56,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:09:56,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:09:56,334 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:09:56,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:09:56,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:09:56,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:09:56,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:09:56,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:09:56,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:09:56,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:09:56,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:09:56,345 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:09:56,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:09:56,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:09:56,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:09:56,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:09:56,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:09:56,354 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:09:56,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:09:56,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:09:56,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:09:56,359 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:09:56,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:09:56,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:09:56,363 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:09:56,364 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:09:56,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:09:56,365 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:09:56,366 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:09:56,366 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:09:56,367 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:09:56,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:09:56,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:09:56,369 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:09:56,386 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:09:56,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:09:56,388 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:09:56,388 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:09:56,388 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:09:56,388 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:09:56,389 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:09:56,389 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:09:56,389 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:09:56,389 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:09:56,389 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:09:56,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:09:56,391 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:09:56,391 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:09:56,391 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:09:56,391 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:09:56,391 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:09:56,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:09:56,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:09:56,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:09:56,392 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:09:56,392 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:09:56,392 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:09:56,394 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:09:56,394 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:09:56,394 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:09:56,394 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:09:56,395 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:09:56,395 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:09:56,395 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:09:56,396 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:09:56,397 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:09:56,397 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d02fdead04c3e6f93d11e2edd6641f56f1584022 [2018-11-29 00:09:56,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:09:56,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:09:56,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:09:56,475 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:09:56,476 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:09:56,477 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2018-11-29 00:09:56,542 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71bab697/48d9f02708814a8580d79f2b0fcfd413/FLAG9f17dca1c [2018-11-29 00:09:57,025 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:09:57,025 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2018-11-29 00:09:57,031 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71bab697/48d9f02708814a8580d79f2b0fcfd413/FLAG9f17dca1c [2018-11-29 00:09:57,370 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71bab697/48d9f02708814a8580d79f2b0fcfd413 [2018-11-29 00:09:57,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:09:57,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:09:57,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:09:57,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:09:57,383 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:09:57,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:09:57" (1/1) ... [2018-11-29 00:09:57,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbc0696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57, skipping insertion in model container [2018-11-29 00:09:57,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:09:57" (1/1) ... [2018-11-29 00:09:57,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:09:57,419 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:09:57,679 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:09:57,695 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:09:57,733 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:09:57,752 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:09:57,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57 WrapperNode [2018-11-29 00:09:57,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:09:57,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:09:57,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:09:57,754 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:09:57,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57" (1/1) ... [2018-11-29 00:09:57,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57" (1/1) ... [2018-11-29 00:09:57,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:09:57,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:09:57,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:09:57,825 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:09:57,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57" (1/1) ... [2018-11-29 00:09:57,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57" (1/1) ... [2018-11-29 00:09:57,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57" (1/1) ... [2018-11-29 00:09:57,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57" (1/1) ... [2018-11-29 00:09:57,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57" (1/1) ... [2018-11-29 00:09:57,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57" (1/1) ... [2018-11-29 00:09:57,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57" (1/1) ... [2018-11-29 00:09:57,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:09:57,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:09:57,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:09:57,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:09:57,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:09:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:09:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:09:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:09:58,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:09:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:09:58,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:09:58,598 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:09:58,599 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-29 00:09:58,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:09:58 BoogieIcfgContainer [2018-11-29 00:09:58,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:09:58,600 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:09:58,600 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:09:58,604 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:09:58,605 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:09:58,606 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:09:57" (1/3) ... [2018-11-29 00:09:58,607 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22151ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:09:58, skipping insertion in model container [2018-11-29 00:09:58,607 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:09:58,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:57" (2/3) ... [2018-11-29 00:09:58,608 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22151ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:09:58, skipping insertion in model container [2018-11-29 00:09:58,608 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:09:58,608 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:09:58" (3/3) ... [2018-11-29 00:09:58,610 INFO L375 chiAutomizerObserver]: Analyzing ICFG max05_true-unreach-call_true-termination.i [2018-11-29 00:09:58,678 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:09:58,679 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:09:58,679 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:09:58,680 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:09:58,680 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:09:58,680 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:09:58,680 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:09:58,681 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:09:58,681 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:09:58,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-29 00:09:58,725 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2018-11-29 00:09:58,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:09:58,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:09:58,734 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:09:58,734 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:09:58,734 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:09:58,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-29 00:09:58,739 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2018-11-29 00:09:58,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:09:58,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:09:58,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-29 00:09:58,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:09:58,750 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 30#L23-3true [2018-11-29 00:09:58,751 INFO L796 eck$LassoCheckResult]: Loop: 30#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 10#L23-2true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 30#L23-3true [2018-11-29 00:09:58,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:09:58,757 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-29 00:09:58,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:09:58,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:09:58,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:09:58,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:09:58,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:09:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:09:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:09:58,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:09:58,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-29 00:09:58,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:09:58,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:09:58,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:09:58,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:09:58,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:09:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:09:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:09:58,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:09:58,905 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-29 00:09:58,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:09:58,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:09:58,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:09:58,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:09:58,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:09:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:09:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:09:59,265 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-29 00:09:59,384 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:09:59,385 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:09:59,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:09:59,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:09:59,385 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:09:59,386 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:09:59,386 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:09:59,386 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:09:59,386 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-29 00:09:59,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:09:59,387 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:09:59,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,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-11-29 00:09:59,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-11-29 00:09:59,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-11-29 00:09:59,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:09:59,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:00,268 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-29 00:10:00,373 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:00,378 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:00,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:00,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:00,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:00,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:00,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:00,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:00,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:00,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:00,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:00,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:00,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:00,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:00,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:00,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:00,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:00,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:00,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:00,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:00,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:00,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:00,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:00,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:00,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:00,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:00,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:00,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:00,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:00,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:00,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:00,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,429 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:00,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,432 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:00,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:00,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:00,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:00,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:00,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:00,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:00,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:00,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:00,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:00,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:00,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:00,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:00,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:00,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:00,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:00,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:00,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:00,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:00,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:00,558 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:00,630 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-29 00:10:00,630 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-29 00:10:00,634 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:00,636 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:00,636 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:00,637 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2018-11-29 00:10:00,654 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-29 00:10:00,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:10:00,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:00,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:00,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:00,856 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:00,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2018-11-29 00:10:01,064 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 84 states and 119 transitions. Complement of second has 8 states. [2018-11-29 00:10:01,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-29 00:10:01,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-29 00:10:01,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:01,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-29 00:10:01,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:01,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-29 00:10:01,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:01,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2018-11-29 00:10:01,079 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:01,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2018-11-29 00:10:01,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-29 00:10:01,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-29 00:10:01,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2018-11-29 00:10:01,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:01,088 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-29 00:10:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2018-11-29 00:10:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-29 00:10:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-29 00:10:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-11-29 00:10:01,119 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-29 00:10:01,119 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-29 00:10:01,119 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:10:01,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-11-29 00:10:01,121 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:01,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:01,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:01,122 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:01,122 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:01,122 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 175#L23-3 assume !(main_~i~1 < 5); 174#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 163#L9-3 [2018-11-29 00:10:01,122 INFO L796 eck$LassoCheckResult]: Loop: 163#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 164#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 173#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 168#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 163#L9-3 [2018-11-29 00:10:01,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-29 00:10:01,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:01,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:01,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:01,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:01,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:01,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:10:01,189 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:01,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:01,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2018-11-29 00:10:01,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:01,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:01,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:01,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:01,307 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-29 00:10:01,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:10:01,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:10:01,332 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-29 00:10:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:01,348 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2018-11-29 00:10:01,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:10:01,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-11-29 00:10:01,351 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:01,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2018-11-29 00:10:01,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-29 00:10:01,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-29 00:10:01,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2018-11-29 00:10:01,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:01,353 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-29 00:10:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2018-11-29 00:10:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-29 00:10:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-29 00:10:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-11-29 00:10:01,356 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-29 00:10:01,356 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-29 00:10:01,356 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:10:01,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2018-11-29 00:10:01,358 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:01,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:01,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:01,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:10:01,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:01,359 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 235#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 232#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 233#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 234#L23-3 assume !(main_~i~1 < 5); 231#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 220#L9-3 [2018-11-29 00:10:01,359 INFO L796 eck$LassoCheckResult]: Loop: 220#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 221#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 230#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 225#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 220#L9-3 [2018-11-29 00:10:01,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-29 00:10:01,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:01,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:01,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:01,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:01,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:01,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:01,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:01,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:01,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:01,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-29 00:10:01,517 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:01,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:01,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2018-11-29 00:10:01,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:01,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:01,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:01,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:01,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:10:01,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:10:01,648 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-29 00:10:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:01,718 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2018-11-29 00:10:01,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:10:01,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2018-11-29 00:10:01,721 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:01,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2018-11-29 00:10:01,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-29 00:10:01,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-29 00:10:01,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-11-29 00:10:01,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:01,723 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-29 00:10:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-11-29 00:10:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-29 00:10:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-29 00:10:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-11-29 00:10:01,726 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-29 00:10:01,726 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-29 00:10:01,726 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:10:01,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2018-11-29 00:10:01,728 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:01,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:01,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:01,728 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-29 00:10:01,728 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:01,729 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 312#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 308#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 309#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 310#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 311#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 318#L23-3 assume !(main_~i~1 < 5); 307#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 296#L9-3 [2018-11-29 00:10:01,729 INFO L796 eck$LassoCheckResult]: Loop: 296#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 297#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 306#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 301#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 296#L9-3 [2018-11-29 00:10:01,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-29 00:10:01,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:01,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:01,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:01,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:01,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:01,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:10:01,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:10:01,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:01,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:01,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:01,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-29 00:10:01,911 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:01,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:01,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2018-11-29 00:10:01,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:01,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:01,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:01,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:02,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:10:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:10:02,117 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-29 00:10:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:02,268 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-29 00:10:02,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:10:02,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-11-29 00:10:02,270 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:02,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2018-11-29 00:10:02,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-29 00:10:02,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-29 00:10:02,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2018-11-29 00:10:02,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:02,272 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-29 00:10:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2018-11-29 00:10:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-29 00:10:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-29 00:10:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-29 00:10:02,275 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-29 00:10:02,275 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-29 00:10:02,275 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:10:02,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2018-11-29 00:10:02,276 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:02,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:02,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:02,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-29 00:10:02,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:02,277 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 399#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 395#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 396#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 397#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 398#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 400#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 407#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 406#L23-3 assume !(main_~i~1 < 5); 394#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 383#L9-3 [2018-11-29 00:10:02,278 INFO L796 eck$LassoCheckResult]: Loop: 383#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 384#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 393#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 388#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 383#L9-3 [2018-11-29 00:10:02,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-29 00:10:02,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:02,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:02,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:02,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:02,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:02,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:02,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:10:02,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-29 00:10:02,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:02,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:02,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:02,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-29 00:10:02,546 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:02,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2018-11-29 00:10:02,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:02,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:02,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:02,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:10:02,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:10:02,638 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-29 00:10:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:02,668 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-11-29 00:10:02,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:10:02,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2018-11-29 00:10:02,672 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:02,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2018-11-29 00:10:02,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-29 00:10:02,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-29 00:10:02,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2018-11-29 00:10:02,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:02,675 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-29 00:10:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2018-11-29 00:10:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-29 00:10:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-29 00:10:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-29 00:10:02,681 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-29 00:10:02,681 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-29 00:10:02,681 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:10:02,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-11-29 00:10:02,682 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:02,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:02,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:02,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-29 00:10:02,685 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:02,685 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 497#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 498#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 507#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 506#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 505#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 504#L23-3 assume !(main_~i~1 < 5); 492#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 481#L9-3 [2018-11-29 00:10:02,685 INFO L796 eck$LassoCheckResult]: Loop: 481#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 482#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 491#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 486#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 481#L9-3 [2018-11-29 00:10:02,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-29 00:10:02,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:02,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:02,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:02,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:02,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:02,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:02,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:02,996 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-29 00:10:03,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-29 00:10:03,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:03,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:03,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:03,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-29 00:10:03,060 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:03,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2018-11-29 00:10:03,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:03,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:03,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:03,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:03,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-29 00:10:03,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-29 00:10:03,146 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2018-11-29 00:10:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:03,197 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-29 00:10:03,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:10:03,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2018-11-29 00:10:03,200 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:03,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2018-11-29 00:10:03,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-29 00:10:03,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-29 00:10:03,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2018-11-29 00:10:03,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:03,204 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-29 00:10:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2018-11-29 00:10:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-29 00:10:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-29 00:10:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-29 00:10:03,207 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-29 00:10:03,207 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-29 00:10:03,207 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:10:03,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2018-11-29 00:10:03,208 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-29 00:10:03,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:03,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:03,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-29 00:10:03,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:03,209 INFO L794 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 605#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 601#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 602#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 603#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 604#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 617#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 616#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 615#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 614#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 613#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 612#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 611#L23-3 assume !(main_~i~1 < 5); 600#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 589#L9-3 [2018-11-29 00:10:03,209 INFO L796 eck$LassoCheckResult]: Loop: 589#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 590#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 599#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 594#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 589#L9-3 [2018-11-29 00:10:03,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-29 00:10:03,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:03,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:03,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:03,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:03,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2018-11-29 00:10:03,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:03,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:03,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:03,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:03,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:03,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2018-11-29 00:10:03,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:03,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:03,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:03,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:03,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:03,863 WARN L180 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-11-29 00:10:03,939 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:03,939 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:03,939 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:03,939 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:03,940 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:03,940 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:03,940 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:03,940 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:03,940 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-29 00:10:03,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:03,940 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:03,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:03,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:04,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:04,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:04,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:04,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:04,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:04,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:04,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:04,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:04,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:04,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:04,723 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:04,723 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:04,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:04,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:04,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,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-11-29 00:10:04,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:04,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:04,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:04,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:04,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:04,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:04,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:04,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,831 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:04,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,832 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:04,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:04,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:04,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:04,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:04,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:04,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:04,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:04,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:04,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:04,881 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:04,888 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:04,888 INFO L444 ModelExtractionUtils]: 19 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-29 00:10:04,889 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:04,891 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:04,891 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:04,891 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 9 Supporting invariants [] [2018-11-29 00:10:04,971 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:10:05,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:05,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:05,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:05,119 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:05,119 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-29 00:10:05,232 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2018-11-29 00:10:05,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-29 00:10:05,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-29 00:10:05,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:05,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-29 00:10:05,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:05,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-29 00:10:05,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:05,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-11-29 00:10:05,239 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:05,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2018-11-29 00:10:05,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-29 00:10:05,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-29 00:10:05,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2018-11-29 00:10:05,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:05,242 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-29 00:10:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2018-11-29 00:10:05,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-29 00:10:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-29 00:10:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-29 00:10:05,247 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-29 00:10:05,247 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-29 00:10:05,247 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:10:05,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-11-29 00:10:05,247 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:05,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:05,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:05,251 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:05,251 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:05,251 INFO L794 eck$LassoCheckResult]: Stem: 771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 768#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 764#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 765#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 766#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 767#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 780#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 779#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 778#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 777#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 776#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 775#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 774#L23-3 assume !(main_~i~1 < 5); 763#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 751#L9-3 assume !(max_~i~0 < 5); 747#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 748#L12 main_#t~ret6 := max_#res;main_~ret~1 := 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;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 772#L9-8 [2018-11-29 00:10:05,251 INFO L796 eck$LassoCheckResult]: Loop: 772#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 758#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 749#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 750#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 772#L9-8 [2018-11-29 00:10:05,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:05,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2018-11-29 00:10:05,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:05,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:05,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:05,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:05,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-29 00:10:05,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:05,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:10:05,303 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:05,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2018-11-29 00:10:05,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:05,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:05,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:10:05,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:10:05,396 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-29 00:10:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:05,462 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-11-29 00:10:05,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:10:05,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2018-11-29 00:10:05,465 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:05,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2018-11-29 00:10:05,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-29 00:10:05,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-29 00:10:05,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2018-11-29 00:10:05,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:05,470 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-29 00:10:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2018-11-29 00:10:05,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2018-11-29 00:10:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-29 00:10:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-29 00:10:05,475 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-29 00:10:05,475 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-29 00:10:05,475 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:10:05,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-11-29 00:10:05,476 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:05,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:05,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:05,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:05,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:05,479 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 853#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 849#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 850#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 851#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 852#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 866#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 865#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 864#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 863#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 862#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 861#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 860#L23-3 assume !(main_~i~1 < 5); 848#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 836#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 837#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 847#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 842#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 838#L9-3 assume !(max_~i~0 < 5); 832#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 833#L12 main_#t~ret6 := max_#res;main_~ret~1 := 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;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 857#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 843#L10-3 [2018-11-29 00:10:05,479 INFO L796 eck$LassoCheckResult]: Loop: 843#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 834#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 835#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 858#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 843#L10-3 [2018-11-29 00:10:05,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:05,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2018-11-29 00:10:05,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:05,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:05,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:05,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:05,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-29 00:10:05,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:05,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:05,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:05,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-29 00:10:05,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:05,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-29 00:10:05,726 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:05,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:05,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2018-11-29 00:10:05,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:05,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:05,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:05,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:05,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:06,059 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-29 00:10:06,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:10:06,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:10:06,079 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-29 00:10:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:06,202 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-11-29 00:10:06,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-29 00:10:06,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2018-11-29 00:10:06,205 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:06,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2018-11-29 00:10:06,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-29 00:10:06,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-29 00:10:06,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2018-11-29 00:10:06,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:06,207 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2018-11-29 00:10:06,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2018-11-29 00:10:06,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2018-11-29 00:10:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-29 00:10:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-11-29 00:10:06,210 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-29 00:10:06,210 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-11-29 00:10:06,210 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:10:06,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2018-11-29 00:10:06,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:06,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:06,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:06,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:06,212 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:06,213 INFO L794 eck$LassoCheckResult]: Stem: 1020#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1018#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1014#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1015#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1016#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1017#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1019#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1035#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1034#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1033#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1031#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1030#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1029#L23-3 assume !(main_~i~1 < 5); 1013#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 999#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1000#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1032#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1006#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1001#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1002#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1011#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1012#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1027#L9-3 assume !(max_~i~0 < 5); 995#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 996#L12 main_#t~ret6 := max_#res;main_~ret~1 := 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;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1024#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1037#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1036#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1025#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1023#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10-3 [2018-11-29 00:10:06,213 INFO L796 eck$LassoCheckResult]: Loop: 1007#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 997#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 998#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1028#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10-3 [2018-11-29 00:10:06,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:06,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1525547091, now seen corresponding path program 1 times [2018-11-29 00:10:06,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:06,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:06,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:06,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:06,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-29 00:10:06,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:06,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:06,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:06,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-29 00:10:06,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:06,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-29 00:10:06,522 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:06,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:06,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2018-11-29 00:10:06,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:06,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:06,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:06,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:06,778 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-29 00:10:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-29 00:10:06,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-29 00:10:06,799 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-29 00:10:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:06,894 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-29 00:10:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-29 00:10:06,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2018-11-29 00:10:06,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:06,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. [2018-11-29 00:10:06,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-29 00:10:06,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-29 00:10:06,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2018-11-29 00:10:06,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:06,899 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-11-29 00:10:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2018-11-29 00:10:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-11-29 00:10:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-29 00:10:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2018-11-29 00:10:06,903 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2018-11-29 00:10:06,903 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2018-11-29 00:10:06,903 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-29 00:10:06,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2018-11-29 00:10:06,904 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:06,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:06,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:06,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:06,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:06,906 INFO L794 eck$LassoCheckResult]: Stem: 1230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1227#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1223#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1224#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1225#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1226#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1248#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1247#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1246#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1245#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1244#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1243#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1242#L23-3 assume !(main_~i~1 < 5); 1222#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1207#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1208#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1220#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1221#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1209#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1210#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1253#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1214#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1215#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1237#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1252#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1238#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1236#L9-3 assume !(max_~i~0 < 5); 1203#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1204#L12 main_#t~ret6 := max_#res;main_~ret~1 := 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;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1231#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1232#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1251#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1233#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1234#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1216#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1205#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1206#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1250#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1240#L10-3 [2018-11-29 00:10:06,906 INFO L796 eck$LassoCheckResult]: Loop: 1240#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1249#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1241#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1239#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1240#L10-3 [2018-11-29 00:10:06,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:06,906 INFO L82 PathProgramCache]: Analyzing trace with hash 452444531, now seen corresponding path program 2 times [2018-11-29 00:10:06,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:06,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:06,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:06,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:06,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-29 00:10:07,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:07,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:07,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-29 00:10:07,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-29 00:10:07,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:07,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-29 00:10:07,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:07,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-29 00:10:07,104 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:07,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:07,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2018-11-29 00:10:07,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:07,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:07,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:07,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:07,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:07,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-29 00:10:07,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-29 00:10:07,213 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-29 00:10:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:07,497 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-11-29 00:10:07,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:10:07,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2018-11-29 00:10:07,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:07,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 100 transitions. [2018-11-29 00:10:07,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-29 00:10:07,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-29 00:10:07,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 100 transitions. [2018-11-29 00:10:07,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:07,505 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 100 transitions. [2018-11-29 00:10:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 100 transitions. [2018-11-29 00:10:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2018-11-29 00:10:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-29 00:10:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2018-11-29 00:10:07,510 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2018-11-29 00:10:07,510 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2018-11-29 00:10:07,511 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-29 00:10:07,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2018-11-29 00:10:07,511 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:07,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:07,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:07,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:07,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:07,516 INFO L794 eck$LassoCheckResult]: Stem: 1481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1478#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1474#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1475#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1476#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1477#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1497#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1492#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1491#L23-3 assume !(main_~i~1 < 5); 1473#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1460#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1461#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1472#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1467#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1462#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1463#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1513#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1511#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1509#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1507#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1505#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1503#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1501#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1486#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1499#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1487#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1485#L9-3 assume !(max_~i~0 < 5); 1458#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1459#L12 main_#t~ret6 := max_#res;main_~ret~1 := 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;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1482#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1468#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1456#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1457#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1483#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1514#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1512#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1510#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1508#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1506#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1504#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1502#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1500#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1489#L10-3 [2018-11-29 00:10:07,516 INFO L796 eck$LassoCheckResult]: Loop: 1489#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1498#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1490#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1488#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1489#L10-3 [2018-11-29 00:10:07,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 3 times [2018-11-29 00:10:07,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:07,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:07,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:07,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-29 00:10:07,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-29 00:10:07,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-29 00:10:07,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-29 00:10:07,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-29 00:10:07,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-29 00:10:07,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-29 00:10:07,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-29 00:10:07,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-29 00:10:07,776 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:10:07,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:07,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2018-11-29 00:10:07,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:07,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:07,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:07,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:07,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:07,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-29 00:10:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-29 00:10:07,869 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-11-29 00:10:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:08,010 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2018-11-29 00:10:08,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:10:08,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2018-11-29 00:10:08,013 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:08,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2018-11-29 00:10:08,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-29 00:10:08,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-29 00:10:08,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2018-11-29 00:10:08,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:08,018 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2018-11-29 00:10:08,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2018-11-29 00:10:08,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2018-11-29 00:10:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-29 00:10:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-11-29 00:10:08,027 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-29 00:10:08,027 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-11-29 00:10:08,028 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-29 00:10:08,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2018-11-29 00:10:08,028 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-29 00:10:08,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:08,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:08,033 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:08,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:08,034 INFO L794 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1768#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1764#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1765#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1766#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1767#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1793#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1791#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1789#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1787#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1785#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1783#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1782#L23-3 assume !(main_~i~1 < 5); 1763#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1749#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1750#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1811#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1810#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1751#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1752#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1762#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1756#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1757#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1809#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1808#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1807#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1806#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1805#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1803#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1801#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1799#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1776#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1796#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1777#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1775#L9-3 assume !(max_~i~0 < 5); 1745#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1746#L12 main_#t~ret6 := max_#res;main_~ret~1 := 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;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1772#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1758#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1747#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1748#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1773#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1804#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1802#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1800#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1798#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1797#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1795#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1794#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1792#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1790#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1788#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1786#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1784#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1779#L10-3 [2018-11-29 00:10:08,034 INFO L796 eck$LassoCheckResult]: Loop: 1779#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1781#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1780#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1778#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1779#L10-3 [2018-11-29 00:10:08,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 4 times [2018-11-29 00:10:08,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:08,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:08,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:08,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:08,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:08,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:08,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2018-11-29 00:10:08,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:08,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:08,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:08,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:08,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:08,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash -746698386, now seen corresponding path program 1 times [2018-11-29 00:10:08,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:08,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:08,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:08,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:08,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-29 00:10:08,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:08,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-29 00:10:08,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-29 00:10:08,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-29 00:10:08,499 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. cyclomatic complexity: 20 Second operand 10 states. [2018-11-29 00:10:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:08,981 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2018-11-29 00:10:08,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-29 00:10:08,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 100 transitions. [2018-11-29 00:10:08,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:08,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2018-11-29 00:10:08,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-29 00:10:08,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-29 00:10:08,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2018-11-29 00:10:08,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:08,986 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-29 00:10:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2018-11-29 00:10:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-29 00:10:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-29 00:10:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-11-29 00:10:08,991 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-29 00:10:08,991 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-29 00:10:08,991 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-29 00:10:08,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2018-11-29 00:10:08,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:08,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:08,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:08,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:08,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:08,995 INFO L794 eck$LassoCheckResult]: Stem: 1941#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1940#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1936#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1937#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1938#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1939#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1961#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1958#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1955#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1952#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1950#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1948#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1947#L23-3 assume !(main_~i~1 < 5); 1935#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1927#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1928#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1934#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1929#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1930#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1984#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1983#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1981#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1979#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1977#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1975#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1973#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1971#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1969#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1967#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1965#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1963#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1960#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1957#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1954#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1946#L9-3 assume !(max_~i~0 < 5); 1923#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1924#L12 main_#t~ret6 := max_#res;main_~ret~1 := 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;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1944#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1931#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1925#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1926#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1945#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1982#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1980#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1978#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1976#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1974#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1972#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1970#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1968#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1966#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1964#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1962#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1959#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1956#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1953#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;havoc max_#t~ite3; 1951#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1949#L9-8 assume !(max_~i~0 < 5); 1942#L9-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1943#L12-1 main_#t~ret9 := max_#res;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 1932#L32-3 [2018-11-29 00:10:08,996 INFO L796 eck$LassoCheckResult]: Loop: 1932#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 1933#L32-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 1932#L32-3 [2018-11-29 00:10:08,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:08,996 INFO L82 PathProgramCache]: Analyzing trace with hash -260352212, now seen corresponding path program 1 times [2018-11-29 00:10:08,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:08,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:08,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:08,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:08,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:09,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:09,109 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2018-11-29 00:10:09,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:09,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:09,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:09,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:09,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:09,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:09,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1090370322, now seen corresponding path program 1 times [2018-11-29 00:10:09,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:09,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:09,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:09,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:09,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:12,395 WARN L180 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 369 DAG size of output: 284 [2018-11-29 00:10:13,497 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2018-11-29 00:10:13,500 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:13,500 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:13,501 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:13,501 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:13,501 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:13,501 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:13,501 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:13,501 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:13,501 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-29 00:10:13,501 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:13,502 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:13,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:13,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:13,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:13,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:13,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:13,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:13,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:13,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:13,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:13,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,001 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-11-29 00:10:14,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:14,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:14,758 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:14,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-11-29 00:10:14,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:14,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:14,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:14,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,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-11-29 00:10:14,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:14,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:14,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:14,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:14,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:14,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:14,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:14,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:14,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:14,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:14,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:14,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:14,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:14,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:14,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:14,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:14,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:14,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:14,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:14,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:14,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:14,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:14,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:14,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:14,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:14,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:14,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:14,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:14,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,815 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:14,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,818 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:14,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:14,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:14,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:14,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:14,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:14,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:14,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:14,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:14,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:14,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:14,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:14,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:14,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:14,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:14,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:14,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:14,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:14,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:14,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:14,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:14,865 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:14,877 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-29 00:10:14,877 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-29 00:10:14,877 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:14,878 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:14,878 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:14,878 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3) = -16*ULTIMATE.start_main_~i~2 + 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 Supporting invariants [] [2018-11-29 00:10:15,326 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2018-11-29 00:10:15,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-29 00:10:15,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:15,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:15,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:15,446 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-29 00:10:15,446 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-29 00:10:15,481 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 64 states and 76 transitions. Complement of second has 4 states. [2018-11-29 00:10:15,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:15,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2018-11-29 00:10:15,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 2 letters. [2018-11-29 00:10:15,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:15,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 62 letters. Loop has 2 letters. [2018-11-29 00:10:15,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:15,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 4 letters. [2018-11-29 00:10:15,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:15,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2018-11-29 00:10:15,485 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:15,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-11-29 00:10:15,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:10:15,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:10:15,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:10:15,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:15,486 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:15,486 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:15,486 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:15,486 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-29 00:10:15,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:10:15,486 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:15,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:10:15,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:10:15 BoogieIcfgContainer [2018-11-29 00:10:15,495 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:10:15,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:10:15,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:10:15,495 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:10:15,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:09:58" (3/4) ... [2018-11-29 00:10:15,500 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:10:15,500 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:10:15,501 INFO L168 Benchmark]: Toolchain (without parser) took 18125.79 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 154.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:15,502 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:15,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:15,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.92 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:15,504 INFO L168 Benchmark]: Boogie Preprocessor took 58.96 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:15,505 INFO L168 Benchmark]: RCFGBuilder took 715.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:15,506 INFO L168 Benchmark]: BuchiAutomizer took 16894.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.0 MB). Peak memory consumption was 170.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:15,507 INFO L168 Benchmark]: Witness Printer took 5.35 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-11-29 00:10:15,516 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.87 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 70.92 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.96 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 715.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16894.39 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.0 MB). Peak memory consumption was 170.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -16 * i + 7 * unknown-#length-unknown[x] and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.8s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 14.1s. Construction of modules took 1.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 85 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 346 SDtfs, 399 SDslu, 704 SDs, 0 SdLazy, 441 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax100 hnf99 lsp95 ukn48 mio100 lsp58 div100 bol100 ite100 ukn100 eq163 hnf87 smp98 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 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...