./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/max05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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/max05_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d02fdead04c3e6f93d11e2edd6641f56f1584022 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:16:02,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:16:02,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:16:02,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:16:02,473 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:16:02,474 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:16:02,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:16:02,477 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:16:02,479 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:16:02,480 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:16:02,481 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:16:02,481 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:16:02,482 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:16:02,483 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:16:02,484 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:16:02,485 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:16:02,486 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:16:02,488 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:16:02,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:16:02,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:16:02,493 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:16:02,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:16:02,497 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:16:02,497 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:16:02,497 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:16:02,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:16:02,499 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:16:02,500 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:16:02,501 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:16:02,502 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:16:02,502 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:16:02,503 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:16:02,503 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:16:02,504 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:16:02,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:16:02,505 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:16:02,506 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:02,523 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:16:02,524 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:16:02,525 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:16:02,525 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:16:02,525 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:16:02,526 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:16:02,526 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:16:02,526 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:16:02,526 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:16:02,526 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:16:02,527 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:16:02,527 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:16:02,527 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:16:02,527 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:16:02,527 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:16:02,528 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:16:02,528 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:16:02,528 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:16:02,528 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:16:02,528 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:16:02,529 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:16:02,529 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:16:02,529 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:16:02,529 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:16:02,529 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:16:02,529 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:16:02,530 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:16:02,530 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:16:02,530 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:16:02,530 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:16:02,530 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:16:02,531 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:16:02,531 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d02fdead04c3e6f93d11e2edd6641f56f1584022 [2019-01-02 00:16:02,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:16:02,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:16:02,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:16:02,596 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:16:02,596 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:16:02,597 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2019-01-02 00:16:02,669 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/933e0f01c/19621c29b42d4b589ce3fb0661932eb6/FLAGcac7d36b5 [2019-01-02 00:16:03,121 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:16:03,121 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/max05_true-unreach-call_true-termination.i [2019-01-02 00:16:03,127 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/933e0f01c/19621c29b42d4b589ce3fb0661932eb6/FLAGcac7d36b5 [2019-01-02 00:16:03,492 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/933e0f01c/19621c29b42d4b589ce3fb0661932eb6 [2019-01-02 00:16:03,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:16:03,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:16:03,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:16:03,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:16:03,508 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:16:03,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:16:03" (1/1) ... [2019-01-02 00:16:03,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d9fedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:03, skipping insertion in model container [2019-01-02 00:16:03,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:16:03" (1/1) ... [2019-01-02 00:16:03,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:16:03,548 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:16:03,810 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:16:03,831 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:16:03,871 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:16:03,891 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:16:03,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:03 WrapperNode [2019-01-02 00:16:03,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:16:03,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:16:03,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:16:03,893 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:16:03,906 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:03" (1/1) ... [2019-01-02 00:16:03,917 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:03" (1/1) ... [2019-01-02 00:16:03,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:16:03,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:16:03,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:16:03,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:16:03,958 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:03" (1/1) ... [2019-01-02 00:16:03,959 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:03" (1/1) ... [2019-01-02 00:16:03,962 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:03" (1/1) ... [2019-01-02 00:16:03,962 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:03" (1/1) ... [2019-01-02 00:16:03,970 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:03" (1/1) ... [2019-01-02 00:16:04,049 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:03" (1/1) ... [2019-01-02 00:16:04,051 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:03" (1/1) ... [2019-01-02 00:16:04,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:16:04,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:16:04,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:16:04,061 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:16:04,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:03" (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:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:16:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:16:04,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:16:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:16:04,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:16:04,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:16:04,712 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:16:04,714 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-02 00:16:04,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:16:04 BoogieIcfgContainer [2019-01-02 00:16:04,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:16:04,716 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:16:04,716 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:16:04,722 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:16:04,723 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:16:04,723 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:16:03" (1/3) ... [2019-01-02 00:16:04,724 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@368a78fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:16:04, skipping insertion in model container [2019-01-02 00:16:04,724 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:16:04,725 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:16:03" (2/3) ... [2019-01-02 00:16:04,725 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@368a78fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:16:04, skipping insertion in model container [2019-01-02 00:16:04,725 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:16:04,725 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:16:04" (3/3) ... [2019-01-02 00:16:04,728 INFO L375 chiAutomizerObserver]: Analyzing ICFG max05_true-unreach-call_true-termination.i [2019-01-02 00:16:04,802 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:16:04,802 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:16:04,803 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:16:04,803 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:16:04,803 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:16:04,803 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:16:04,804 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:16:04,804 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:16:04,804 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:16:04,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-01-02 00:16:04,843 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-01-02 00:16:04,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:04,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:04,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:16:04,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:16:04,852 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:16:04,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-01-02 00:16:04,855 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-01-02 00:16:04,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:04,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:04,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-02 00:16:04,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:16:04,865 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 30#L23-3true [2019-01-02 00:16:04,865 INFO L796 eck$LassoCheckResult]: Loop: 30#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 10#L23-2true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 30#L23-3true [2019-01-02 00:16:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-02 00:16:04,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:04,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:04,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:04,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:04,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:05,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-02 00:16:05,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:05,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:05,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:05,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:05,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:05,028 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-02 00:16:05,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:05,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:05,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:05,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:05,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:05,411 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-02 00:16:05,517 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:16:05,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:16:05,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:16:05,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:16:05,519 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:16:05,519 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:16:05,519 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:16:05,519 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:16:05,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-02 00:16:05,521 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:16:05,521 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:16:05,549 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:05,580 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:05,669 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:05,676 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:05,686 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:05,689 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:05,695 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:05,700 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:05,705 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:05,709 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:05,712 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:05,718 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:05,721 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:05,732 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:05,735 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:05,739 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:05,742 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:05,747 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:06,232 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-02 00:16:06,366 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-02 00:16:06,449 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:16:06,454 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:16:06,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:06,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:06,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:06,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:06,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:06,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:06,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:06,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:06,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:06,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:06,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:06,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:06,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:06,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:06,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:06,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:06,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:06,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:06,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:06,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:06,473 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:16:06,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:06,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:06,477 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:16:06,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:06,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:06,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:06,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:06,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:06,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:06,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:06,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:06,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:06,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:06,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:06,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:06,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:06,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:06,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:06,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:06,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:06,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:06,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:06,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:06,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:06,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:06,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:06,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:06,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:06,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:06,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:06,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:06,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:06,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:06,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:06,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:06,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:06,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:06,581 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:16:06,603 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:16:06,604 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:16:06,607 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:16:06,609 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:16:06,609 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:16:06,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2019-01-02 00:16:06,635 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-02 00:16:06,657 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:16:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:06,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:06,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:06,800 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:06,815 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:06,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2019-01-02 00:16:07,031 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 84 states and 119 transitions. Complement of second has 8 states. [2019-01-02 00:16:07,033 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:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:16:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-01-02 00:16:07,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-02 00:16:07,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:07,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-02 00:16:07,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:07,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-02 00:16:07,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:07,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2019-01-02 00:16:07,046 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:07,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2019-01-02 00:16:07,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-02 00:16:07,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-02 00:16:07,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2019-01-02 00:16:07,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:07,053 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-02 00:16:07,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2019-01-02 00:16:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-02 00:16:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-02 00:16:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-02 00:16:07,081 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-02 00:16:07,081 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-02 00:16:07,081 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:16:07,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-01-02 00:16:07,082 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:07,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:07,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:07,083 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-02 00:16:07,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:07,083 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 175#L23-3 assume !(main_~i~1 < 5); 174#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 163#L9-3 [2019-01-02 00:16:07,084 INFO L796 eck$LassoCheckResult]: Loop: 163#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 164#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 173#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 168#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 163#L9-3 [2019-01-02 00:16:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:07,084 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-01-02 00:16:07,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:07,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:07,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:07,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:07,146 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:07,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:16:07,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:16:07,150 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:07,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:07,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2019-01-02 00:16:07,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:07,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:07,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:07,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:07,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:16:07,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:16:07,278 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-02 00:16:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:07,310 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-01-02 00:16:07,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:16:07,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-01-02 00:16:07,313 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:07,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2019-01-02 00:16:07,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-02 00:16:07,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-02 00:16:07,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-01-02 00:16:07,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:07,315 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-02 00:16:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-01-02 00:16:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-02 00:16:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-02 00:16:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-01-02 00:16:07,318 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-02 00:16:07,318 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-02 00:16:07,318 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:16:07,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2019-01-02 00:16:07,319 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:07,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:07,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:07,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:16:07,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:07,320 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 235#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 232#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 233#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 234#L23-3 assume !(main_~i~1 < 5); 231#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 220#L9-3 [2019-01-02 00:16:07,321 INFO L796 eck$LassoCheckResult]: Loop: 220#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 221#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 230#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 225#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 220#L9-3 [2019-01-02 00:16:07,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:07,321 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-01-02 00:16:07,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:07,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:07,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:07,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:07,382 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:07,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:07,382 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:07,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:07,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:07,458 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:07,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:07,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-02 00:16:07,478 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:07,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:07,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2019-01-02 00:16:07,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:07,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:07,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:07,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:07,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:16:07,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:16:07,602 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-01-02 00:16:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:07,635 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-01-02 00:16:07,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:16:07,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-02 00:16:07,637 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:07,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2019-01-02 00:16:07,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-02 00:16:07,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-02 00:16:07,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-01-02 00:16:07,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:07,639 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-02 00:16:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-01-02 00:16:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-01-02 00:16:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-02 00:16:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-01-02 00:16:07,642 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-02 00:16:07,642 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-02 00:16:07,642 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:16:07,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-01-02 00:16:07,643 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:07,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:07,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:07,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-01-02 00:16:07,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:07,645 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 312#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 308#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 309#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 310#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 311#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 318#L23-3 assume !(main_~i~1 < 5); 307#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 296#L9-3 [2019-01-02 00:16:07,645 INFO L796 eck$LassoCheckResult]: Loop: 296#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 297#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 306#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 301#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 296#L9-3 [2019-01-02 00:16:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:07,645 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-01-02 00:16:07,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:07,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:07,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:07,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:07,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:07,760 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:07,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:16:07,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:16:07,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:16:07,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:07,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:07,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-02 00:16:07,896 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:07,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2019-01-02 00:16:07,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:07,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:07,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:07,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:08,046 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:16:08,201 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:16:08,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-02 00:16:08,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-02 00:16:08,202 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-01-02 00:16:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:08,325 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-01-02 00:16:08,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:16:08,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2019-01-02 00:16:08,329 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:08,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2019-01-02 00:16:08,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-02 00:16:08,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-02 00:16:08,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-01-02 00:16:08,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:08,331 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-02 00:16:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-01-02 00:16:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-02 00:16:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-02 00:16:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-01-02 00:16:08,334 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-01-02 00:16:08,334 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-01-02 00:16:08,335 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:16:08,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-01-02 00:16:08,335 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:08,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:08,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:08,336 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-01-02 00:16:08,336 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:08,337 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 399#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 395#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 396#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 397#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 398#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 400#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 407#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 406#L23-3 assume !(main_~i~1 < 5); 394#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 383#L9-3 [2019-01-02 00:16:08,337 INFO L796 eck$LassoCheckResult]: Loop: 383#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 384#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 393#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 388#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 383#L9-3 [2019-01-02 00:16:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-01-02 00:16:08,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:08,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:08,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:08,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:08,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:08,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:08,409 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:08,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-02 00:16:08,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-02 00:16:08,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:16:08,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:08,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:08,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-02 00:16:08,522 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:08,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:08,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2019-01-02 00:16:08,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:08,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:08,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:08,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:08,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:08,746 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:16:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:16:08,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:16:08,765 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-02 00:16:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:08,808 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-01-02 00:16:08,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-02 00:16:08,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-01-02 00:16:08,815 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:08,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2019-01-02 00:16:08,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-02 00:16:08,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-02 00:16:08,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2019-01-02 00:16:08,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:08,817 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-01-02 00:16:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2019-01-02 00:16:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-02 00:16:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-02 00:16:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-01-02 00:16:08,821 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-02 00:16:08,821 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-02 00:16:08,822 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:16:08,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-01-02 00:16:08,822 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:08,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:08,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:08,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-01-02 00:16:08,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:08,823 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 497#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 498#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 507#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 506#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 505#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 504#L23-3 assume !(main_~i~1 < 5); 492#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 481#L9-3 [2019-01-02 00:16:08,825 INFO L796 eck$LassoCheckResult]: Loop: 481#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 482#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 491#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 486#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 481#L9-3 [2019-01-02 00:16:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-01-02 00:16:08,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:08,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:08,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:08,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:08,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:08,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:08,920 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:08,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-02 00:16:08,961 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-02 00:16:08,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:16:08,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:08,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:08,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-02 00:16:08,995 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2019-01-02 00:16:08,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:08,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:08,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:08,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:08,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:09,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-02 00:16:09,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-02 00:16:09,080 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-01-02 00:16:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:09,119 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-01-02 00:16:09,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-02 00:16:09,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2019-01-02 00:16:09,121 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:09,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2019-01-02 00:16:09,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-02 00:16:09,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-02 00:16:09,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2019-01-02 00:16:09,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:09,122 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-01-02 00:16:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2019-01-02 00:16:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-02 00:16:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-02 00:16:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-01-02 00:16:09,127 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-01-02 00:16:09,127 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-01-02 00:16:09,127 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:16:09,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2019-01-02 00:16:09,129 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-01-02 00:16:09,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:09,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:09,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-01-02 00:16:09,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:09,130 INFO L794 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 605#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 601#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 602#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 603#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 604#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 617#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 616#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 615#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 614#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 613#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 612#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 611#L23-3 assume !(main_~i~1 < 5); 600#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 589#L9-3 [2019-01-02 00:16:09,130 INFO L796 eck$LassoCheckResult]: Loop: 589#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 590#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 599#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 594#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 589#L9-3 [2019-01-02 00:16:09,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:09,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-01-02 00:16:09,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:09,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:09,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:09,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:09,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:09,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2019-01-02 00:16:09,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:09,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:09,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:09,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:09,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:09,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2019-01-02 00:16:09,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:09,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:09,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:09,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:09,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:09,513 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:16:10,032 WARN L181 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 102 [2019-01-02 00:16:10,133 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:16:10,133 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:16:10,133 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:16:10,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:16:10,133 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:16:10,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:16:10,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:16:10,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:16:10,134 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-02 00:16:10,134 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:16:10,134 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:16:10,139 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:10,142 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:10,144 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:10,146 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:10,149 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:10,153 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:10,156 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:10,158 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:10,161 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:10,164 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:10,166 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:10,170 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:10,172 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:10,175 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:10,179 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:10,182 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:10,185 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:10,187 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:10,190 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:10,374 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-01-02 00:16:10,401 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:10,404 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:10,406 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:10,408 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:10,410 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:10,805 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:16:10,805 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:16:10,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:10,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:10,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:10,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:10,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:10,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:10,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:10,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:10,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:10,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:10,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:10,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:10,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,883 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:16:10,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,885 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:16:10,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:10,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:10,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:10,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:10,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:10,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:10,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:10,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:10,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:10,918 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:16:10,930 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:16:10,930 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:16:10,930 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:16:10,931 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:16:10,932 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:16:10,932 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 9 Supporting invariants [] [2019-01-02 00:16:11,014 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:16:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:11,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:11,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:11,320 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:11,320 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:11,320 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-01-02 00:16:11,383 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2019-01-02 00:16:11,384 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:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:16:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-02 00:16:11,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-02 00:16:11,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:11,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 4 letters. [2019-01-02 00:16:11,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:11,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 8 letters. [2019-01-02 00:16:11,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:11,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-01-02 00:16:11,388 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:11,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2019-01-02 00:16:11,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-02 00:16:11,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-02 00:16:11,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-01-02 00:16:11,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:11,391 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-02 00:16:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-01-02 00:16:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-02 00:16:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-02 00:16:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-01-02 00:16:11,399 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-02 00:16:11,399 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-01-02 00:16:11,399 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-02 00:16:11,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2019-01-02 00:16:11,402 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:11,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:11,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:11,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:11,403 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:11,403 INFO L794 eck$LassoCheckResult]: Stem: 771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 768#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 764#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 765#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 766#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 767#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 780#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 779#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 778#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 777#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 776#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 775#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 774#L23-3 assume !(main_~i~1 < 5); 763#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 751#L9-3 assume !(max_~i~0 < 5); 747#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 748#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 772#L9-8 [2019-01-02 00:16:11,404 INFO L796 eck$LassoCheckResult]: Loop: 772#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 758#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 749#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 750#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 772#L9-8 [2019-01-02 00:16:11,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:11,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2019-01-02 00:16:11,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:11,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:11,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:11,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-02 00:16:11,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:16:11,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:16:11,488 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:11,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2019-01-02 00:16:11,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:11,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:11,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:11,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:11,785 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:16:11,965 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:16:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:16:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:16:11,966 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-02 00:16:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:12,007 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-01-02 00:16:12,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:16:12,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2019-01-02 00:16:12,011 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:12,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2019-01-02 00:16:12,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-02 00:16:12,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-02 00:16:12,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2019-01-02 00:16:12,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:12,013 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-01-02 00:16:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2019-01-02 00:16:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-01-02 00:16:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-02 00:16:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-01-02 00:16:12,018 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-01-02 00:16:12,018 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-01-02 00:16:12,018 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-02 00:16:12,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2019-01-02 00:16:12,021 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:12,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:12,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:12,023 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:12,023 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:12,023 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 853#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 849#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 850#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 851#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 852#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 866#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 865#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 864#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 863#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 862#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 861#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 860#L23-3 assume !(main_~i~1 < 5); 848#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 836#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 837#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 847#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 842#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 838#L9-3 assume !(max_~i~0 < 5); 832#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 833#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 857#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 843#L10-3 [2019-01-02 00:16:12,023 INFO L796 eck$LassoCheckResult]: Loop: 843#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 834#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 835#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 858#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 843#L10-3 [2019-01-02 00:16:12,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:12,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2019-01-02 00:16:12,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:12,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:12,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:12,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:12,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-02 00:16:12,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:12,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:16:12,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:12,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-02 00:16:12,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:12,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-02 00:16:12,247 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:12,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:12,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2019-01-02 00:16:12,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:12,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:12,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:12,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:12,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:12,439 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-02 00:16:12,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:16:12,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:16:12,465 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-01-02 00:16:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:12,537 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-01-02 00:16:12,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:16:12,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2019-01-02 00:16:12,540 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:12,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2019-01-02 00:16:12,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-01-02 00:16:12,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-02 00:16:12,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2019-01-02 00:16:12,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:12,542 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-01-02 00:16:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2019-01-02 00:16:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-01-02 00:16:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-02 00:16:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-01-02 00:16:12,549 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-01-02 00:16:12,549 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-01-02 00:16:12,549 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-02 00:16:12,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-01-02 00:16:12,549 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:12,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:12,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:12,552 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:12,552 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:12,554 INFO L794 eck$LassoCheckResult]: Stem: 1020#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1018#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1014#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1015#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1016#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1017#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1019#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1035#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1034#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1033#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1031#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1030#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1029#L23-3 assume !(main_~i~1 < 5); 1013#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 999#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1000#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1032#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1006#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1001#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1002#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1011#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1012#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1027#L9-3 assume !(max_~i~0 < 5); 995#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 996#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1024#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1037#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1036#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1025#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1023#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10-3 [2019-01-02 00:16:12,554 INFO L796 eck$LassoCheckResult]: Loop: 1007#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 997#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 998#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1028#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10-3 [2019-01-02 00:16:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1525547091, now seen corresponding path program 1 times [2019-01-02 00:16:12,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:12,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:12,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:12,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:12,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-02 00:16:12,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:12,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:16:12,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:12,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-02 00:16:12,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:12,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-02 00:16:12,853 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:12,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2019-01-02 00:16:12,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:12,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:12,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:12,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:12,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:13,153 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-02 00:16:13,270 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:16:13,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-02 00:16:13,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-02 00:16:13,272 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-01-02 00:16:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:13,358 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2019-01-02 00:16:13,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:16:13,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2019-01-02 00:16:13,361 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:13,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. [2019-01-02 00:16:13,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-01-02 00:16:13,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-01-02 00:16:13,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2019-01-02 00:16:13,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:13,363 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-01-02 00:16:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2019-01-02 00:16:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-01-02 00:16:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-02 00:16:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-01-02 00:16:13,367 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-01-02 00:16:13,367 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-01-02 00:16:13,367 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-02 00:16:13,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2019-01-02 00:16:13,367 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:13,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:13,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:13,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:13,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:13,372 INFO L794 eck$LassoCheckResult]: Stem: 1230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1227#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1223#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1224#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1225#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1226#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1248#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1247#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1246#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1245#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1244#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1243#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1242#L23-3 assume !(main_~i~1 < 5); 1222#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1207#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1208#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1220#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1221#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1209#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1210#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1253#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1214#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1215#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1237#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1252#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1238#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1236#L9-3 assume !(max_~i~0 < 5); 1203#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1204#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1231#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1232#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1251#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1233#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1234#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1216#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1205#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1206#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1250#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1240#L10-3 [2019-01-02 00:16:13,372 INFO L796 eck$LassoCheckResult]: Loop: 1240#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1249#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1241#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1239#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1240#L10-3 [2019-01-02 00:16:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash 452444531, now seen corresponding path program 2 times [2019-01-02 00:16:13,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:13,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:13,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:13,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:13,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-02 00:16:13,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:13,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:16:13,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:16:13,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:16:13,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:16:13,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-02 00:16:13,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:13,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-02 00:16:13,741 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:13,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2019-01-02 00:16:13,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:13,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:13,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:13,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:13,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:13,879 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-02 00:16:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-02 00:16:13,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-02 00:16:13,895 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-01-02 00:16:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:14,140 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-01-02 00:16:14,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-02 00:16:14,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2019-01-02 00:16:14,142 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:14,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 100 transitions. [2019-01-02 00:16:14,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-01-02 00:16:14,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-01-02 00:16:14,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 100 transitions. [2019-01-02 00:16:14,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:14,151 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-01-02 00:16:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 100 transitions. [2019-01-02 00:16:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-01-02 00:16:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-02 00:16:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-01-02 00:16:14,158 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-01-02 00:16:14,158 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-01-02 00:16:14,158 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-02 00:16:14,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2019-01-02 00:16:14,159 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:14,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:14,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:14,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:14,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:14,161 INFO L794 eck$LassoCheckResult]: Stem: 1481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1478#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1474#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1475#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1476#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1477#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1497#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1492#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1491#L23-3 assume !(main_~i~1 < 5); 1473#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1460#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1461#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1472#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1467#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1462#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1463#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1513#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1511#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1509#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1507#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1505#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1503#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1501#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1486#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1499#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1487#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1485#L9-3 assume !(max_~i~0 < 5); 1458#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1459#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1482#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1468#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1456#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1457#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1483#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1514#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1512#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1510#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1508#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1506#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1504#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1502#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1500#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1489#L10-3 [2019-01-02 00:16:14,161 INFO L796 eck$LassoCheckResult]: Loop: 1489#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1498#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1490#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1488#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1489#L10-3 [2019-01-02 00:16:14,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:14,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 3 times [2019-01-02 00:16:14,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:14,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:14,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:14,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:14,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-02 00:16:14,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-02 00:16:14,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-02 00:16:14,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-02 00:16:14,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-02 00:16:14,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-02 00:16:14,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-02 00:16:14,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-02 00:16:14,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-02 00:16:14,873 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:14,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:14,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2019-01-02 00:16:14,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:14,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:14,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:14,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:14,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:15,325 WARN L181 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-01-02 00:16:15,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-02 00:16:15,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-02 00:16:15,348 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand 8 states. [2019-01-02 00:16:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:15,492 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2019-01-02 00:16:15,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-02 00:16:15,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2019-01-02 00:16:15,494 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:15,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2019-01-02 00:16:15,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-01-02 00:16:15,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-01-02 00:16:15,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2019-01-02 00:16:15,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:15,497 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2019-01-02 00:16:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2019-01-02 00:16:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-01-02 00:16:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-02 00:16:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-01-02 00:16:15,507 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-01-02 00:16:15,508 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-01-02 00:16:15,508 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-02 00:16:15,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2019-01-02 00:16:15,508 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-02 00:16:15,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:15,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:15,513 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:15,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-02 00:16:15,513 INFO L794 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1768#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1764#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1765#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1766#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1767#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1793#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1791#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1789#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1787#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1785#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1783#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1782#L23-3 assume !(main_~i~1 < 5); 1763#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1749#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1750#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1811#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1810#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1751#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1752#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1762#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1756#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1757#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1809#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1808#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1807#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1806#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1805#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1803#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1801#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1799#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1776#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1796#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1777#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1775#L9-3 assume !(max_~i~0 < 5); 1745#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1746#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1772#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1758#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1747#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1748#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1773#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1804#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1802#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1800#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1798#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1797#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1795#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1794#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1792#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1790#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1788#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1786#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1784#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1779#L10-3 [2019-01-02 00:16:15,513 INFO L796 eck$LassoCheckResult]: Loop: 1779#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1781#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1780#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1778#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1779#L10-3 [2019-01-02 00:16:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:15,518 INFO L82 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 4 times [2019-01-02 00:16:15,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:15,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:15,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:15,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:15,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:15,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:15,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2019-01-02 00:16:15,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:15,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:15,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:15,629 INFO L82 PathProgramCache]: Analyzing trace with hash -746698386, now seen corresponding path program 1 times [2019-01-02 00:16:15,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:15,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:15,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:15,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:15,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-01-02 00:16:15,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:16:15,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-02 00:16:16,012 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-02 00:16:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-02 00:16:16,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-02 00:16:16,014 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. cyclomatic complexity: 20 Second operand 10 states. [2019-01-02 00:16:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:16,263 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2019-01-02 00:16:16,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-02 00:16:16,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 100 transitions. [2019-01-02 00:16:16,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:16:16,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2019-01-02 00:16:16,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-02 00:16:16,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-01-02 00:16:16,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2019-01-02 00:16:16,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:16,268 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-01-02 00:16:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2019-01-02 00:16:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-02 00:16:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-02 00:16:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-01-02 00:16:16,272 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-01-02 00:16:16,272 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-01-02 00:16:16,272 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-02 00:16:16,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2019-01-02 00:16:16,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:16:16,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:16,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:16,274 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:16,274 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:16:16,275 INFO L794 eck$LassoCheckResult]: Stem: 1941#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1940#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1936#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1937#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1938#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1939#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1961#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1958#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1955#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1952#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1950#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1948#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1947#L23-3 assume !(main_~i~1 < 5); 1935#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1927#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1928#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1934#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1929#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1930#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1984#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1983#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1981#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1979#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1977#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1975#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1973#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1971#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1969#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1967#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1965#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1963#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1960#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1957#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1954#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1946#L9-3 assume !(max_~i~0 < 5); 1923#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1924#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1944#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1931#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1925#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1926#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1945#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1982#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1980#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1978#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1976#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1974#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1972#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1970#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1968#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1966#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1964#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1962#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1959#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1956#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1953#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1951#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1949#L9-8 assume !(max_~i~0 < 5); 1942#L9-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1943#L12-1 main_#t~ret9 := max_#res;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 1932#L32-3 [2019-01-02 00:16:16,275 INFO L796 eck$LassoCheckResult]: Loop: 1932#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 1933#L32-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 1932#L32-3 [2019-01-02 00:16:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash -260352212, now seen corresponding path program 1 times [2019-01-02 00:16:16,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:16,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:16,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:16,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:16,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:16,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:16,347 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2019-01-02 00:16:16,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:16,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:16,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:16,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:16,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1090370322, now seen corresponding path program 1 times [2019-01-02 00:16:16,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:16,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:16,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:16,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:16,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:19,588 WARN L181 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 371 DAG size of output: 286 [2019-01-02 00:16:20,540 WARN L181 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 115 [2019-01-02 00:16:20,543 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:16:20,543 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:16:20,543 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:16:20,544 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:16:20,544 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:16:20,544 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:16:20,544 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:16:20,544 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:16:20,545 INFO L131 ssoRankerPreferences]: Filename of dumped script: max05_true-unreach-call_true-termination.i_Iteration14_Lasso [2019-01-02 00:16:20,545 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:16:20,545 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:16:20,552 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:20,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:20,626 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:20,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:20,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:20,650 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:20,654 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:20,660 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:20,661 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:20,663 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:20,667 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:20,669 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:20,671 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:20,673 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:20,676 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:20,681 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:20,683 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:20,685 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:20,687 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:20,690 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:20,693 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:21,187 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-01-02 00:16:21,913 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:16:21,913 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:16:21,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:21,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:21,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:21,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:21,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:21,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:21,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:21,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:21,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:21,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:21,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:21,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:21,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:21,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:21,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:21,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,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:21,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:21,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:21,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:21,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,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:21,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:21,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:21,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,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:21,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:21,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:21,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:21,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:21,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:21,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:21,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:21,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:21,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:21,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:21,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:21,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:21,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:21,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:21,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:21,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:21,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:21,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:21,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:21,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:21,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:21,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:21,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:21,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:21,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:21,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:21,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,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:21,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:21,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:21,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:21,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:21,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:21,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:21,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:21,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:21,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:21,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:22,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:22,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:22,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:22,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:22,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:22,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:22,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:22,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:22,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:22,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:22,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:22,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:22,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:22,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:22,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:22,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:22,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:22,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:22,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:22,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:22,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:22,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:22,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:22,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:22,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,052 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-02 00:16:22,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,059 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-02 00:16:22,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:22,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:22,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:22,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:22,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:22,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:22,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:22,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:22,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:22,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:22,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:22,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:22,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:22,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:22,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:22,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:22,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:22,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:22,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:22,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:22,102 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:16:22,150 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-01-02 00:16:22,151 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-02 00:16:22,151 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:16:22,152 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:16:22,152 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:16:22,156 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3) = -16*ULTIMATE.start_main_~i~2 + 7*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_3 Supporting invariants [] [2019-01-02 00:16:22,575 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2019-01-02 00:16:22,578 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:16:22,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:22,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:22,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:22,701 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:22,702 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:22,702 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-02 00:16:22,723 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 64 states and 76 transitions. Complement of second has 4 states. [2019-01-02 00:16:22,724 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:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:16:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2019-01-02 00:16:22,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 2 letters. [2019-01-02 00:16:22,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:22,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 62 letters. Loop has 2 letters. [2019-01-02 00:16:22,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:22,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 4 letters. [2019-01-02 00:16:22,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:22,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2019-01-02 00:16:22,732 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:16:22,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2019-01-02 00:16:22,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:16:22,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:16:22,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:16:22,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:22,732 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:16:22,732 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:16:22,732 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:16:22,732 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-02 00:16:22,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:16:22,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:16:22,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:16:22,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:16:22 BoogieIcfgContainer [2019-01-02 00:16:22,741 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:16:22,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:16:22,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:16:22,742 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:16:22,743 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:04" (3/4) ... [2019-01-02 00:16:22,747 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:16:22,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:16:22,748 INFO L168 Benchmark]: Toolchain (without parser) took 19250.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 137.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:22,749 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:16:22,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.59 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 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:22,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.62 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:16:22,750 INFO L168 Benchmark]: Boogie Preprocessor took 107.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:22,751 INFO L168 Benchmark]: RCFGBuilder took 658.66 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.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:22,752 INFO L168 Benchmark]: BuchiAutomizer took 18025.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.9 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:22,753 INFO L168 Benchmark]: Witness Printer took 4.90 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:16:22,757 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.59 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.62 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 658.66 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.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18025.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.9 MB). Peak memory consumption was 158.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.90 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -16 * i + 7 * unknown-#length-unknown[x] and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.9s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 15.6s. Construction of modules took 1.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 85 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 346 SDtfs, 399 SDslu, 704 SDs, 0 SdLazy, 441 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital257 mio100 ax100 hnf99 lsp95 ukn49 mio100 lsp55 div100 bol100 ite100 ukn100 eq163 hnf87 smp98 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 2 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...