./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/max.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c721a987debd4748cfed075333b7fa46c2d0f9ef .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:52:06,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:52:06,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:52:06,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:52:06,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:52:06,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:52:06,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:52:06,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:52:06,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:52:06,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:52:06,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:52:06,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:52:06,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:52:06,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:52:06,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:52:06,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:52:06,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:52:06,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:52:06,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:52:06,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:52:06,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:52:06,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:52:06,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:52:06,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:52:06,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:52:06,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:52:06,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:52:06,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:52:06,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:52:06,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:52:06,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:52:06,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:52:06,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:52:06,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:52:06,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:52:06,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:52:06,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:52:06,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:52:06,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:52:06,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:52:06,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:52:06,783 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:52:06,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:52:06,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:52:06,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:52:06,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:52:06,812 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:52:06,812 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:52:06,812 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:52:06,813 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:52:06,813 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:52:06,813 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:52:06,814 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:52:06,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:52:06,815 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:52:06,815 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:52:06,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:52:06,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:52:06,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:52:06,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:52:06,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:52:06,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:52:06,817 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:52:06,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:52:06,818 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:52:06,818 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:52:06,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:52:06,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:52:06,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:52:06,819 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:52:06,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:52:06,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:52:06,820 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:52:06,822 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:52:06,823 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c721a987debd4748cfed075333b7fa46c2d0f9ef [2019-11-28 03:52:07,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:52:07,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:52:07,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:52:07,148 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:52:07,148 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:52:07,149 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max.i [2019-11-28 03:52:07,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490a39860/8a84b477f09640b1a68b2d18111f1200/FLAG10632b5ea [2019-11-28 03:52:07,665 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:52:07,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i [2019-11-28 03:52:07,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490a39860/8a84b477f09640b1a68b2d18111f1200/FLAG10632b5ea [2019-11-28 03:52:08,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/490a39860/8a84b477f09640b1a68b2d18111f1200 [2019-11-28 03:52:08,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:52:08,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:52:08,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:08,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:52:08,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:52:08,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:08" (1/1) ... [2019-11-28 03:52:08,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44256411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08, skipping insertion in model container [2019-11-28 03:52:08,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:08" (1/1) ... [2019-11-28 03:52:08,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:52:08,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:52:08,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:08,309 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:52:08,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:52:08,342 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:52:08,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08 WrapperNode [2019-11-28 03:52:08,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:52:08,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:08,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:52:08,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:52:08,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08" (1/1) ... [2019-11-28 03:52:08,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08" (1/1) ... [2019-11-28 03:52:08,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:52:08,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:52:08,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:52:08,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:52:08,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08" (1/1) ... [2019-11-28 03:52:08,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08" (1/1) ... [2019-11-28 03:52:08,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08" (1/1) ... [2019-11-28 03:52:08,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08" (1/1) ... [2019-11-28 03:52:08,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08" (1/1) ... [2019-11-28 03:52:08,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08" (1/1) ... [2019-11-28 03:52:08,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08" (1/1) ... [2019-11-28 03:52:08,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:52:08,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:52:08,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:52:08,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:52:08,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:08,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:52:08,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:52:08,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:52:08,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:52:08,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:52:08,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:52:08,901 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:52:08,901 INFO L297 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-28 03:52:08,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:08 BoogieIcfgContainer [2019-11-28 03:52:08,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:52:08,903 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:52:08,903 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:52:08,906 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:52:08,907 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:08,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:52:08" (1/3) ... [2019-11-28 03:52:08,909 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fa33dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:08, skipping insertion in model container [2019-11-28 03:52:08,909 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:08,909 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:08" (2/3) ... [2019-11-28 03:52:08,910 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fa33dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:52:08, skipping insertion in model container [2019-11-28 03:52:08,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:52:08,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:08" (3/3) ... [2019-11-28 03:52:08,914 INFO L371 chiAutomizerObserver]: Analyzing ICFG max.i [2019-11-28 03:52:08,962 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:52:08,962 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:52:08,962 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:52:08,962 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:52:08,962 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:52:08,963 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:52:08,963 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:52:08,963 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:52:08,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-11-28 03:52:08,994 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-28 03:52:08,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:08,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:09,000 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:52:09,000 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:09,001 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:52:09,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-11-28 03:52:09,004 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-28 03:52:09,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:09,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:09,004 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:52:09,005 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:09,013 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~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-11-28 03:52:09,013 INFO L796 eck$LassoCheckResult]: Loop: 6#L11-3true assume !!(max_~i~0 < ~N~0);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 12#L12true assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 11#L12-2true max_~ret~0 := max_#t~ite3;havoc max_#t~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-11-28 03:52:09,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:09,019 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-28 03:52:09,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:09,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401264639] [2019-11-28 03:52:09,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:09,139 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:09,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:09,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1326822, now seen corresponding path program 1 times [2019-11-28 03:52:09,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:09,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808220904] [2019-11-28 03:52:09,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:09,166 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:09,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:09,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1805089543, now seen corresponding path program 1 times [2019-11-28 03:52:09,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:09,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961819824] [2019-11-28 03:52:09,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:09,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:09,448 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-28 03:52:09,515 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:09,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:09,516 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:09,516 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:09,517 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:09,517 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:09,517 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:09,517 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:09,517 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration1_Lasso [2019-11-28 03:52:09,518 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:09,518 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:09,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,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-11-28 03:52:09,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,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-11-28 03:52:09,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,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-11-28 03:52:09,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-11-28 03:52:09,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:09,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:10,112 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:10,118 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,128 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-11-28 03:52:10,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,159 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-11-28 03:52:10,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:10,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,187 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-11-28 03:52:10,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,214 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-11-28 03:52:10,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,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-11-28 03:52:10,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,246 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,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-11-28 03:52:10,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,282 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-11-28 03:52:10,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,306 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-11-28 03:52:10,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:10,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,338 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-11-28 03:52:10,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:10,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,356 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-11-28 03:52:10,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:10,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,372 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-11-28 03:52:10,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,376 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,376 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:10,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,390 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-11-28 03:52:10,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:10,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:10,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,424 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-11-28 03:52:10,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,451 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-11-28 03:52:10,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:10,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,481 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-11-28 03:52:10,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,505 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-11-28 03:52:10,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:10,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:10,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,530 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-11-28 03:52:10,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:10,541 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,569 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-11-28 03:52:10,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:10,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:10,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,611 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-11-28 03:52:10,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:10,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:10,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:10,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:10,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:10,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,641 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:10,679 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-28 03:52:10,679 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:10,704 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:10,709 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:10,709 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:10,710 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-11-28 03:52:10,728 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 03:52:10,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:10,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:10,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:10,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:10,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:10,863 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-11-28 03:52:10,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2019-11-28 03:52:10,929 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-11-28 03:52:10,929 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-11-28 03:52:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2019-11-28 03:52:10,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-28 03:52:10,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:10,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-28 03:52:10,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:10,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 8 letters. [2019-11-28 03:52:10,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:10,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 87 transitions. [2019-11-28 03:52:10,943 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-28 03:52:10,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 32 transitions. [2019-11-28 03:52:10,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 03:52:10,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-28 03:52:10,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2019-11-28 03:52:10,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:10,950 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-11-28 03:52:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2019-11-28 03:52:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 03:52:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:52:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-11-28 03:52:10,981 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-11-28 03:52:10,981 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-11-28 03:52:10,981 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:52:10,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2019-11-28 03:52:10,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-28 03:52:10,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:10,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:10,983 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:52:10,983 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:10,984 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~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-11-28 03:52:10,984 INFO L796 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-11-28 03:52:10,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:10,985 INFO L82 PathProgramCache]: Analyzing trace with hash 889511083, now seen corresponding path program 1 times [2019-11-28 03:52:10,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:10,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019064410] [2019-11-28 03:52:10,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:11,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019064410] [2019-11-28 03:52:11,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:11,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:52:11,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405482577] [2019-11-28 03:52:11,072 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:11,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 1 times [2019-11-28 03:52:11,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:11,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192787921] [2019-11-28 03:52:11,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:11,103 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:11,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:11,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:52:11,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:52:11,168 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 03:52:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:11,243 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-11-28 03:52:11,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:52:11,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-11-28 03:52:11,245 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-28 03:52:11,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 03:52:11,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 03:52:11,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-28 03:52:11,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-11-28 03:52:11,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:11,247 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 03:52:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-11-28 03:52:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-11-28 03:52:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:52:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-28 03:52:11,253 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-28 03:52:11,253 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-28 03:52:11,254 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:52:11,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-28 03:52:11,256 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-28 03:52:11,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:11,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:11,258 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:11,258 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:11,259 INFO L794 eck$LassoCheckResult]: Stem: 228#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~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-11-28 03:52:11,259 INFO L796 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-11-28 03:52:11,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:11,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1805667996, now seen corresponding path program 1 times [2019-11-28 03:52:11,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:11,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619045667] [2019-11-28 03:52:11,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:11,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619045667] [2019-11-28 03:52:11,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981730584] [2019-11-28 03:52:11,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:11,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:11,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:11,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:11,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 03:52:11,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409257869] [2019-11-28 03:52:11,448 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:11,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:11,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 2 times [2019-11-28 03:52:11,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:11,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360057789] [2019-11-28 03:52:11,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:11,476 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:11,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:52:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:52:11,526 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-11-28 03:52:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:11,589 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-11-28 03:52:11,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:52:11,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-11-28 03:52:11,591 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-28 03:52:11,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2019-11-28 03:52:11,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 03:52:11,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-28 03:52:11,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2019-11-28 03:52:11,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:11,593 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-28 03:52:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2019-11-28 03:52:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-11-28 03:52:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 03:52:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-28 03:52:11,596 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 03:52:11,596 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 03:52:11,596 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:52:11,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-11-28 03:52:11,597 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-28 03:52:11,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:11,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:11,598 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:11,598 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:11,598 INFO L794 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~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-11-28 03:52:11,598 INFO L796 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-11-28 03:52:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1818198429, now seen corresponding path program 2 times [2019-11-28 03:52:11,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:11,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590755875] [2019-11-28 03:52:11,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:11,656 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:11,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:11,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 3 times [2019-11-28 03:52:11,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:11,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396686752] [2019-11-28 03:52:11,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:11,679 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:11,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:11,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1198284866, now seen corresponding path program 1 times [2019-11-28 03:52:11,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:11,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881624355] [2019-11-28 03:52:11,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:12,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881624355] [2019-11-28 03:52:12,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910940459] [2019-11-28 03:52:12,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:12,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-28 03:52:12,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:12,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:52:12,253 INFO L377 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-11-28 03:52:12,258 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:52:12,268 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:52:12,269 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:52:12,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2019-11-28 03:52:12,300 INFO L377 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-11-28 03:52:12,301 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:52:12,305 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:52:12,306 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:52:12,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-28 03:52:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:12,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:12,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-28 03:52:12,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045292789] [2019-11-28 03:52:12,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:12,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 03:52:12,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-11-28 03:52:12,375 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand 16 states. [2019-11-28 03:52:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:13,548 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2019-11-28 03:52:13,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 03:52:13,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 102 transitions. [2019-11-28 03:52:13,550 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 22 [2019-11-28 03:52:13,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 102 transitions. [2019-11-28 03:52:13,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2019-11-28 03:52:13,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2019-11-28 03:52:13,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 102 transitions. [2019-11-28 03:52:13,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:13,554 INFO L688 BuchiCegarLoop]: Abstraction has 80 states and 102 transitions. [2019-11-28 03:52:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 102 transitions. [2019-11-28 03:52:13,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 39. [2019-11-28 03:52:13,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 03:52:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-11-28 03:52:13,560 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-28 03:52:13,560 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-28 03:52:13,560 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:52:13,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2019-11-28 03:52:13,561 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-28 03:52:13,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:13,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:13,562 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:13,562 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:13,562 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 508#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; 507#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; 501#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); 502#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; 526#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 529#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 528#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); 521#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 524#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 525#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 519#L11-3 assume !(max_~i~0 < ~N~0); 520#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 518#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; 516#L11-8 [2019-11-28 03:52:13,562 INFO L796 eck$LassoCheckResult]: Loop: 516#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); 517#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; 497#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 498#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 516#L11-8 [2019-11-28 03:52:13,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2083741857, now seen corresponding path program 1 times [2019-11-28 03:52:13,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:13,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990110295] [2019-11-28 03:52:13,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:13,614 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:13,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:13,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 4 times [2019-11-28 03:52:13,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:13,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866236019] [2019-11-28 03:52:13,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:13,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:13,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:13,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2085565180, now seen corresponding path program 1 times [2019-11-28 03:52:13,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:13,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674726549] [2019-11-28 03:52:13,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:13,693 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:14,150 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 118 [2019-11-28 03:52:14,439 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-28 03:52:14,442 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:14,442 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:14,442 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:14,442 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:14,442 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:14,442 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:14,443 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:14,443 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:14,443 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration5_Lasso [2019-11-28 03:52:14,443 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:14,443 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:14,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,871 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-11-28 03:52:14,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-11-28 03:52:14,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-11-28 03:52:14,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-11-28 03:52:14,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,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-11-28 03:52:14,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,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-11-28 03:52:14,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-11-28 03:52:14,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:14,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:15,385 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:15,385 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,392 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-11-28 03:52:15,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:15,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:15,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:15,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,401 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-11-28 03:52:15,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:15,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:15,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:15,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,409 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-11-28 03:52:15,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:15,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:15,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:15,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,419 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-11-28 03:52:15,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:15,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:15,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:15,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,428 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-11-28 03:52:15,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:15,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:15,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:15,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:15,454 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-11-28 03:52:15,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:15,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:15,469 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-11-28 03:52:15,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:15,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:15,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:15,485 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-11-28 03:52:15,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:15,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:15,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:15,501 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-11-28 03:52:15,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:15,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,514 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:15,527 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-11-28 03:52:15,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:15,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:15,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:15,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:15,538 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-11-28 03:52:15,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:15,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,557 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-11-28 03:52:15,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:15,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:15,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,570 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-11-28 03:52:15,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,572 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:52:15,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,575 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:52:15,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:15,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:15,598 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-11-28 03:52:15,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:15,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:15,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:15,626 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-11-28 03:52:15,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:15,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:15,641 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-11-28 03:52:15,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:15,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:15,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:15,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:15,654 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:15,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,671 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:15,736 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 03:52:15,736 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:15,742 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:15,746 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:52:15,746 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:15,746 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)_2) = -8*ULTIMATE.start_max_~i~0 + 3*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_2 Supporting invariants [-1*~N~0 + 2 >= 0] [2019-11-28 03:52:15,766 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2019-11-28 03:52:15,771 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:52:15,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:15,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:52:15,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:15,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 03:52:15,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:15,904 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-11-28 03:52:15,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-11-28 03:52:16,075 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 13 states. [2019-11-28 03:52:16,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-28 03:52:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 03:52:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2019-11-28 03:52:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-28 03:52:16,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 18 letters. Loop has 4 letters. [2019-11-28 03:52:16,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:16,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 14 letters. Loop has 8 letters. [2019-11-28 03:52:16,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:16,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 109 transitions. [2019-11-28 03:52:16,079 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-11-28 03:52:16,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 71 states and 94 transitions. [2019-11-28 03:52:16,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-28 03:52:16,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-28 03:52:16,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 94 transitions. [2019-11-28 03:52:16,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:16,082 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 94 transitions. [2019-11-28 03:52:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 94 transitions. [2019-11-28 03:52:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2019-11-28 03:52:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 03:52:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-11-28 03:52:16,087 INFO L711 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-28 03:52:16,087 INFO L591 BuchiCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-11-28 03:52:16,087 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:52:16,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 75 transitions. [2019-11-28 03:52:16,088 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-28 03:52:16,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:16,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:16,089 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:16,089 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:16,090 INFO L794 eck$LassoCheckResult]: Stem: 757#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 754#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; 752#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; 745#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); 746#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; 782#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 780#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 778#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); 777#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 774#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 772#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 769#L11-3 assume !(max_~i~0 < ~N~0); 767#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 766#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; 765#L11-8 assume !(max_~i~0 < ~N~0); 759#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 760#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; 743#L32-3 [2019-11-28 03:52:16,090 INFO L796 eck$LassoCheckResult]: Loop: 743#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; 744#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 743#L32-3 [2019-11-28 03:52:16,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1591298555, now seen corresponding path program 1 times [2019-11-28 03:52:16,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:16,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297290373] [2019-11-28 03:52:16,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 03:52:16,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297290373] [2019-11-28 03:52:16,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:16,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:52:16,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510974036] [2019-11-28 03:52:16,118 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:16,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2019-11-28 03:52:16,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:16,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66721907] [2019-11-28 03:52:16,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:16,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:16,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:16,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:52:16,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:52:16,168 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. cyclomatic complexity: 24 Second operand 4 states. [2019-11-28 03:52:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:16,209 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2019-11-28 03:52:16,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:52:16,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 86 transitions. [2019-11-28 03:52:16,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-28 03:52:16,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 86 transitions. [2019-11-28 03:52:16,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-28 03:52:16,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-28 03:52:16,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 86 transitions. [2019-11-28 03:52:16,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:16,213 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 86 transitions. [2019-11-28 03:52:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 86 transitions. [2019-11-28 03:52:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2019-11-28 03:52:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 03:52:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2019-11-28 03:52:16,218 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 73 transitions. [2019-11-28 03:52:16,218 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 73 transitions. [2019-11-28 03:52:16,218 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:52:16,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 73 transitions. [2019-11-28 03:52:16,219 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-28 03:52:16,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:16,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:16,220 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:52:16,220 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:16,221 INFO L794 eck$LassoCheckResult]: Stem: 888#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 885#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; 884#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; 877#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); 878#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; 889#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 921#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 920#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); 919#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 917#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 915#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 912#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); 905#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 910#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 908#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 904#L11-3 assume !(max_~i~0 < ~N~0); 902#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 900#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; 898#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); 897#L12-3 [2019-11-28 03:52:16,221 INFO L796 eck$LassoCheckResult]: Loop: 897#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; 871#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 872#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 896#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); 897#L12-3 [2019-11-28 03:52:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:16,221 INFO L82 PathProgramCache]: Analyzing trace with hash 209733900, now seen corresponding path program 1 times [2019-11-28 03:52:16,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:16,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619037419] [2019-11-28 03:52:16,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:16,251 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2128124, now seen corresponding path program 5 times [2019-11-28 03:52:16,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:16,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68873031] [2019-11-28 03:52:16,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:16,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:16,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:16,267 INFO L82 PathProgramCache]: Analyzing trace with hash -772848505, now seen corresponding path program 2 times [2019-11-28 03:52:16,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:16,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536857122] [2019-11-28 03:52:16,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:16,333 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:16,997 WARN L192 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 138 [2019-11-28 03:52:17,374 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 03:52:17,381 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:17,381 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:17,381 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:17,382 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:17,382 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:17,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:17,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:17,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:17,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration7_Lasso [2019-11-28 03:52:17,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:17,382 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:17,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,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-11-28 03:52:17,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,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-11-28 03:52:17,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,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-11-28 03:52:17,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-11-28 03:52:17,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-11-28 03:52:17,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-11-28 03:52:17,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,854 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-11-28 03:52:17,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:17,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:18,336 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:18,337 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,346 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-11-28 03:52:18,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:18,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:18,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:18,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:18,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-11-28 03:52:18,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:18,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:18,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,365 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-11-28 03:52:18,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:18,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:18,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:18,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:18,374 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-11-28 03:52:18,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:18,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,387 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-11-28 03:52:18,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:18,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:18,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:18,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,397 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-11-28 03:52:18,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:18,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:18,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:18,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,405 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-11-28 03:52:18,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:18,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:18,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:18,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,414 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-11-28 03:52:18,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:18,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:18,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:18,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,423 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-11-28 03:52:18,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:18,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:18,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,434 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-11-28 03:52:18,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,435 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:18,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:18,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:18,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,443 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-11-28 03:52:18,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:18,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:18,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:18,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,452 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-11-28 03:52:18,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:18,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:18,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:18,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:18,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:18,463 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-11-28 03:52:18,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:18,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:18,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:18,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:18,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:18,491 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:18,518 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2019-11-28 03:52:18,518 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:18,522 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:18,524 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:18,524 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:18,524 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, v_rep(select #length ULTIMATE.start_max_~x.base)_3, ULTIMATE.start_max_~x.offset) = -4*ULTIMATE.start_max_~i~0 + 1*v_rep(select #length ULTIMATE.start_max_~x.base)_3 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2019-11-28 03:52:18,538 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:52:18,539 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:52:18,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:18,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:18,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:18,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:18,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:18,589 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-11-28 03:52:18,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 73 transitions. cyclomatic complexity: 21 Second operand 4 states. [2019-11-28 03:52:18,628 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-11-28 03:52:18,628 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-11-28 03:52:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:52:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-11-28 03:52:18,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-28 03:52:18,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:18,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 23 letters. Loop has 4 letters. [2019-11-28 03:52:18,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:18,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 19 letters. Loop has 8 letters. [2019-11-28 03:52:18,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:18,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 95 transitions. [2019-11-28 03:52:18,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:52:18,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 65 states and 87 transitions. [2019-11-28 03:52:18,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-28 03:52:18,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-28 03:52:18,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 87 transitions. [2019-11-28 03:52:18,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:18,633 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 87 transitions. [2019-11-28 03:52:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 87 transitions. [2019-11-28 03:52:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2019-11-28 03:52:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 03:52:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2019-11-28 03:52:18,637 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-11-28 03:52:18,637 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-11-28 03:52:18,637 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:52:18,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 77 transitions. [2019-11-28 03:52:18,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:52:18,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:18,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:18,642 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-11-28 03:52:18,642 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:18,643 INFO L794 eck$LassoCheckResult]: Stem: 1126#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1124#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; 1122#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; 1115#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); 1116#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; 1155#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1153#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1151#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); 1148#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1145#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1144#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1142#L11-3 assume !(max_~i~0 < ~N~0); 1143#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1132#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; 1129#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); 1130#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1109#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1110#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1133#L11-8 assume !(max_~i~0 < ~N~0); 1127#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1128#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; 1113#L32-3 [2019-11-28 03:52:18,643 INFO L796 eck$LassoCheckResult]: Loop: 1113#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; 1114#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1113#L32-3 [2019-11-28 03:52:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash -18080898, now seen corresponding path program 1 times [2019-11-28 03:52:18,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:18,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834130359] [2019-11-28 03:52:18,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 03:52:18,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834130359] [2019-11-28 03:52:18,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745960723] [2019-11-28 03:52:18,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:18,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:18,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 03:52:18,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:18,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-28 03:52:18,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463520428] [2019-11-28 03:52:18,750 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2019-11-28 03:52:18,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:18,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128728657] [2019-11-28 03:52:18,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:18,761 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:18,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:18,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:52:18,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:52:18,816 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. cyclomatic complexity: 24 Second operand 7 states. [2019-11-28 03:52:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:18,902 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-11-28 03:52:18,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:52:18,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 104 transitions. [2019-11-28 03:52:18,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:52:18,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 75 states and 96 transitions. [2019-11-28 03:52:18,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-28 03:52:18,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-28 03:52:18,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 96 transitions. [2019-11-28 03:52:18,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:18,906 INFO L688 BuchiCegarLoop]: Abstraction has 75 states and 96 transitions. [2019-11-28 03:52:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 96 transitions. [2019-11-28 03:52:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2019-11-28 03:52:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 03:52:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2019-11-28 03:52:18,911 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2019-11-28 03:52:18,911 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 75 transitions. [2019-11-28 03:52:18,911 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:52:18,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 75 transitions. [2019-11-28 03:52:18,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:52:18,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:18,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:18,912 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-11-28 03:52:18,913 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:18,913 INFO L794 eck$LassoCheckResult]: Stem: 1334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1332#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; 1330#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; 1323#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); 1324#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; 1335#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1369#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1368#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); 1367#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1354#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1366#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1364#L11-3 assume !(max_~i~0 < ~N~0); 1365#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1342#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; 1338#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); 1339#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1317#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1318#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1340#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); 1341#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1315#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1316#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1343#L11-8 assume !(max_~i~0 < ~N~0); 1336#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1337#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; 1321#L32-3 [2019-11-28 03:52:18,913 INFO L796 eck$LassoCheckResult]: Loop: 1321#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; 1322#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1321#L32-3 [2019-11-28 03:52:18,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2011161481, now seen corresponding path program 2 times [2019-11-28 03:52:18,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:18,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906462973] [2019-11-28 03:52:18,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:19,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906462973] [2019-11-28 03:52:19,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578535633] [2019-11-28 03:52:19,294 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:52:19,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:52:19,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:52:19,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 03:52:19,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:19,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:52:19,400 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:52:19,401 INFO L377 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-11-28 03:52:19,401 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:52:19,409 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:52:19,410 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:52:19,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:19 [2019-11-28 03:52:19,471 INFO L377 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-11-28 03:52:19,471 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:52:19,474 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:52:19,475 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:52:19,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-28 03:52:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 03:52:19,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:52:19,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-28 03:52:19,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063550532] [2019-11-28 03:52:19,492 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2019-11-28 03:52:19,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:19,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641535858] [2019-11-28 03:52:19,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:19,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:19,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:19,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 03:52:19,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-11-28 03:52:19,553 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. cyclomatic complexity: 21 Second operand 17 states. [2019-11-28 03:52:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:20,276 INFO L93 Difference]: Finished difference Result 112 states and 144 transitions. [2019-11-28 03:52:20,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 03:52:20,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 144 transitions. [2019-11-28 03:52:20,279 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-28 03:52:20,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 112 states and 144 transitions. [2019-11-28 03:52:20,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2019-11-28 03:52:20,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-11-28 03:52:20,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 144 transitions. [2019-11-28 03:52:20,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:20,282 INFO L688 BuchiCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-11-28 03:52:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 144 transitions. [2019-11-28 03:52:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 78. [2019-11-28 03:52:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 03:52:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-11-28 03:52:20,287 INFO L711 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-11-28 03:52:20,287 INFO L591 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-11-28 03:52:20,287 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:52:20,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 100 transitions. [2019-11-28 03:52:20,288 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 03:52:20,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:20,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:20,289 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-11-28 03:52:20,289 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:52:20,289 INFO L794 eck$LassoCheckResult]: Stem: 1610#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1608#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; 1606#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; 1598#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); 1599#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; 1630#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1631#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1600#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); 1601#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1650#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1648#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1645#L11-3 assume !(max_~i~0 < ~N~0); 1643#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1641#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; 1639#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); 1637#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; 1592#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1593#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1617#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); 1618#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1590#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1591#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1619#L11-8 assume !(max_~i~0 < ~N~0); 1613#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1614#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; 1596#L32-3 [2019-11-28 03:52:20,290 INFO L796 eck$LassoCheckResult]: Loop: 1596#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; 1597#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1596#L32-3 [2019-11-28 03:52:20,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:20,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1618134471, now seen corresponding path program 1 times [2019-11-28 03:52:20,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:20,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112952114] [2019-11-28 03:52:20,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:20,353 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:20,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:20,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2019-11-28 03:52:20,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:20,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90344751] [2019-11-28 03:52:20,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:20,358 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:20,359 INFO L82 PathProgramCache]: Analyzing trace with hash -249063589, now seen corresponding path program 1 times [2019-11-28 03:52:20,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:20,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501176226] [2019-11-28 03:52:20,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:20,406 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:21,292 WARN L192 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 167 [2019-11-28 03:52:22,247 WARN L192 SmtUtils]: Spent 930.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2019-11-28 03:52:22,250 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:22,250 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:22,251 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:22,251 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:22,251 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:22,251 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:22,251 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:22,251 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:22,251 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration10_Lasso [2019-11-28 03:52:22,251 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:22,251 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:22,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:22,434 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-28 03:52:23,108 WARN L192 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 86 [2019-11-28 03:52:23,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:23,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:23,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:23,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:23,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:23,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:23,639 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-11-28 03:52:24,263 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2019-11-28 03:52:24,305 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:24,306 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:24,315 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-11-28 03:52:24,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:24,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:24,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,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-11-28 03:52:24,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:24,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:24,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:24,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:24,342 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-11-28 03:52:24,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:24,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:24,360 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-11-28 03:52:24,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:24,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:24,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:24,370 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-11-28 03:52:24,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:24,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,384 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-11-28 03:52:24,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:24,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:24,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:24,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:24,402 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-11-28 03:52:24,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:24,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:24,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:24,414 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-11-28 03:52:24,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:24,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:24,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:24,423 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-11-28 03:52:24,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:24,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:24,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,431 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-11-28 03:52:24,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:24,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:24,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:24,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,439 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-11-28 03:52:24,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:24,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:24,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:24,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:24,455 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-11-28 03:52:24,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:24,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:24,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:24,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:24,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:24,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,479 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:24,512 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-28 03:52:24,512 INFO L444 ModelExtractionUtils]: 10 out of 28 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:24,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:24,517 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:24,517 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:24,518 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-11-28 03:52:24,548 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-28 03:52:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:24,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:24,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:24,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:52:24,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:24,597 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-11-28 03:52:24,597 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 78 states and 100 transitions. cyclomatic complexity: 28 Second operand 3 states. [2019-11-28 03:52:24,616 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-11-28 03:52:24,619 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-11-28 03:52:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2019-11-28 03:52:24,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 2 letters. [2019-11-28 03:52:24,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:24,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 27 letters. Loop has 2 letters. [2019-11-28 03:52:24,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:24,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 25 letters. Loop has 4 letters. [2019-11-28 03:52:24,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:24,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 112 transitions. [2019-11-28 03:52:24,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:52:24,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 79 states and 102 transitions. [2019-11-28 03:52:24,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-28 03:52:24,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-28 03:52:24,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 102 transitions. [2019-11-28 03:52:24,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:24,624 INFO L688 BuchiCegarLoop]: Abstraction has 79 states and 102 transitions. [2019-11-28 03:52:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 102 transitions. [2019-11-28 03:52:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-28 03:52:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 03:52:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2019-11-28 03:52:24,631 INFO L711 BuchiCegarLoop]: Abstraction has 79 states and 102 transitions. [2019-11-28 03:52:24,631 INFO L591 BuchiCegarLoop]: Abstraction has 79 states and 102 transitions. [2019-11-28 03:52:24,631 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:52:24,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 102 transitions. [2019-11-28 03:52:24,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:52:24,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:24,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:24,635 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-11-28 03:52:24,635 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:24,636 INFO L794 eck$LassoCheckResult]: Stem: 1914#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1911#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; 1910#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; 1902#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); 1903#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; 1950#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1965#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1963#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); 1961#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1959#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1957#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1956#L11-3 assume !(max_~i~0 < ~N~0); 1955#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1953#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; 1951#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); 1925#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; 1908#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1922#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1919#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); 1920#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1895#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1896#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1921#L11-8 assume !(max_~i~0 < ~N~0); 1915#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1916#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; 1899#L32-3 assume !(main_~i~1 < ~N~0 - 1); 1891#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; 1892#L11-13 [2019-11-28 03:52:24,636 INFO L796 eck$LassoCheckResult]: Loop: 1892#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); 1889#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; 1890#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 1912#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1892#L11-13 [2019-11-28 03:52:24,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:24,636 INFO L82 PathProgramCache]: Analyzing trace with hash -249063647, now seen corresponding path program 1 times [2019-11-28 03:52:24,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:24,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451043913] [2019-11-28 03:52:24,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 03:52:24,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451043913] [2019-11-28 03:52:24,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:52:24,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:52:24,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443305448] [2019-11-28 03:52:24,699 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:52:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 1 times [2019-11-28 03:52:24,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:24,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894751315] [2019-11-28 03:52:24,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:24,716 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:24,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:52:24,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:52:24,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:52:24,757 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. cyclomatic complexity: 29 Second operand 4 states. [2019-11-28 03:52:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:52:24,780 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2019-11-28 03:52:24,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:52:24,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 102 transitions. [2019-11-28 03:52:24,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:52:24,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 102 transitions. [2019-11-28 03:52:24,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-28 03:52:24,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-28 03:52:24,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 102 transitions. [2019-11-28 03:52:24,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:52:24,784 INFO L688 BuchiCegarLoop]: Abstraction has 80 states and 102 transitions. [2019-11-28 03:52:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 102 transitions. [2019-11-28 03:52:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-11-28 03:52:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-28 03:52:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2019-11-28 03:52:24,787 INFO L711 BuchiCegarLoop]: Abstraction has 79 states and 101 transitions. [2019-11-28 03:52:24,788 INFO L591 BuchiCegarLoop]: Abstraction has 79 states and 101 transitions. [2019-11-28 03:52:24,788 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:52:24,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 101 transitions. [2019-11-28 03:52:24,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-28 03:52:24,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:52:24,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:52:24,789 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-11-28 03:52:24,790 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-28 03:52:24,790 INFO L794 eck$LassoCheckResult]: Stem: 2081#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 2079#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; 2077#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; 2068#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); 2069#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; 2116#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2129#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2128#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); 2127#L12 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2126#L12-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2125#L11-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2124#L11-3 assume !(max_~i~0 < ~N~0); 2123#L11-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2122#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; 2120#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); 2091#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; 2075#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2090#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2089#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); 2088#L12-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2061#L12-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2062#L11-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2087#L11-8 assume !(max_~i~0 < ~N~0); 2082#L11-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2083#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; 2065#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; 2066#L32-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 2067#L32-3 assume !(main_~i~1 < ~N~0 - 1); 2057#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; 2058#L11-13 [2019-11-28 03:52:24,790 INFO L796 eck$LassoCheckResult]: Loop: 2058#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); 2055#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; 2056#L12-8 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2;havoc max_#t~ite3; 2078#L11-12 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2058#L11-13 [2019-11-28 03:52:24,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:24,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1168061379, now seen corresponding path program 1 times [2019-11-28 03:52:24,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:24,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174273742] [2019-11-28 03:52:24,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:24,834 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:24,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:24,834 INFO L82 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 2 times [2019-11-28 03:52:24,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:24,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919054006] [2019-11-28 03:52:24,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:24,839 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:24,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash 934015144, now seen corresponding path program 1 times [2019-11-28 03:52:24,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:52:24,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943684457] [2019-11-28 03:52:24,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:52:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:52:24,922 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:52:26,437 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 246 DAG size of output: 200 [2019-11-28 03:52:27,953 WARN L192 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2019-11-28 03:52:27,956 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:52:27,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:52:27,956 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:52:27,956 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:52:27,956 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:52:27,956 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:27,957 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:52:27,957 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:52:27,957 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration12_Lasso [2019-11-28 03:52:27,957 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:52:27,957 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:52:27,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:27,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:28,078 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-11-28 03:52:28,631 WARN L192 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 80 [2019-11-28 03:52:28,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-11-28 03:52:28,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:28,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:28,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:28,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:28,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:28,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:52:28,886 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-28 03:52:29,269 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-28 03:52:29,359 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:52:29,359 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,368 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-11-28 03:52:29,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:29,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:29,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:29,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,380 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-11-28 03:52:29,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:29,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:29,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:29,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,398 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-11-28 03:52:29,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:29,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:29,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:29,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:29,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 Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:29,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:29,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:29,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,416 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-11-28 03:52:29,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:29,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:29,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,427 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-11-28 03:52:29,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:29,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:29,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:29,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,436 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-11-28 03:52:29,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:29,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:29,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:29,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,446 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-11-28 03:52:29,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:29,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:29,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:29,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,463 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-11-28 03:52:29,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:29,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:29,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:29,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,471 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-11-28 03:52:29,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:29,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:29,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:29,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,481 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-11-28 03:52:29,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:52:29,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:52:29,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:52:29,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,495 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-11-28 03:52:29,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:29,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:29,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:52:29,510 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 Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:29,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:29,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,527 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-11-28 03:52:29,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,528 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:52:29,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,532 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:52:29,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:29,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,546 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-11-28 03:52:29,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:29,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:29,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,555 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-11-28 03:52:29,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:29,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:29,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,568 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-11-28 03:52:29,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:29,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:29,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,585 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-11-28 03:52:29,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:52:29,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:52:29,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:52:29,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:52:29,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:52:29,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:52:29,605 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:52:29,633 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-28 03:52:29,633 INFO L444 ModelExtractionUtils]: 2 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:52:29,637 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:52:29,640 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:52:29,640 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:52:29,640 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0, v_rep(select #length ULTIMATE.start_max_~x.base)_5, ULTIMATE.start_max_~x.offset) = -4*ULTIMATE.start_max_~i~0 + 2*v_rep(select #length ULTIMATE.start_max_~x.base)_5 - 1*ULTIMATE.start_max_~x.offset Supporting invariants [] [2019-11-28 03:52:29,662 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-28 03:52:29,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:52:29,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:52:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:29,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:52:29,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:52:29,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:52:29,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:52:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:52:29,730 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-11-28 03:52:29,730 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79 states and 101 transitions. cyclomatic complexity: 28 Second operand 3 states. [2019-11-28 03:52:29,740 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-11-28 03:52:29,742 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-11-28 03:52:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:52:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-11-28 03:52:29,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 4 letters. [2019-11-28 03:52:29,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:29,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 33 letters. Loop has 4 letters. [2019-11-28 03:52:29,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:29,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 29 letters. Loop has 8 letters. [2019-11-28 03:52:29,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:52:29,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 107 transitions. [2019-11-28 03:52:29,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:52:29,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 0 states and 0 transitions. [2019-11-28 03:52:29,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:52:29,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:52:29,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:52:29,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:52:29,746 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:29,746 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:29,747 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:52:29,747 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 03:52:29,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:52:29,747 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:52:29,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:52:29,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:52:29 BoogieIcfgContainer [2019-11-28 03:52:29,752 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:52:29,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:52:29,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:52:29,753 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:52:29,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:52:08" (3/4) ... [2019-11-28 03:52:29,756 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:52:29,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:52:29,757 INFO L168 Benchmark]: Toolchain (without parser) took 21702.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 446.7 MB). Free memory was 960.4 MB in the beginning and 986.0 MB in the end (delta: -25.7 MB). Peak memory consumption was 421.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:29,758 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:52:29,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.52 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:29,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:29,759 INFO L168 Benchmark]: Boogie Preprocessor took 27.93 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-11-28 03:52:29,759 INFO L168 Benchmark]: RCFGBuilder took 432.43 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:29,760 INFO L168 Benchmark]: BuchiAutomizer took 20849.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 310.4 MB). Free memory was 1.1 GB in the beginning and 986.0 MB in the end (delta: 113.5 MB). Peak memory consumption was 423.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:52:29,760 INFO L168 Benchmark]: Witness Printer took 3.52 ms. Allocated memory is still 1.5 GB. Free memory is still 986.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:52:29,762 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.52 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.93 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. * RCFGBuilder took 432.43 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20849.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 310.4 MB). Free memory was 1.1 GB in the beginning and 986.0 MB in the end (delta: 113.5 MB). Peak memory consumption was 423.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.52 ms. Allocated memory is still 1.5 GB. Free memory is still 986.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 -8 * i + 3 * unknown-#length-unknown[x] and consists of 10 locations. One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] + -1 * x and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -4 * i + 2 * 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 20.7s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 17.6s. Construction of modules took 1.4s. Büchi inclusion checks took 1.5s. 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, 447 SDslu, 319 SDs, 0 SdLazy, 1471 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU6 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital419 mio100 ax100 hnf99 lsp87 ukn71 mio100 lsp41 div117 bol100 ite100 ukn100 eq160 hnf83 smp79 dnf188 smp63 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms 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...