./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/max_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/max_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 c721a987debd4748cfed075333b7fa46c2d0f9ef ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:16:25,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:16:25,390 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:16:25,403 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:16:25,403 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:16:25,404 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:16:25,406 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:16:25,408 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:16:25,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:16:25,410 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:16:25,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:16:25,412 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:16:25,413 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:16:25,414 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:16:25,415 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:16:25,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:16:25,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:16:25,419 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:16:25,421 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:16:25,423 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:16:25,424 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:16:25,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:16:25,428 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:16:25,429 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:16:25,429 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:16:25,430 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:16:25,431 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:16:25,432 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:16:25,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:16:25,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:16:25,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:16:25,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:16:25,436 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:16:25,436 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:16:25,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:16:25,438 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:16:25,439 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:16:25,455 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:16:25,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:16:25,457 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:16:25,457 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:16:25,457 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:16:25,457 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:16:25,458 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:16:25,458 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:16:25,459 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:16:25,459 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:16:25,459 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:16:25,459 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:16:25,459 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:16:25,459 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:16:25,460 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:16:25,460 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:16:25,460 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:16:25,460 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:16:25,460 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:16:25,460 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:16:25,461 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:16:25,462 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:16:25,462 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:16:25,462 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:16:25,463 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:16:25,463 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:16:25,463 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:16:25,464 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:16:25,464 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:16:25,464 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:16:25,464 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:16:25,465 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:16:25,465 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 -> c721a987debd4748cfed075333b7fa46c2d0f9ef [2019-01-02 00:16:25,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:16:25,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:16:25,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:16:25,521 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:16:25,521 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:16:25,522 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/max_true-unreach-call_true-termination.i [2019-01-02 00:16:25,591 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d69e199/2164ee590b0d4dcf8901a53b695991f8/FLAG5d4e87093 [2019-01-02 00:16:26,080 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:16:26,080 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/max_true-unreach-call_true-termination.i [2019-01-02 00:16:26,088 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d69e199/2164ee590b0d4dcf8901a53b695991f8/FLAG5d4e87093 [2019-01-02 00:16:26,443 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19d69e199/2164ee590b0d4dcf8901a53b695991f8 [2019-01-02 00:16:26,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:16:26,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:16:26,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:16:26,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:16:26,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:16:26,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:16:26" (1/1) ... [2019-01-02 00:16:26,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5146fe20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26, skipping insertion in model container [2019-01-02 00:16:26,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:16:26" (1/1) ... [2019-01-02 00:16:26,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:16:26,489 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:16:26,737 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:16:26,754 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:16:26,790 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:16:26,813 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:16:26,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26 WrapperNode [2019-01-02 00:16:26,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:16:26,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:16:26,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:16:26,815 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:16:26,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26" (1/1) ... [2019-01-02 00:16:26,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26" (1/1) ... [2019-01-02 00:16:26,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:16:26,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:16:26,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:16:26,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:16:26,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26" (1/1) ... [2019-01-02 00:16:26,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26" (1/1) ... [2019-01-02 00:16:26,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26" (1/1) ... [2019-01-02 00:16:26,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26" (1/1) ... [2019-01-02 00:16:26,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26" (1/1) ... [2019-01-02 00:16:27,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26" (1/1) ... [2019-01-02 00:16:27,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26" (1/1) ... [2019-01-02 00:16:27,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:16:27,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:16:27,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:16:27,009 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:16:27,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:16:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:16:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:16:27,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:16:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:16:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:16:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:16:27,645 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:16:27,646 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2019-01-02 00:16:27,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:16:27 BoogieIcfgContainer [2019-01-02 00:16:27,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:16:27,647 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:16:27,647 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:16:27,651 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:16:27,652 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:16:27,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:16:26" (1/3) ... [2019-01-02 00:16:27,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6aaaf08b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:16:27, skipping insertion in model container [2019-01-02 00:16:27,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:16:27,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:26" (2/3) ... [2019-01-02 00:16:27,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6aaaf08b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:16:27, skipping insertion in model container [2019-01-02 00:16:27,654 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:16:27,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:16:27" (3/3) ... [2019-01-02 00:16:27,657 INFO L375 chiAutomizerObserver]: Analyzing ICFG max_true-unreach-call_true-termination.i [2019-01-02 00:16:27,717 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:16:27,718 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:16:27,719 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:16:27,719 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:16:27,720 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:16:27,720 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:16:27,720 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:16:27,720 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:16:27,721 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:16:27,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-01-02 00:16:27,782 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:27,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:27,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:27,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-02 00:16:27,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:27,793 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:16:27,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-01-02 00:16:27,797 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:27,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:27,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:27,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-02 00:16:27,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:27,809 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 9#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 8#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 6#L11-3true [2019-01-02 00:16:27,810 INFO L796 eck$LassoCheckResult]: Loop: 6#L11-3true assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 12#L12true assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 11#L12-2true max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 7#L11-2true max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6#L11-3true [2019-01-02 00:16:27,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:27,820 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-01-02 00:16:27,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:27,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:27,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1326822, now seen corresponding path program 1 times [2019-01-02 00:16:27,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:27,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:27,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:27,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1805089543, now seen corresponding path program 1 times [2019-01-02 00:16:27,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:27,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:27,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:27,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:28,469 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-02 00:16:28,541 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:16:28,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:16:28,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:16:28,543 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:16:28,543 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:16:28,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:16:28,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:16:28,544 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:16:28,544 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-02 00:16:28,544 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:16:28,544 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:16:28,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:28,971 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-01-02 00:16:29,209 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-02 00:16:29,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:29,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:29,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:29,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:29,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:29,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:29,920 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:16:29,926 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:16:29,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:29,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:29,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:29,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:29,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:29,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:29,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:29,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:29,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:29,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:29,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:29,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:29,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:29,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:29,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:29,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:29,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:29,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:29,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:29,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:29,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:29,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:29,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:29,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:29,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:29,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:29,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:29,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:29,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:29,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:29,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:29,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:29,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:29,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:29,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:29,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:29,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:29,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:29,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:29,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:29,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:29,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:29,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:29,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:29,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:29,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:29,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:29,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:29,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:29,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:29,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:29,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:29,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:29,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:29,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:29,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:29,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:29,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:29,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:29,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:29,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:29,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:29,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:29,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:29,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:29,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:29,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:29,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:29,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:29,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:29,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:29,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:29,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:29,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:29,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:29,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:29,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:29,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:29,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:29,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:29,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:29,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:29,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:29,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:29,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:29,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:29,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:29,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:29,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:29,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:29,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:29,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:29,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:29,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:29,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:29,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:29,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:29,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:30,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:30,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:30,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:30,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:30,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:30,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:30,005 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:30,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:30,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:30,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:30,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:30,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:30,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:30,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:30,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:30,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:30,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:30,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:30,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:30,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:30,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:30,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:30,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:30,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:30,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:30,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:30,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:30,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:30,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:30,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:30,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:30,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:30,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:30,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:30,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:30,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:30,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:30,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:30,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:30,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:30,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:30,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:30,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:30,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:30,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:30,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:30,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:30,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:30,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:30,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:30,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:30,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:30,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:30,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:30,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:30,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:30,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:30,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:30,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:30,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:30,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:30,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:30,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:30,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:30,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:30,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:30,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:30,221 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:16:30,305 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-02 00:16:30,306 INFO L444 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-02 00:16:30,309 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:16:30,312 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:16:30,314 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:16:30,315 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_max_~x.offset) = -4*ULTIMATE.start_max_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2019-01-02 00:16:30,400 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:16:30,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:16:30,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:30,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:30,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:30,627 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:16:30,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2019-01-02 00:16:30,757 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 3 states. Result 63 states and 87 transitions. Complement of second has 8 states. [2019-01-02 00:16:30,759 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 [2019-01-02 00:16:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:16:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2019-01-02 00:16:30,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-02 00:16:30,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:30,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-02 00:16:30,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:30,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 8 letters. [2019-01-02 00:16:30,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:30,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 87 transitions. [2019-01-02 00:16:30,773 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:30,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 32 transitions. [2019-01-02 00:16:30,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-02 00:16:30,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-02 00:16:30,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2019-01-02 00:16:30,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:30,781 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-02 00:16:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2019-01-02 00:16:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-02 00:16:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-02 00:16:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-01-02 00:16:30,816 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-02 00:16:30,816 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-01-02 00:16:30,816 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:16:30,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2019-01-02 00:16:30,818 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:30,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:30,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:30,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:16:30,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:30,821 INFO L794 eck$LassoCheckResult]: Stem: 178#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 175#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 174#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 169#L11-3 assume !(max_~i~0 < ~N~0); 163#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 164#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 181#L11-8 [2019-01-02 00:16:30,821 INFO L796 eck$LassoCheckResult]: Loop: 181#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 173#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 165#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 166#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 181#L11-8 [2019-01-02 00:16:30,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:30,821 INFO L82 PathProgramCache]: Analyzing trace with hash 889511083, now seen corresponding path program 1 times [2019-01-02 00:16:30,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:30,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:30,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:30,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:30,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:30,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:16:30,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:16:30,917 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:30,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:30,918 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 1 times [2019-01-02 00:16:30,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:30,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:30,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:30,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:30,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:31,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:16:31,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:16:31,078 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-02 00:16:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:31,166 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-01-02 00:16:31,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:16:31,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-01-02 00:16:31,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:31,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2019-01-02 00:16:31,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-02 00:16:31,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-02 00:16:31,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-01-02 00:16:31,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:31,172 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-02 00:16:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-01-02 00:16:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-01-02 00:16:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-02 00:16:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-01-02 00:16:31,177 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-02 00:16:31,177 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-01-02 00:16:31,177 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:16:31,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-01-02 00:16:31,178 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:31,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:31,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:31,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:31,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:31,181 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 231#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 229#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 224#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 225#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 232#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 227#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 226#L11-3 assume !(max_~i~0 < ~N~0); 218#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 219#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 236#L11-8 [2019-01-02 00:16:31,181 INFO L796 eck$LassoCheckResult]: Loop: 236#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 228#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 220#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 221#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 236#L11-8 [2019-01-02 00:16:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:31,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1805667996, now seen corresponding path program 1 times [2019-01-02 00:16:31,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:31,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:31,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:31,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:31,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:31,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:31,266 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 [2019-01-02 00:16:31,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:31,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:31,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:31,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-01-02 00:16:31,410 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:31,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:31,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 2 times [2019-01-02 00:16:31,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:31,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:31,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:31,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-02 00:16:31,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-02 00:16:31,563 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-01-02 00:16:31,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:31,738 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-01-02 00:16:31,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:16:31,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-01-02 00:16:31,742 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:31,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2019-01-02 00:16:31,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-02 00:16:31,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-02 00:16:31,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2019-01-02 00:16:31,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:31,745 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-02 00:16:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2019-01-02 00:16:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-01-02 00:16:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-02 00:16:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-01-02 00:16:31,749 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-02 00:16:31,749 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-02 00:16:31,750 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:16:31,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-01-02 00:16:31,751 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:31,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:31,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:31,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:31,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:31,753 INFO L794 eck$LassoCheckResult]: Stem: 324#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 320#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 319#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 313#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 314#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 329#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 317#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 315#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 316#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 322#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 323#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 328#L11-3 assume !(max_~i~0 < ~N~0); 307#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 308#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 327#L11-8 [2019-01-02 00:16:31,754 INFO L796 eck$LassoCheckResult]: Loop: 327#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 318#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 309#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 310#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 327#L11-8 [2019-01-02 00:16:31,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:31,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1818198429, now seen corresponding path program 2 times [2019-01-02 00:16:31,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:31,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:31,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:31,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:31,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:31,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 3 times [2019-01-02 00:16:31,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:31,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:31,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:31,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:31,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:31,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:31,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1198284866, now seen corresponding path program 1 times [2019-01-02 00:16:31,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:31,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:31,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:31,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:31,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:32,296 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-02 00:16:32,536 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-02 00:16:32,661 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-01-02 00:16:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:33,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:33,096 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 [2019-01-02 00:16:33,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:33,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:33,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2019-01-02 00:16:33,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-02 00:16:33,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2019-01-02 00:16:33,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-02 00:16:33,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-02 00:16:33,447 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-02 00:16:33,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:16:33,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:16:33,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:16:33,507 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2019-01-02 00:16:33,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-02 00:16:33,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-02 00:16:33,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-02 00:16:33,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:16:33,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:16:33,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-01-02 00:16:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:33,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:33,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-01-02 00:16:33,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-02 00:16:33,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-01-02 00:16:33,757 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand 17 states. [2019-01-02 00:16:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:36,028 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2019-01-02 00:16:36,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-02 00:16:36,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 134 transitions. [2019-01-02 00:16:36,032 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 22 [2019-01-02 00:16:36,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 134 transitions. [2019-01-02 00:16:36,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2019-01-02 00:16:36,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2019-01-02 00:16:36,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 134 transitions. [2019-01-02 00:16:36,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:36,037 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 134 transitions. [2019-01-02 00:16:36,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 134 transitions. [2019-01-02 00:16:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 39. [2019-01-02 00:16:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-02 00:16:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-01-02 00:16:36,045 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-02 00:16:36,045 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-02 00:16:36,045 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:16:36,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2019-01-02 00:16:36,047 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:36,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:36,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:36,048 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:36,048 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:36,049 INFO L794 eck$LassoCheckResult]: Stem: 559#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 556#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 554#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 547#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 548#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 569#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 570#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 549#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 550#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 557#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 558#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 565#L11-3 assume !(max_~i~0 < ~N~0); 566#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 564#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 562#L11-8 [2019-01-02 00:16:36,050 INFO L796 eck$LassoCheckResult]: Loop: 562#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 563#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 543#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 544#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 562#L11-8 [2019-01-02 00:16:36,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:36,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2083741857, now seen corresponding path program 1 times [2019-01-02 00:16:36,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:36,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:36,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:36,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:36,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:36,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:36,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 4 times [2019-01-02 00:16:36,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:36,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:36,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:36,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:36,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:36,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2085565180, now seen corresponding path program 1 times [2019-01-02 00:16:36,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:36,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:36,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:36,280 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:16:36,720 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2019-01-02 00:16:37,005 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-02 00:16:37,012 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:16:37,012 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:16:37,012 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:16:37,012 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:16:37,013 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:16:37,013 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:16:37,013 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:16:37,013 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:16:37,013 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration5_Lasso [2019-01-02 00:16:37,013 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:16:37,013 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:16:37,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,590 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-01-02 00:16:37,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:37,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:38,040 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-02 00:16:38,164 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:16:38,164 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:16:38,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:38,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:38,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:38,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:38,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:38,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:38,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:38,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:38,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:38,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:38,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:38,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:38,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:38,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:38,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:38,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:38,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:38,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:38,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:38,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:38,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:38,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:38,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:38,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:38,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:38,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:38,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:38,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:38,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:38,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:38,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:38,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:38,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,227 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:16:38,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,228 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:16:38,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:38,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:38,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:38,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,243 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:16:38,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,245 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:16:38,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:38,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:38,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:38,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:38,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:38,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:38,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:38,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:38,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:38,295 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:16:38,344 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:16:38,344 INFO L444 ModelExtractionUtils]: 19 out of 25 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:16:38,345 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:16:38,346 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:16:38,346 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:16:38,346 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_max_~x.base)_2, ULTIMATE.start_max_~i~0, ULTIMATE.start_max_~x.offset) = 1*v_rep(select #length ULTIMATE.start_max_~x.base)_2 - 4*ULTIMATE.start_max_~i~0 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2019-01-02 00:16:38,450 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:16:38,464 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:16:38,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:38,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:38,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:38,950 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:16:38,950 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-01-02 00:16:39,070 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 49 states and 67 transitions. Complement of second has 7 states. [2019-01-02 00:16:39,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:16:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:16:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-02 00:16:39,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-02 00:16:39,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:39,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 18 letters. Loop has 4 letters. [2019-01-02 00:16:39,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:39,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 14 letters. Loop has 8 letters. [2019-01-02 00:16:39,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:39,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 67 transitions. [2019-01-02 00:16:39,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:16:39,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 40 states and 52 transitions. [2019-01-02 00:16:39,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-02 00:16:39,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-02 00:16:39,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2019-01-02 00:16:39,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:39,082 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-01-02 00:16:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2019-01-02 00:16:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-02 00:16:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-02 00:16:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2019-01-02 00:16:39,087 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-01-02 00:16:39,088 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-01-02 00:16:39,088 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:16:39,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2019-01-02 00:16:39,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:16:39,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:39,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:39,091 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:39,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:16:39,092 INFO L794 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 737#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 735#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 729#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 730#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 758#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 757#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 756#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 751#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 754#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 752#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 750#L11-3 assume !(max_~i~0 < ~N~0); 749#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 748#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 747#L11-8 assume !(max_~i~0 < ~N~0); 742#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 743#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 727#L32-3 [2019-01-02 00:16:39,092 INFO L796 eck$LassoCheckResult]: Loop: 727#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 728#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 727#L32-3 [2019-01-02 00:16:39,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:39,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1591298555, now seen corresponding path program 1 times [2019-01-02 00:16:39,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:39,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:39,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-02 00:16:39,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:16:39,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:16:39,275 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:39,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:39,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2019-01-02 00:16:39,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:39,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:39,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:39,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:39,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:39,633 WARN L181 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-02 00:16:39,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:16:39,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:16:39,656 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 17 Second operand 4 states. [2019-01-02 00:16:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:39,711 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2019-01-02 00:16:39,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:16:39,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2019-01-02 00:16:39,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:16:39,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 59 transitions. [2019-01-02 00:16:39,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-02 00:16:39,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-02 00:16:39,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 59 transitions. [2019-01-02 00:16:39,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:39,716 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2019-01-02 00:16:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 59 transitions. [2019-01-02 00:16:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2019-01-02 00:16:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-02 00:16:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-01-02 00:16:39,721 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-02 00:16:39,721 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-02 00:16:39,721 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:16:39,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 50 transitions. [2019-01-02 00:16:39,723 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:16:39,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:39,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:39,725 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:39,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:16:39,725 INFO L794 eck$LassoCheckResult]: Stem: 834#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 831#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 829#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 823#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 824#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 832#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 833#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 852#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 847#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 850#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 848#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 846#L11-3 assume !(max_~i~0 < ~N~0); 817#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 818#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 838#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 839#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 819#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 820#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 840#L11-8 assume !(max_~i~0 < ~N~0); 836#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 837#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 821#L32-3 [2019-01-02 00:16:39,726 INFO L796 eck$LassoCheckResult]: Loop: 821#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 822#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 821#L32-3 [2019-01-02 00:16:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:39,726 INFO L82 PathProgramCache]: Analyzing trace with hash -18080898, now seen corresponding path program 1 times [2019-01-02 00:16:39,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:39,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:39,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:39,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:39,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-02 00:16:39,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:39,991 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 [2019-01-02 00:16:40,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:40,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-02 00:16:40,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:40,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-02 00:16:40,466 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2019-01-02 00:16:40,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:40,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:40,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:40,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:40,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:16:40,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:16:40,562 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. cyclomatic complexity: 15 Second operand 7 states. [2019-01-02 00:16:40,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:40,680 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2019-01-02 00:16:40,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-02 00:16:40,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 75 transitions. [2019-01-02 00:16:40,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:16:40,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 75 transitions. [2019-01-02 00:16:40,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-02 00:16:40,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-02 00:16:40,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 75 transitions. [2019-01-02 00:16:40,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:40,685 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-01-02 00:16:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 75 transitions. [2019-01-02 00:16:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2019-01-02 00:16:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-02 00:16:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2019-01-02 00:16:40,693 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-01-02 00:16:40,693 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2019-01-02 00:16:40,693 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-02 00:16:40,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 55 transitions. [2019-01-02 00:16:40,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:16:40,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:40,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:40,696 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:40,696 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:16:40,696 INFO L794 eck$LassoCheckResult]: Stem: 1006#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1003#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1002#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 995#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 996#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1028#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1027#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 997#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 998#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1007#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1023#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1020#L11-3 assume !(max_~i~0 < ~N~0); 1019#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1018#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1017#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1016#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1015#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1014#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1012#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1001#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 991#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 992#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1013#L11-8 assume !(max_~i~0 < ~N~0); 1008#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1009#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 993#L32-3 [2019-01-02 00:16:40,697 INFO L796 eck$LassoCheckResult]: Loop: 993#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 994#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 993#L32-3 [2019-01-02 00:16:40,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2011161481, now seen corresponding path program 2 times [2019-01-02 00:16:40,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:40,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:40,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:40,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:40,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:41,230 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2019-01-02 00:16:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:41,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:41,562 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 [2019-01-02 00:16:41,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:16:41,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:16:41,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:16:41,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:41,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2019-01-02 00:16:41,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-01-02 00:16:41,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2019-01-02 00:16:41,707 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-02 00:16:41,716 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:16:41,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:16:41,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:16:41,737 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:17 [2019-01-02 00:16:41,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-02 00:16:41,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-02 00:16:41,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-02 00:16:41,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:16:41,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-02 00:16:41,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-01-02 00:16:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-02 00:16:41,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:41,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2019-01-02 00:16:41,932 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:41,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2019-01-02 00:16:41,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:41,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:41,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:41,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:41,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:42,297 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-02 00:16:42,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-02 00:16:42,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-01-02 00:16:42,391 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. cyclomatic complexity: 16 Second operand 19 states. [2019-01-02 00:16:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:44,004 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2019-01-02 00:16:44,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-02 00:16:44,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 107 transitions. [2019-01-02 00:16:44,006 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:44,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 87 states and 107 transitions. [2019-01-02 00:16:44,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-01-02 00:16:44,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-01-02 00:16:44,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 107 transitions. [2019-01-02 00:16:44,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:44,008 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 107 transitions. [2019-01-02 00:16:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 107 transitions. [2019-01-02 00:16:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2019-01-02 00:16:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-02 00:16:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2019-01-02 00:16:44,018 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2019-01-02 00:16:44,018 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2019-01-02 00:16:44,018 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-02 00:16:44,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 70 transitions. [2019-01-02 00:16:44,018 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-02 00:16:44,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:44,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:44,021 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:44,022 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:16:44,022 INFO L794 eck$LassoCheckResult]: Stem: 1257#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1254#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1252#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1246#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1247#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1285#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1283#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1281#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1276#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1278#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1277#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1275#L11-3 assume !(max_~i~0 < ~N~0); 1274#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1273#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1272#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1271#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1242#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1243#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1269#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1266#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1268#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1267#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1265#L11-8 assume !(max_~i~0 < ~N~0); 1259#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1260#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1244#L32-3 [2019-01-02 00:16:44,022 INFO L796 eck$LassoCheckResult]: Loop: 1244#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1245#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1244#L32-3 [2019-01-02 00:16:44,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1618134471, now seen corresponding path program 1 times [2019-01-02 00:16:44,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:44,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:44,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:44,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:44,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:44,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2019-01-02 00:16:44,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:44,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:44,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:44,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:44,087 INFO L82 PathProgramCache]: Analyzing trace with hash -249063589, now seen corresponding path program 1 times [2019-01-02 00:16:44,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:44,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:44,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:44,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:44,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:44,484 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-02 00:16:44,662 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-02 00:16:45,815 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 191 DAG size of output: 161 [2019-01-02 00:16:46,980 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-01-02 00:16:46,983 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:16:46,983 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:16:46,983 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:16:46,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:16:46,984 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:16:46,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:16:46,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:16:46,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:16:46,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-02 00:16:46,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:16:46,985 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:16:46,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,191 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-01-02 00:16:47,843 WARN L181 SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-01-02 00:16:47,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:47,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:48,470 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-01-02 00:16:49,297 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-01-02 00:16:49,324 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:16:49,325 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:16:49,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:49,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:49,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:49,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:49,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:49,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:49,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:49,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:49,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:49,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:49,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:49,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:49,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:49,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:49,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:49,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:49,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:49,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:49,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:49,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:49,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:49,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:49,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:49,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:49,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:49,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:49,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:49,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:49,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:49,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:49,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:49,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:49,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:49,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:49,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:49,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:49,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:49,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:49,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:49,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:49,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:49,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:49,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:49,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:49,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:49,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:49,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:49,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,384 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:16:49,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,386 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:16:49,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:49,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:49,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:49,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:49,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:49,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:49,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:49,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:49,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:49,433 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:16:49,442 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:16:49,442 INFO L444 ModelExtractionUtils]: 21 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:16:49,444 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:16:49,445 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:16:49,445 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:16:49,445 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2019-01-02 00:16:49,592 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:16:49,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:49,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:49,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:49,654 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:16:49,654 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-01-02 00:16:49,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 70 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 63 states and 82 transitions. Complement of second has 6 states. [2019-01-02 00:16:49,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:16:49,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:16:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2019-01-02 00:16:49,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 2 letters. [2019-01-02 00:16:49,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:49,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 27 letters. Loop has 2 letters. [2019-01-02 00:16:49,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:49,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 4 letters. [2019-01-02 00:16:49,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:49,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. [2019-01-02 00:16:49,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:16:49,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 57 states and 72 transitions. [2019-01-02 00:16:49,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-02 00:16:49,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-02 00:16:49,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 72 transitions. [2019-01-02 00:16:49,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:49,682 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-01-02 00:16:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 72 transitions. [2019-01-02 00:16:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-02 00:16:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-02 00:16:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2019-01-02 00:16:49,685 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-01-02 00:16:49,685 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-01-02 00:16:49,685 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-02 00:16:49,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 72 transitions. [2019-01-02 00:16:49,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:16:49,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:49,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:49,687 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:49,687 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:49,687 INFO L794 eck$LassoCheckResult]: Stem: 1517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1514#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1513#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1506#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1507#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1518#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1551#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1550#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1542#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1546#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1544#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1541#L11-3 assume !(max_~i~0 < ~N~0); 1539#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1536#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1534#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1530#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1512#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1529#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1528#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1525#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1527#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1526#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1524#L11-8 assume !(max_~i~0 < ~N~0); 1519#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1520#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1503#L32-3 assume !(main_~i~1 < ~N~0 - 1); 1497#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1498#L11-13 [2019-01-02 00:16:49,687 INFO L796 eck$LassoCheckResult]: Loop: 1498#L11-13 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1495#L12-6 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1496#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1515#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1498#L11-13 [2019-01-02 00:16:49,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:49,688 INFO L82 PathProgramCache]: Analyzing trace with hash -249063647, now seen corresponding path program 1 times [2019-01-02 00:16:49,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:49,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:49,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:49,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:49,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-02 00:16:49,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:16:49,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:16:49,871 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:49,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:49,872 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 1 times [2019-01-02 00:16:49,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:49,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:49,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:50,145 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:16:50,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:16:50,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:16:50,174 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. cyclomatic complexity: 21 Second operand 4 states. [2019-01-02 00:16:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:50,200 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-01-02 00:16:50,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:16:50,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 72 transitions. [2019-01-02 00:16:50,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:16:50,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 72 transitions. [2019-01-02 00:16:50,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-02 00:16:50,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-02 00:16:50,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 72 transitions. [2019-01-02 00:16:50,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:50,206 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-01-02 00:16:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 72 transitions. [2019-01-02 00:16:50,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-01-02 00:16:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-02 00:16:50,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2019-01-02 00:16:50,211 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2019-01-02 00:16:50,211 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2019-01-02 00:16:50,211 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-02 00:16:50,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 71 transitions. [2019-01-02 00:16:50,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-02 00:16:50,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:50,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:50,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:50,215 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:50,215 INFO L794 eck$LassoCheckResult]: Stem: 1639#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1636#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1635#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1628#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1629#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1671#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1669#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1667#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1659#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1664#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1661#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1658#L11-3 assume !(max_~i~0 < ~N~0); 1656#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1654#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1653#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1652#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1634#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1651#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1650#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1647#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1649#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1648#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1646#L11-8 assume !(max_~i~0 < ~N~0); 1640#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1641#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1625#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1626#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1627#L32-3 assume !(main_~i~1 < ~N~0 - 1); 1619#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1620#L11-13 [2019-01-02 00:16:50,215 INFO L796 eck$LassoCheckResult]: Loop: 1620#L11-13 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1617#L12-6 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1618#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1637#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1620#L11-13 [2019-01-02 00:16:50,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:50,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1168061379, now seen corresponding path program 1 times [2019-01-02 00:16:50,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:50,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:50,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:50,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:50,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 2 times [2019-01-02 00:16:50,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:50,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:50,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:50,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:50,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:50,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash 934015144, now seen corresponding path program 1 times [2019-01-02 00:16:50,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:50,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:50,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:50,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:50,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:50,613 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:16:50,812 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:16:52,270 WARN L181 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 233 DAG size of output: 193 [2019-01-02 00:16:53,220 WARN L181 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-01-02 00:16:53,222 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:16:53,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:16:53,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:16:53,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:16:53,223 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:16:53,223 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:16:53,223 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:16:53,223 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:16:53,223 INFO L131 ssoRankerPreferences]: Filename of dumped script: max_true-unreach-call_true-termination.i_Iteration11_Lasso [2019-01-02 00:16:53,224 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:16:53,224 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:16:53,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,341 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-01-02 00:16:53,923 WARN L181 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-01-02 00:16:53,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:53,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:54,221 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-01-02 00:16:54,606 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-01-02 00:16:54,686 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:16:54,686 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:16:54,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:54,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:54,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:54,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:54,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:54,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:54,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:54,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:54,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:54,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:54,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:54,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:54,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:54,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:54,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:54,728 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:16:54,736 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:16:54,739 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:16:54,739 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:16:54,740 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:16:54,740 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:16:54,740 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_max_~x.base)_4, ULTIMATE.start_max_~i~0, ULTIMATE.start_max_~x.offset) = 1*v_rep(select #length ULTIMATE.start_max_~x.base)_4 - 4*ULTIMATE.start_max_~i~0 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2019-01-02 00:16:54,846 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-01-02 00:16:54,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:16:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:54,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:54,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:54,917 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:16:54,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 71 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-01-02 00:16:54,936 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 71 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 61 states and 77 transitions. Complement of second has 4 states. [2019-01-02 00:16:54,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:16:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:16:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-01-02 00:16:54,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 4 letters. [2019-01-02 00:16:54,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:54,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 33 letters. Loop has 4 letters. [2019-01-02 00:16:54,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:54,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 8 letters. [2019-01-02 00:16:54,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:54,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 77 transitions. [2019-01-02 00:16:54,940 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:16:54,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 0 states and 0 transitions. [2019-01-02 00:16:54,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:16:54,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:16:54,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:16:54,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:54,940 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:16:54,940 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:16:54,940 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:16:54,940 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-02 00:16:54,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:16:54,941 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:16:54,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:16:54,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:16:54 BoogieIcfgContainer [2019-01-02 00:16:54,948 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:16:54,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:16:54,948 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:16:54,949 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:16:54,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:16:27" (3/4) ... [2019-01-02 00:16:54,953 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:16:54,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:16:54,954 INFO L168 Benchmark]: Toolchain (without parser) took 28502.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 360.2 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -219.9 MB). Peak memory consumption was 140.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:54,955 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:16:54,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.84 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:54,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.94 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:16:54,957 INFO L168 Benchmark]: Boogie Preprocessor took 127.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:54,957 INFO L168 Benchmark]: RCFGBuilder took 637.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:54,958 INFO L168 Benchmark]: BuchiAutomizer took 27301.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -61.0 MB). Peak memory consumption was 160.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:54,959 INFO L168 Benchmark]: Witness Printer took 4.75 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:16:54,968 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.15 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 360.84 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 65.94 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 637.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 27301.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -61.0 MB). Peak memory consumption was 160.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.75 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] + -1 * x and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i + -1 * x and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[x] + -4 * i + -1 * x and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.2s and 12 iterations. TraceHistogramMax:2. Analysis of lassos took 21.4s. Construction of modules took 2.4s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 128 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 57 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 231 SDtfs, 435 SDslu, 284 SDs, 0 SdLazy, 1740 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax100 hnf99 lsp89 ukn68 mio100 lsp48 div122 bol100 ite100 ukn100 eq160 hnf80 smp79 dnf263 smp59 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 4 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...