./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c721a987debd4748cfed075333b7fa46c2d0f9ef ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:14,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:14,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:14,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:14,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:14,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:14,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:14,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:14,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:14,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:14,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:14,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:14,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:14,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:14,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:14,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:14,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:14,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:14,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:14,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:14,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:14,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:14,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:14,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:14,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:14,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:14,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:14,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:14,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:14,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:14,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:14,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:14,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:14,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:14,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:14,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:14,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:14,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:14,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:14,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:14,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:14,822 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:02:14,835 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:14,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:14,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:14,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:14,836 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:14,837 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:14,837 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:14,837 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:14,837 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:14,837 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:14,838 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:14,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:14,838 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:14,838 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:14,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:14,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:14,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:14,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:14,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:14,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:14,839 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:14,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:14,840 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:14,840 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:14,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:14,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:14,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:14,841 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:14,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:14,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:14,841 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:14,842 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:14,842 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c721a987debd4748cfed075333b7fa46c2d0f9ef [2019-10-22 09:02:14,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:14,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:14,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:14,899 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:14,900 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:14,900 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/max.i [2019-10-22 09:02:14,946 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/data/52d3a42f5/c3f3e1a821174b679fbc929bb976a17f/FLAG2e5325d69 [2019-10-22 09:02:15,340 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:15,341 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/sv-benchmarks/c/reducercommutativity/max.i [2019-10-22 09:02:15,347 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/data/52d3a42f5/c3f3e1a821174b679fbc929bb976a17f/FLAG2e5325d69 [2019-10-22 09:02:15,362 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/data/52d3a42f5/c3f3e1a821174b679fbc929bb976a17f [2019-10-22 09:02:15,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:15,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:15,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:15,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:15,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:15,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:15" (1/1) ... [2019-10-22 09:02:15,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ee8f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15, skipping insertion in model container [2019-10-22 09:02:15,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:15" (1/1) ... [2019-10-22 09:02:15,388 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:15,405 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:15,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:15,558 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:15,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:15,654 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:15,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15 WrapperNode [2019-10-22 09:02:15,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:15,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:15,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:15,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:15,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15" (1/1) ... [2019-10-22 09:02:15,672 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15" (1/1) ... [2019-10-22 09:02:15,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:15,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:15,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:15,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:15,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15" (1/1) ... [2019-10-22 09:02:15,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15" (1/1) ... [2019-10-22 09:02:15,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15" (1/1) ... [2019-10-22 09:02:15,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15" (1/1) ... [2019-10-22 09:02:15,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15" (1/1) ... [2019-10-22 09:02:15,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15" (1/1) ... [2019-10-22 09:02:15,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15" (1/1) ... [2019-10-22 09:02:15,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:15,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:15,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:15,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:15,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:15,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:15,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:16,226 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:16,226 INFO L284 CfgBuilder]: Removed 14 assume(true) statements. [2019-10-22 09:02:16,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:16 BoogieIcfgContainer [2019-10-22 09:02:16,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:16,228 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:16,228 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:16,232 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:16,233 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:16,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:15" (1/3) ... [2019-10-22 09:02:16,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56d437c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:16, skipping insertion in model container [2019-10-22 09:02:16,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:16,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:15" (2/3) ... [2019-10-22 09:02:16,235 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56d437c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:16, skipping insertion in model container [2019-10-22 09:02:16,235 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:16,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:16" (3/3) ... [2019-10-22 09:02:16,237 INFO L371 chiAutomizerObserver]: Analyzing ICFG max.i [2019-10-22 09:02:16,281 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:16,281 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:16,282 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:16,282 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:16,282 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:16,282 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:16,282 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:16,283 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:16,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-10-22 09:02:16,319 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-10-22 09:02:16,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:16,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:16,326 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:02:16,326 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:16,326 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:16,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-10-22 09:02:16,329 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-10-22 09:02:16,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:16,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:16,329 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:02:16,329 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:16,334 INFO L791 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 9#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 8#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 6#L11-3true [2019-10-22 09:02:16,335 INFO L793 eck$LassoCheckResult]: Loop: 6#L11-3true assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 12#L12true assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 11#L12-2true max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 7#L11-2true max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 6#L11-3true [2019-10-22 09:02:16,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:16,339 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-10-22 09:02:16,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:16,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431316731] [2019-10-22 09:02:16,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:16,444 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:16,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1326822, now seen corresponding path program 1 times [2019-10-22 09:02:16,446 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:16,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358449495] [2019-10-22 09:02:16,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:16,465 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:16,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1805089543, now seen corresponding path program 1 times [2019-10-22 09:02:16,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:16,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148043962] [2019-10-22 09:02:16,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:16,506 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:16,687 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:16,687 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:16,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:16,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:16,688 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:16,688 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:16,688 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:16,688 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:16,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration1_Lasso [2019-10-22 09:02:16,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:16,689 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:16,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-10-22 09:02:16,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,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-10-22 09:02:16,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,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-10-22 09:02:16,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:16,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:17,303 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:17,307 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:17,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,311 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,314 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,314 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,318 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,319 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,319 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,321 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,321 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,321 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,322 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,322 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,324 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,325 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,325 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,327 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,328 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,329 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,334 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,334 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,334 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,334 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,335 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,335 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,335 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,338 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,338 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,340 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:17,341 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:17,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,346 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,346 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,353 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,353 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,355 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,355 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,357 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:17,358 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:17,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,362 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,362 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,363 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,363 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,363 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,367 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,374 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:17,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,375 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:17,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:17,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,377 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,380 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:17,380 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:17,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,408 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,409 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,410 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:17,411 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:17,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:17,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:17,440 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:17,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:17,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:17,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:17,445 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:17,445 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:17,512 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:17,580 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:02:17,580 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:02:17,583 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:17,590 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:17,591 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:17,592 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, ~N~0) = -1*ULTIMATE.start_max_~i~0 + 1*~N~0 Supporting invariants [] [2019-10-22 09:02:17,609 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:02:17,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:17,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:17,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:17,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:17,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:17,698 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-10-22 09:02:17,699 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2019-10-22 09:02:17,754 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 3 states. Result 63 states and 87 transitions. Complement of second has 8 states. [2019-10-22 09:02:17,754 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-10-22 09:02:17,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2019-10-22 09:02:17,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 4 letters. [2019-10-22 09:02:17,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:17,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 09:02:17,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:17,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 8 letters. [2019-10-22 09:02:17,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:17,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 87 transitions. [2019-10-22 09:02:17,766 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:02:17,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 32 transitions. [2019-10-22 09:02:17,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 09:02:17,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-10-22 09:02:17,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2019-10-22 09:02:17,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:17,773 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-10-22 09:02:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2019-10-22 09:02:17,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-22 09:02:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 09:02:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-10-22 09:02:17,801 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-10-22 09:02:17,802 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-10-22 09:02:17,802 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:17,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2019-10-22 09:02:17,803 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:02:17,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:17,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:17,804 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:02:17,804 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:17,804 INFO L791 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 171#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 169#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 164#L11-3 assume !(max_~i~0 < ~N~0); 160#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 161#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 176#L11-8 [2019-10-22 09:02:17,805 INFO L793 eck$LassoCheckResult]: Loop: 176#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 168#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 158#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 159#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 176#L11-8 [2019-10-22 09:02:17,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:17,805 INFO L82 PathProgramCache]: Analyzing trace with hash 889511083, now seen corresponding path program 1 times [2019-10-22 09:02:17,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:17,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301679538] [2019-10-22 09:02:17,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:17,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:17,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:17,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301679538] [2019-10-22 09:02:17,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:17,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:17,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470450330] [2019-10-22 09:02:17,859 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:17,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:17,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 1 times [2019-10-22 09:02:17,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:17,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522431252] [2019-10-22 09:02:17,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:17,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:17,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:17,871 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:17,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:17,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:17,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:17,917 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-10-22 09:02:17,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:17,954 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-10-22 09:02:17,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:17,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-10-22 09:02:17,956 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:02:17,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2019-10-22 09:02:17,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 09:02:17,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-10-22 09:02:17,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-10-22 09:02:17,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:17,958 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-10-22 09:02:17,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-10-22 09:02:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-10-22 09:02:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 09:02:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-10-22 09:02:17,962 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 09:02:17,962 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 09:02:17,963 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:17,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-10-22 09:02:17,963 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:02:17,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:17,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:17,964 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:17,964 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:17,964 INFO L791 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 226#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 224#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 219#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 220#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 227#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 222#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 221#L11-3 assume !(max_~i~0 < ~N~0); 215#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 216#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 231#L11-8 [2019-10-22 09:02:17,965 INFO L793 eck$LassoCheckResult]: Loop: 231#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 223#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 213#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 214#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 231#L11-8 [2019-10-22 09:02:17,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:17,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1805667996, now seen corresponding path program 1 times [2019-10-22 09:02:17,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:17,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847677718] [2019-10-22 09:02:17,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:17,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:17,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:18,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847677718] [2019-10-22 09:02:18,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582289868] [2019-10-22 09:02:18,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:18,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:18,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:18,092 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:18,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-10-22 09:02:18,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872309798] [2019-10-22 09:02:18,092 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 2 times [2019-10-22 09:02:18,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:18,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368330691] [2019-10-22 09:02:18,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:18,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:18,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:18,103 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:18,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:18,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:02:18,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:02:18,143 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-10-22 09:02:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:18,227 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-10-22 09:02:18,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:18,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-10-22 09:02:18,229 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:02:18,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2019-10-22 09:02:18,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 09:02:18,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-10-22 09:02:18,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2019-10-22 09:02:18,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:18,230 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-10-22 09:02:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2019-10-22 09:02:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-10-22 09:02:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 09:02:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-10-22 09:02:18,239 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-10-22 09:02:18,240 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-10-22 09:02:18,240 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:18,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-10-22 09:02:18,241 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:02:18,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:18,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:18,242 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:18,242 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:18,242 INFO L791 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 315#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 314#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 308#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 309#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 324#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 312#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 310#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 311#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 317#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 318#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 323#L11-3 assume !(max_~i~0 < ~N~0); 302#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 303#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 322#L11-8 [2019-10-22 09:02:18,242 INFO L793 eck$LassoCheckResult]: Loop: 322#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 313#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 304#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 305#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 322#L11-8 [2019-10-22 09:02:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:18,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1818198429, now seen corresponding path program 2 times [2019-10-22 09:02:18,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:18,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132905523] [2019-10-22 09:02:18,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:18,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:18,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:18,310 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:18,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 3 times [2019-10-22 09:02:18,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:18,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466013665] [2019-10-22 09:02:18,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:18,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:18,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:18,329 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:18,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:18,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1198284866, now seen corresponding path program 1 times [2019-10-22 09:02:18,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:18,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44826002] [2019-10-22 09:02:18,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:18,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:18,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:18,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44826002] [2019-10-22 09:02:18,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328932248] [2019-10-22 09:02:18,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:18,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-22 09:02:18,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:18,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:18,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2019-10-22 09:02:18,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:18,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2019-10-22 09:02:18,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 09:02:18,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:18,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-22 09:02:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:18,974 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:18,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-10-22 09:02:18,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244354692] [2019-10-22 09:02:19,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:19,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 09:02:19,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:02:19,030 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand 15 states. [2019-10-22 09:02:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:19,934 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2019-10-22 09:02:19,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:02:19,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 102 transitions. [2019-10-22 09:02:19,936 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 22 [2019-10-22 09:02:19,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 102 transitions. [2019-10-22 09:02:19,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2019-10-22 09:02:19,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2019-10-22 09:02:19,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 102 transitions. [2019-10-22 09:02:19,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:19,939 INFO L688 BuchiCegarLoop]: Abstraction has 80 states and 102 transitions. [2019-10-22 09:02:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 102 transitions. [2019-10-22 09:02:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 39. [2019-10-22 09:02:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 09:02:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-10-22 09:02:19,943 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-10-22 09:02:19,943 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-10-22 09:02:19,943 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:02:19,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2019-10-22 09:02:19,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:02:19,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:19,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:19,945 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:19,945 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:19,945 INFO L791 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 507#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 506#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 500#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 501#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 525#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 528#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 527#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 520#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 523#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 524#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 518#L11-3 assume !(max_~i~0 < ~N~0); 519#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 517#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 515#L11-8 [2019-10-22 09:02:19,945 INFO L793 eck$LassoCheckResult]: Loop: 515#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 516#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 496#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 497#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 515#L11-8 [2019-10-22 09:02:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2083741857, now seen corresponding path program 1 times [2019-10-22 09:02:19,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:19,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884645575] [2019-10-22 09:02:19,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:19,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:19,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:19,973 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:19,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:19,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 4 times [2019-10-22 09:02:19,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:19,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608789738] [2019-10-22 09:02:19,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:19,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:19,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:19,979 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:19,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:19,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2085565180, now seen corresponding path program 1 times [2019-10-22 09:02:19,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:19,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837799434] [2019-10-22 09:02:19,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:19,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:19,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:20,020 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:20,398 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 119 [2019-10-22 09:02:20,584 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-10-22 09:02:20,585 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:20,585 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:20,585 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:20,585 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:20,586 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:20,586 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:20,586 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:20,586 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:20,586 INFO L131 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration5_Lasso [2019-10-22 09:02:20,586 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:20,586 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:20,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,872 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-22 09:02:20,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:20,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:21,229 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:21,230 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:21,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,231 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,232 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,232 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,237 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,237 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,240 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,242 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,243 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,244 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,245 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,245 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,245 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,246 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,246 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,247 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,247 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,255 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,256 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,257 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,257 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,259 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,266 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,267 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,268 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,269 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,269 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,270 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,270 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,270 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,271 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,271 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,276 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:21,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,278 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:21,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:21,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,279 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,281 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,282 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,296 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,296 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,298 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,298 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,305 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,306 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:21,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,307 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:21,311 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,320 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,321 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,324 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,325 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,325 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,330 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:21,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,330 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,331 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:21,331 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:21,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:21,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:21,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:21,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:21,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:21,344 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:21,345 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:21,367 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:21,393 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:02:21,393 INFO L444 ModelExtractionUtils]: 14 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:02:21,393 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:21,394 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 09:02:21,394 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:21,395 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, ULTIMATE.start_max_~x.offset) = -4*ULTIMATE.start_max_~i~0 - 1*ULTIMATE.start_max_~x.offset + 6 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_2 + 8 >= 0] [2019-10-22 09:02:21,406 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 09:02:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:21,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 09:02:21,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:21,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-10-22 09:02:21,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:21,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:21,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:21,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-22 09:02:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:21,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:02:21,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:21,539 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2019-10-22 09:02:21,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-10-22 09:02:21,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 80 states and 109 transitions. Complement of second has 12 states. [2019-10-22 09:02:21,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2019-10-22 09:02:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 09:02:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2019-10-22 09:02:21,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 40 transitions. Stem has 14 letters. Loop has 4 letters. [2019-10-22 09:02:21,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:21,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 40 transitions. Stem has 18 letters. Loop has 4 letters. [2019-10-22 09:02:21,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:21,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 40 transitions. Stem has 14 letters. Loop has 8 letters. [2019-10-22 09:02:21,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:21,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 109 transitions. [2019-10-22 09:02:21,679 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-10-22 09:02:21,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 71 states and 94 transitions. [2019-10-22 09:02:21,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-10-22 09:02:21,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-10-22 09:02:21,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 94 transitions. [2019-10-22 09:02:21,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:21,681 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 94 transitions. [2019-10-22 09:02:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 94 transitions. [2019-10-22 09:02:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2019-10-22 09:02:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 09:02:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-10-22 09:02:21,685 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-10-22 09:02:21,685 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-10-22 09:02:21,685 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:02:21,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-10-22 09:02:21,686 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:02:21,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:21,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:21,686 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:21,687 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:21,687 INFO L791 eck$LassoCheckResult]: Stem: 754#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 751#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 749#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 742#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 743#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 779#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 777#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 775#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 774#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 771#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 769#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 766#L11-3 assume !(max_~i~0 < ~N~0); 764#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 763#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 762#L11-8 assume !(max_~i~0 < ~N~0); 756#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 757#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 740#L32-3 [2019-10-22 09:02:21,687 INFO L793 eck$LassoCheckResult]: Loop: 740#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 741#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 740#L32-3 [2019-10-22 09:02:21,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1591298555, now seen corresponding path program 1 times [2019-10-22 09:02:21,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399621034] [2019-10-22 09:02:21,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 09:02:21,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399621034] [2019-10-22 09:02:21,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:21,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:21,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225988976] [2019-10-22 09:02:21,724 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2019-10-22 09:02:21,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216029089] [2019-10-22 09:02:21,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,734 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:21,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:21,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:21,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:21,787 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. cyclomatic complexity: 24 Second operand 4 states. [2019-10-22 09:02:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:21,825 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2019-10-22 09:02:21,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:21,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 86 transitions. [2019-10-22 09:02:21,826 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:02:21,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 86 transitions. [2019-10-22 09:02:21,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-10-22 09:02:21,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-10-22 09:02:21,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 86 transitions. [2019-10-22 09:02:21,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:21,828 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 86 transitions. [2019-10-22 09:02:21,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 86 transitions. [2019-10-22 09:02:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2019-10-22 09:02:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 09:02:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2019-10-22 09:02:21,832 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 73 transitions. [2019-10-22 09:02:21,832 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 73 transitions. [2019-10-22 09:02:21,833 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:02:21,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 73 transitions. [2019-10-22 09:02:21,833 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:02:21,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:21,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:21,834 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:21,834 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:21,834 INFO L791 eck$LassoCheckResult]: Stem: 885#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 882#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 881#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 874#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 875#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 886#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 918#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 917#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 916#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 914#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 912#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 909#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 902#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 907#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 905#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 901#L11-3 assume !(max_~i~0 < ~N~0); 899#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 897#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 895#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 894#L12-3 [2019-10-22 09:02:21,834 INFO L793 eck$LassoCheckResult]: Loop: 894#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 868#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 869#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 893#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 894#L12-3 [2019-10-22 09:02:21,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash 209733900, now seen corresponding path program 1 times [2019-10-22 09:02:21,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492060726] [2019-10-22 09:02:21,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,860 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:21,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2128124, now seen corresponding path program 5 times [2019-10-22 09:02:21,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961042184] [2019-10-22 09:02:21,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,867 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:21,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,867 INFO L82 PathProgramCache]: Analyzing trace with hash -772848505, now seen corresponding path program 2 times [2019-10-22 09:02:21,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741041571] [2019-10-22 09:02:21,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,893 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:22,455 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 134 [2019-10-22 09:02:22,637 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-22 09:02:22,638 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:22,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:22,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:22,638 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:22,638 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:22,638 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:22,638 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:22,638 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:22,639 INFO L131 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration7_Lasso [2019-10-22 09:02:22,639 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:22,639 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:22,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,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-10-22 09:02:22,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-10-22 09:02:22,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,904 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-22 09:02:22,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:23,233 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:23,234 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:23,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:23,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,235 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:23,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,235 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:23,235 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:23,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:23,237 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,237 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:23,237 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,237 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,237 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:23,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:23,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,238 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:23,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,239 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:23,239 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,240 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,240 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:23,240 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:23,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:23,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,242 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:23,242 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:23,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:23,247 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,247 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:23,247 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,247 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,248 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:23,249 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:23,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:23,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,253 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:23,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,253 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:23,254 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:23,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:23,254 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,255 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,255 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,255 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,257 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:23,257 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:23,282 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:23,314 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 09:02:23,314 INFO L444 ModelExtractionUtils]: 16 out of 25 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-10-22 09:02:23,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:23,315 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:23,315 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:23,315 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, ~N~0) = -1*ULTIMATE.start_max_~i~0 + 1*~N~0 Supporting invariants [] [2019-10-22 09:02:23,343 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:02:23,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:23,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:23,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:23,386 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-10-22 09:02:23,386 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 73 transitions. cyclomatic complexity: 21 Second operand 4 states. [2019-10-22 09:02:23,412 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 73 transitions. cyclomatic complexity: 21. Second operand 4 states. Result 71 states and 95 transitions. Complement of second has 7 states. [2019-10-22 09:02:23,412 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-10-22 09:02:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:02:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-10-22 09:02:23,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 4 letters. [2019-10-22 09:02:23,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:23,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 4 letters. [2019-10-22 09:02:23,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:23,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 8 letters. [2019-10-22 09:02:23,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:23,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 95 transitions. [2019-10-22 09:02:23,414 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:23,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 65 states and 87 transitions. [2019-10-22 09:02:23,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-10-22 09:02:23,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-10-22 09:02:23,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 87 transitions. [2019-10-22 09:02:23,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:23,416 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 87 transitions. [2019-10-22 09:02:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 87 transitions. [2019-10-22 09:02:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2019-10-22 09:02:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 09:02:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2019-10-22 09:02:23,422 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-10-22 09:02:23,422 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-10-22 09:02:23,422 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:02:23,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 77 transitions. [2019-10-22 09:02:23,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:23,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:23,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:23,423 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:23,424 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:23,424 INFO L791 eck$LassoCheckResult]: Stem: 1131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1128#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1127#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1120#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1121#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1160#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1158#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1156#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1153#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1150#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1149#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1147#L11-3 assume !(max_~i~0 < ~N~0); 1148#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1137#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1134#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1135#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1114#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1115#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1138#L11-8 assume !(max_~i~0 < ~N~0); 1132#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1133#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1118#L32-3 [2019-10-22 09:02:23,424 INFO L793 eck$LassoCheckResult]: Loop: 1118#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1119#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1118#L32-3 [2019-10-22 09:02:23,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,424 INFO L82 PathProgramCache]: Analyzing trace with hash -18080898, now seen corresponding path program 1 times [2019-10-22 09:02:23,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611562819] [2019-10-22 09:02:23,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 09:02:23,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611562819] [2019-10-22 09:02:23,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857024351] [2019-10-22 09:02:23,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:23,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 09:02:23,529 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:23,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-10-22 09:02:23,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278233418] [2019-10-22 09:02:23,530 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2019-10-22 09:02:23,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704380936] [2019-10-22 09:02:23,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,540 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:23,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:23,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:02:23,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:02:23,586 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. cyclomatic complexity: 24 Second operand 7 states. [2019-10-22 09:02:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:23,667 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-10-22 09:02:23,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:23,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 104 transitions. [2019-10-22 09:02:23,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:23,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 75 states and 96 transitions. [2019-10-22 09:02:23,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-10-22 09:02:23,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-10-22 09:02:23,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 96 transitions. [2019-10-22 09:02:23,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:23,670 INFO L688 BuchiCegarLoop]: Abstraction has 75 states and 96 transitions. [2019-10-22 09:02:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 96 transitions. [2019-10-22 09:02:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2019-10-22 09:02:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-22 09:02:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2019-10-22 09:02:23,676 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2019-10-22 09:02:23,676 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2019-10-22 09:02:23,676 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:02:23,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 75 transitions. [2019-10-22 09:02:23,677 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:23,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:23,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:23,677 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:23,678 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:23,678 INFO L791 eck$LassoCheckResult]: Stem: 1339#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1337#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1335#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1328#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1329#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1340#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1374#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1373#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1372#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1359#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1371#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1369#L11-3 assume !(max_~i~0 < ~N~0); 1370#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1347#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1343#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1344#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1322#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1323#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1345#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1346#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1320#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1321#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1348#L11-8 assume !(max_~i~0 < ~N~0); 1341#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1342#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1326#L32-3 [2019-10-22 09:02:23,678 INFO L793 eck$LassoCheckResult]: Loop: 1326#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1327#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1326#L32-3 [2019-10-22 09:02:23,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2011161481, now seen corresponding path program 2 times [2019-10-22 09:02:23,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990324423] [2019-10-22 09:02:23,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:23,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990324423] [2019-10-22 09:02:23,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515605185] [2019-10-22 09:02:23,989 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8897a53-0996-44c6-b937-cc7e8976eac4/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:24,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:02:24,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:02:24,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-22 09:02:24,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:24,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:24,105 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:24,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 23 [2019-10-22 09:02:24,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:24,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:24,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:24,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:19 [2019-10-22 09:02:24,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 09:02:24,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:24,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:24,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:24,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-10-22 09:02:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:02:24,211 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:24,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-10-22 09:02:24,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285580966] [2019-10-22 09:02:24,211 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2019-10-22 09:02:24,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917728156] [2019-10-22 09:02:24,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:24,216 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:24,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-22 09:02:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-22 09:02:24,248 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. cyclomatic complexity: 21 Second operand 17 states. [2019-10-22 09:02:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:24,754 INFO L93 Difference]: Finished difference Result 112 states and 144 transitions. [2019-10-22 09:02:24,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 09:02:24,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 144 transitions. [2019-10-22 09:02:24,755 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-10-22 09:02:24,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 112 states and 144 transitions. [2019-10-22 09:02:24,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2019-10-22 09:02:24,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-10-22 09:02:24,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 144 transitions. [2019-10-22 09:02:24,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:24,757 INFO L688 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-10-22 09:02:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 144 transitions. [2019-10-22 09:02:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2019-10-22 09:02:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 09:02:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-10-22 09:02:24,761 INFO L711 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-10-22 09:02:24,761 INFO L591 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-10-22 09:02:24,761 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:02:24,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 100 transitions. [2019-10-22 09:02:24,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:02:24,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:24,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:24,762 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:24,763 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:24,763 INFO L791 eck$LassoCheckResult]: Stem: 1615#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1613#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1611#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1603#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1604#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1635#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1636#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1605#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1606#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1655#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1653#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1650#L11-3 assume !(max_~i~0 < ~N~0); 1648#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1646#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1644#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1642#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1597#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1598#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1622#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1623#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1595#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1596#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1624#L11-8 assume !(max_~i~0 < ~N~0); 1618#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1619#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1601#L32-3 [2019-10-22 09:02:24,763 INFO L793 eck$LassoCheckResult]: Loop: 1601#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 1602#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1601#L32-3 [2019-10-22 09:02:24,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1618134471, now seen corresponding path program 1 times [2019-10-22 09:02:24,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709915652] [2019-10-22 09:02:24,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:24,839 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2019-10-22 09:02:24,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535589239] [2019-10-22 09:02:24,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:24,856 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:24,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash -249063589, now seen corresponding path program 1 times [2019-10-22 09:02:24,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:24,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089366109] [2019-10-22 09:02:24,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:24,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:24,910 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:25,633 WARN L191 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 166 [2019-10-22 09:02:26,378 WARN L191 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 105 [2019-10-22 09:02:26,379 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:26,379 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:26,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:26,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:26,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:26,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:26,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:26,380 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:26,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration10_Lasso [2019-10-22 09:02:26,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:26,380 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:26,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,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-10-22 09:02:26,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,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-10-22 09:02:26,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,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-10-22 09:02:26,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:26,524 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-22 09:02:26,928 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-10-22 09:02:26,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:27,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:27,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:27,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:27,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:27,214 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-10-22 09:02:27,612 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-10-22 09:02:27,660 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:27,660 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:27,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,661 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,661 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,662 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,663 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,663 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,663 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,663 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,663 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,663 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,665 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:27,665 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:27,666 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,666 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,666 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,666 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,666 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,667 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,667 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,668 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:27,668 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:27,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,678 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,678 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,679 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,680 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,680 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,680 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,680 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,680 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,682 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,682 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,682 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,682 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,683 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,683 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,683 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,684 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,685 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,685 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,687 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,689 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,689 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,690 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,690 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,691 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,692 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:27,692 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,692 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:27,693 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:27,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,694 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,694 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:27,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,695 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,696 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:27,696 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:27,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,704 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:27,704 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,704 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,707 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:27,707 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:27,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,720 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,720 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,721 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:27,721 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:27,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:27,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:27,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:27,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:27,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:27,725 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:27,726 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:27,730 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:27,759 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:27,816 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 09:02:27,816 INFO L444 ModelExtractionUtils]: 19 out of 28 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-10-22 09:02:27,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:27,817 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:27,817 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:27,817 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ~N~0) = -1*ULTIMATE.start_main_~i~1 + 1*~N~0 Supporting invariants [] [2019-10-22 09:02:27,852 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 09:02:27,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:27,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:27,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:27,901 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-10-22 09:02:27,901 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 100 transitions. cyclomatic complexity: 28 Second operand 3 states. [2019-10-22 09:02:27,918 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 78 states and 100 transitions. cyclomatic complexity: 28. Second operand 3 states. Result 85 states and 112 transitions. Complement of second has 6 states. [2019-10-22 09:02:27,920 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-10-22 09:02:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2019-10-22 09:02:27,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 2 letters. [2019-10-22 09:02:27,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:27,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 27 letters. Loop has 2 letters. [2019-10-22 09:02:27,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:27,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 4 letters. [2019-10-22 09:02:27,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:27,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 112 transitions. [2019-10-22 09:02:27,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:27,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 79 states and 102 transitions. [2019-10-22 09:02:27,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-10-22 09:02:27,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-10-22 09:02:27,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 102 transitions. [2019-10-22 09:02:27,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:27,924 INFO L688 BuchiCegarLoop]: Abstraction has 79 states and 102 transitions. [2019-10-22 09:02:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 102 transitions. [2019-10-22 09:02:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-10-22 09:02:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-22 09:02:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2019-10-22 09:02:27,928 INFO L711 BuchiCegarLoop]: Abstraction has 79 states and 102 transitions. [2019-10-22 09:02:27,928 INFO L591 BuchiCegarLoop]: Abstraction has 79 states and 102 transitions. [2019-10-22 09:02:27,928 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:02:27,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 102 transitions. [2019-10-22 09:02:27,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:27,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:27,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:27,929 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:27,929 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:27,930 INFO L791 eck$LassoCheckResult]: Stem: 1920#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 1917#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1916#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1907#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1908#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1954#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1970#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1969#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1968#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1966#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1964#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1962#L11-3 assume !(max_~i~0 < ~N~0); 1898#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1899#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1923#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1924#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1914#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1928#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1925#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1926#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1900#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1901#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1927#L11-8 assume !(max_~i~0 < ~N~0); 1921#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1922#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 1904#L32-3 assume !(main_~i~1 < ~N~0 - 1); 1896#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1897#L11-13 [2019-10-22 09:02:27,930 INFO L793 eck$LassoCheckResult]: Loop: 1897#L11-13 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1894#L12-6 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1895#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1918#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1897#L11-13 [2019-10-22 09:02:27,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash -249063647, now seen corresponding path program 1 times [2019-10-22 09:02:27,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:27,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137567403] [2019-10-22 09:02:27,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-22 09:02:27,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137567403] [2019-10-22 09:02:27,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:27,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:27,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353015212] [2019-10-22 09:02:27,958 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:27,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:27,958 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 1 times [2019-10-22 09:02:27,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:27,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186400556] [2019-10-22 09:02:27,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:27,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:27,963 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:28,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:28,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:28,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:28,002 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. cyclomatic complexity: 29 Second operand 4 states. [2019-10-22 09:02:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:28,027 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2019-10-22 09:02:28,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:28,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 102 transitions. [2019-10-22 09:02:28,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:28,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 102 transitions. [2019-10-22 09:02:28,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-10-22 09:02:28,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-10-22 09:02:28,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 102 transitions. [2019-10-22 09:02:28,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:28,030 INFO L688 BuchiCegarLoop]: Abstraction has 80 states and 102 transitions. [2019-10-22 09:02:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 102 transitions. [2019-10-22 09:02:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-10-22 09:02:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-22 09:02:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2019-10-22 09:02:28,036 INFO L711 BuchiCegarLoop]: Abstraction has 79 states and 101 transitions. [2019-10-22 09:02:28,036 INFO L591 BuchiCegarLoop]: Abstraction has 79 states and 101 transitions. [2019-10-22 09:02:28,036 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:02:28,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 101 transitions. [2019-10-22 09:02:28,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:28,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:28,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:28,037 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:28,037 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:28,037 INFO L791 eck$LassoCheckResult]: Stem: 2086#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 2084#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~1, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2082#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2073#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2074#L12 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2121#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2134#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2133#L11-3 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2132#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2131#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2130#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2129#L11-3 assume !(max_~i~0 < ~N~0); 2128#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2127#L14 main_#t~ret5 := max_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2125#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2096#L12-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2080#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2095#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2094#L11-8 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2093#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2066#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2067#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2092#L11-8 assume !(max_~i~0 < ~N~0); 2087#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2088#L14-1 main_#t~ret8 := max_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~1 := 0; 2070#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem11; 2071#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2072#L32-3 assume !(main_~i~1 < ~N~0 - 1); 2062#L32-4 call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 2063#L11-13 [2019-10-22 09:02:28,038 INFO L793 eck$LassoCheckResult]: Loop: 2063#L11-13 assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2060#L12-6 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 2061#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2083#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2063#L11-13 [2019-10-22 09:02:28,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1168061379, now seen corresponding path program 1 times [2019-10-22 09:02:28,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382112649] [2019-10-22 09:02:28,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,093 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,093 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 2 times [2019-10-22 09:02:28,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161629296] [2019-10-22 09:02:28,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,098 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:28,099 INFO L82 PathProgramCache]: Analyzing trace with hash 934015144, now seen corresponding path program 1 times [2019-10-22 09:02:28,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:28,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945572184] [2019-10-22 09:02:28,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:28,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:28,144 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:29,528 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 245 DAG size of output: 195 [2019-10-22 09:02:30,574 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2019-10-22 09:02:30,576 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:30,576 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:30,576 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:30,576 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:30,576 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:30,576 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:30,576 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:30,576 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:30,576 INFO L131 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration12_Lasso [2019-10-22 09:02:30,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:30,576 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:30,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,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-10-22 09:02:30,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,653 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-22 09:02:30,977 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2019-10-22 09:02:30,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:30,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:31,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:31,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:31,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:31,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:31,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:31,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:31,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:31,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:31,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:31,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:31,455 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-10-22 09:02:31,488 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:31,489 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:31,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:31,489 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:31,490 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:31,490 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:31,490 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:31,490 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:31,490 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:31,490 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:31,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:31,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:31,491 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:31,491 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:31,491 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:31,492 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:31,492 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:31,492 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:31,492 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:31,493 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:31,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:31,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:31,493 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:31,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:31,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:31,494 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:31,494 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:31,494 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:31,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:31,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:31,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:31,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:31,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:31,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:31,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:31,495 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:31,495 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:31,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:31,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:31,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:31,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:31,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:31,497 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:31,497 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:31,498 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:31,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:31,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:31,499 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:31,499 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:31,499 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:31,499 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:31,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:31,499 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:31,500 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:31,500 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:31,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:31,501 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:31,501 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:31,501 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:31,501 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:31,502 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:31,502 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:31,507 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:31,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:31,508 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:31,508 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:31,508 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:31,508 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:31,509 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:31,509 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:31,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:31,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-22 09:02:31,512 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:31,512 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:31,512 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:31,512 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:31,514 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:31,514 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:31,527 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:31,538 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:02:31,538 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:02:31,538 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:31,539 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:31,539 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:31,539 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_5, ULTIMATE.start_max_~x.offset) = -4*ULTIMATE.start_max_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_5 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2019-10-22 09:02:31,563 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:02:31,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:02:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:31,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:02:31,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:31,632 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-10-22 09:02:31,632 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 101 transitions. cyclomatic complexity: 28 Second operand 3 states. [2019-10-22 09:02:31,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79 states and 101 transitions. cyclomatic complexity: 28. Second operand 3 states. Result 83 states and 107 transitions. Complement of second has 4 states. [2019-10-22 09:02:31,662 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-10-22 09:02:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-10-22 09:02:31,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 4 letters. [2019-10-22 09:02:31,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 33 letters. Loop has 4 letters. [2019-10-22 09:02:31,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 8 letters. [2019-10-22 09:02:31,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:31,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 107 transitions. [2019-10-22 09:02:31,664 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:31,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 0 states and 0 transitions. [2019-10-22 09:02:31,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:31,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:31,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:31,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:31,665 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:31,665 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:31,665 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:31,665 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 09:02:31,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:31,665 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:31,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:31,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:31 BoogieIcfgContainer [2019-10-22 09:02:31,671 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:31,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:31,671 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:31,671 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:31,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:16" (3/4) ... [2019-10-22 09:02:31,680 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:31,680 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:31,681 INFO L168 Benchmark]: Toolchain (without parser) took 16315.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.3 MB). Free memory was 941.0 MB in the beginning and 1.3 GB in the end (delta: -314.6 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:31,682 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:31,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -203.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:31,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:31,682 INFO L168 Benchmark]: Boogie Preprocessor took 25.30 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:31,683 INFO L168 Benchmark]: RCFGBuilder took 507.82 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:31,683 INFO L168 Benchmark]: BuchiAutomizer took 15442.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -143.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:31,683 INFO L168 Benchmark]: Witness Printer took 9.21 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:31,688 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 288.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -203.0 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.30 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 507.82 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15442.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -143.3 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Witness Printer took 9.21 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (7 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -4 * i + -1 * x + 6 and consists of 9 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] + -1 * x and consists of 3 locations. 7 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.4s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 12.8s. Construction of modules took 1.0s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 129 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 79 states and ocurred in iteration 10. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 246 SDtfs, 434 SDslu, 313 SDs, 0 SdLazy, 1439 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital403 mio100 ax100 hnf99 lsp84 ukn72 mio100 lsp41 div121 bol100 ite100 ukn100 eq159 hnf82 smp82 dnf255 smp56 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 4 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...