./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f6fb2bb1 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/max05-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d02fdead04c3e6f93d11e2edd6641f56f1584022 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 20:07:52,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:07:52,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:07:52,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:07:52,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:07:52,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:07:52,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:07:52,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:07:52,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:07:52,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:07:52,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:07:52,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:07:52,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:07:52,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:07:52,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:07:52,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:07:52,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:07:52,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:07:52,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:07:52,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:07:52,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:07:52,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:07:52,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:07:52,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:07:52,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:07:52,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:07:52,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:07:52,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:07:52,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:07:52,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:07:52,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:07:52,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:07:52,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:07:52,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:07:52,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:07:52,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:07:52,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:07:52,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:07:52,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:07:52,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:07:52,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:07:52,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-19 20:07:52,801 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:07:52,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:07:52,804 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:07:52,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:07:52,805 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:07:52,805 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 20:07:52,805 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 20:07:52,806 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 20:07:52,806 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 20:07:52,806 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 20:07:52,807 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 20:07:52,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:07:52,808 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:07:52,808 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 20:07:52,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:07:52,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:07:52,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:07:52,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 20:07:52,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 20:07:52,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 20:07:52,810 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:07:52,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:07:52,811 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 20:07:52,811 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:07:52,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 20:07:52,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:07:52,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:07:52,812 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 20:07:52,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:07:52,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:07:52,813 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 20:07:52,815 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 20:07:52,816 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 -> d02fdead04c3e6f93d11e2edd6641f56f1584022 [2019-11-19 20:07:53,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:07:53,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:07:53,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:07:53,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:07:53,162 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:07:53,163 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max05-1.i [2019-11-19 20:07:53,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ca33efc/363216e171be47e3aa56b622bb44052c/FLAGf8cc63b18 [2019-11-19 20:07:53,733 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:07:53,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2019-11-19 20:07:53,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ca33efc/363216e171be47e3aa56b622bb44052c/FLAGf8cc63b18 [2019-11-19 20:07:54,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ca33efc/363216e171be47e3aa56b622bb44052c [2019-11-19 20:07:54,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:07:54,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:07:54,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:07:54,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:07:54,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:07:54,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:07:54" (1/1) ... [2019-11-19 20:07:54,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e80ad49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54, skipping insertion in model container [2019-11-19 20:07:54,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:07:54" (1/1) ... [2019-11-19 20:07:54,106 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:07:54,123 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:07:54,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:07:54,340 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:07:54,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:07:54,419 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:07:54,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54 WrapperNode [2019-11-19 20:07:54,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:07:54,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:07:54,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:07:54,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:07:54,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54" (1/1) ... [2019-11-19 20:07:54,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54" (1/1) ... [2019-11-19 20:07:54,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:07:54,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:07:54,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:07:54,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:07:54,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54" (1/1) ... [2019-11-19 20:07:54,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54" (1/1) ... [2019-11-19 20:07:54,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54" (1/1) ... [2019-11-19 20:07:54,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54" (1/1) ... [2019-11-19 20:07:54,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54" (1/1) ... [2019-11-19 20:07:54,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54" (1/1) ... [2019-11-19 20:07:54,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54" (1/1) ... [2019-11-19 20:07:54,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:07:54,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:07:54,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:07:54,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:07:54,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54" (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-19 20:07:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 20:07:54,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:07:54,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:07:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 20:07:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 20:07:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 20:07:55,123 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:07:55,124 INFO L285 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-19 20:07:55,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:07:55 BoogieIcfgContainer [2019-11-19 20:07:55,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:07:55,126 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 20:07:55,126 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 20:07:55,130 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 20:07:55,131 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 20:07:55,131 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 08:07:54" (1/3) ... [2019-11-19 20:07:55,133 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2adaaad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:07:55, skipping insertion in model container [2019-11-19 20:07:55,133 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 20:07:55,133 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:07:54" (2/3) ... [2019-11-19 20:07:55,134 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2adaaad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:07:55, skipping insertion in model container [2019-11-19 20:07:55,134 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 20:07:55,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:07:55" (3/3) ... [2019-11-19 20:07:55,137 INFO L371 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2019-11-19 20:07:55,190 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 20:07:55,190 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 20:07:55,191 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 20:07:55,191 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:07:55,193 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:07:55,193 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 20:07:55,193 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:07:55,194 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 20:07:55,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-11-19 20:07:55,255 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-11-19 20:07:55,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:07:55,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:07:55,263 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 20:07:55,263 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 20:07:55,263 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 20:07:55,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-11-19 20:07:55,267 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-11-19 20:07:55,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:07:55,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:07:55,268 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 20:07:55,268 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 20:07:55,276 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 30#L23-3true [2019-11-19 20:07:55,277 INFO L796 eck$LassoCheckResult]: Loop: 30#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 10#L23-2true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 30#L23-3true [2019-11-19 20:07:55,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-19 20:07:55,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:55,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304436599] [2019-11-19 20:07:55,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:55,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:07:55,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:55,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-19 20:07:55,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:55,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918371694] [2019-11-19 20:07:55,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:55,458 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:07:55,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:55,460 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-19 20:07:55,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:55,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190499913] [2019-11-19 20:07:55,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:55,504 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:07:55,661 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 20:07:55,662 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 20:07:55,662 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 20:07:55,662 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 20:07:55,662 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 20:07:55,662 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:55,663 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 20:07:55,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 20:07:55,663 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2019-11-19 20:07:55,663 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 20:07:55,663 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 20:07:55,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:07:55,696 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-19 20:07:55,759 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-19 20:07:55,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:07:55,767 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-19 20:07:55,770 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-19 20:07:55,774 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-19 20:07:55,780 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-19 20:07:55,788 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-19 20:07:55,794 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-19 20:07:55,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-19 20:07:55,801 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-19 20:07:55,804 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-19 20:07:55,807 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-19 20:07:55,812 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-19 20:07:55,818 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-19 20:07:55,821 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-19 20:07:55,824 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-19 20:07:56,042 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 20:07:56,048 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:56,069 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-19 20:07:56,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:56,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:56,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:56,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:56,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:56,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:56,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:07:56,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe 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-19 20:07:56,103 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-19 20:07:56,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:56,108 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-19 20:07:56,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:56,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:56,119 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-19 20:07:56,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:56,131 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-19 20:07:56,148 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-19 20:07:56,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:56,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:56,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:56,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:56,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:07:56,160 INFO L402 nArgumentSynthesizer]: A total of 2 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-19 20:07:56,165 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:56,177 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-19 20:07:56,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:56,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:56,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:56,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:56,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:56,184 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:56,184 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:07:56,185 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:56,197 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-19 20:07:56,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:56,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:56,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:56,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:56,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:07:56,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:07:56,216 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:56,229 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-19 20:07:56,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:56,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:56,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:56,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:56,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:56,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:56,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:07:56,235 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-19 20:07:56,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 20:07:56,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:56,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:56,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:56,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:56,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:07:56,263 INFO L402 nArgumentSynthesizer]: A total of 2 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-19 20:07:56,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 20:07:56,301 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-19 20:07:56,302 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. 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-19 20:07:56,312 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:56,317 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 20:07:56,317 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 20:07:56,318 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2019-11-19 20:07:56,330 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-19 20:07:56,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 20:07:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:07:56,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:07:56,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:07:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:07:56,410 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 20:07:56,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:07:56,443 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-19 20:07:56,463 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-19 20:07:56,464 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2019-11-19 20:07:56,626 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 84 states and 119 transitions. Complement of second has 8 states. [2019-11-19 20:07:56,628 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-19 20:07:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 20:07:56,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-11-19 20:07:56,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-19 20:07:56,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:07:56,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-19 20:07:56,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:07:56,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-19 20:07:56,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:07:56,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2019-11-19 20:07:56,655 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:56,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2019-11-19 20:07:56,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-19 20:07:56,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 20:07:56,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2019-11-19 20:07:56,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:07:56,672 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-19 20:07:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2019-11-19 20:07:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-19 20:07:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 20:07:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-19 20:07:56,713 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-19 20:07:56,713 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-19 20:07:56,713 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 20:07:56,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-19 20:07:56,718 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:56,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:07:56,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:07:56,719 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-19 20:07:56,719 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:07:56,720 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 175#L23-3 assume !(main_~i~1 < 5); 174#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 163#L9-3 [2019-11-19 20:07:56,720 INFO L796 eck$LassoCheckResult]: Loop: 163#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 164#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 173#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 168#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 163#L9-3 [2019-11-19 20:07:56,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:56,721 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-19 20:07:56,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:56,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933149654] [2019-11-19 20:07:56,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:07:56,815 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-19 20:07:56,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933149654] [2019-11-19 20:07:56,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:07:56,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:07:56,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755760566] [2019-11-19 20:07:56,821 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:07:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:56,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2019-11-19 20:07:56,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:56,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988208008] [2019-11-19 20:07:56,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:56,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:07:56,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:07:56,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:07:56,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:07:56,904 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-19 20:07:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:07:56,921 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-11-19 20:07:56,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:07:56,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-11-19 20:07:56,924 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:56,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2019-11-19 20:07:56,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 20:07:56,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 20:07:56,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-11-19 20:07:56,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:07:56,925 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-19 20:07:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-11-19 20:07:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-19 20:07:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-19 20:07:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-11-19 20:07:56,929 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-19 20:07:56,929 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-19 20:07:56,929 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 20:07:56,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2019-11-19 20:07:56,930 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:56,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:07:56,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:07:56,931 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-19 20:07:56,931 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:07:56,931 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 235#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 232#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 233#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 234#L23-3 assume !(main_~i~1 < 5); 231#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 220#L9-3 [2019-11-19 20:07:56,931 INFO L796 eck$LassoCheckResult]: Loop: 220#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 221#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 230#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 225#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 220#L9-3 [2019-11-19 20:07:56,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-19 20:07:56,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:56,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817573061] [2019-11-19 20:07:56,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:07:56,979 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-19 20:07:56,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817573061] [2019-11-19 20:07:56,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298072250] [2019-11-19 20:07:56,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:07:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:07:57,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 20:07:57,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:07:57,045 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-19 20:07:57,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:07:57,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-19 20:07:57,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077423696] [2019-11-19 20:07:57,048 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:07:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2019-11-19 20:07:57,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:57,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075581088] [2019-11-19 20:07:57,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:07:57,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:07:57,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:07:57,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:07:57,147 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-19 20:07:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:07:57,173 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-19 20:07:57,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:07:57,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-11-19 20:07:57,174 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:57,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2019-11-19 20:07:57,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 20:07:57,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 20:07:57,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-11-19 20:07:57,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:07:57,178 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-19 20:07:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-11-19 20:07:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-19 20:07:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 20:07:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-19 20:07:57,183 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-19 20:07:57,183 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-19 20:07:57,184 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 20:07:57,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-11-19 20:07:57,186 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:57,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:07:57,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:07:57,187 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-19 20:07:57,187 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:07:57,188 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 312#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 308#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 309#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 310#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 311#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 318#L23-3 assume !(main_~i~1 < 5); 307#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 296#L9-3 [2019-11-19 20:07:57,188 INFO L796 eck$LassoCheckResult]: Loop: 296#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 297#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 306#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 301#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 296#L9-3 [2019-11-19 20:07:57,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:57,188 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-19 20:07:57,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:57,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272014179] [2019-11-19 20:07:57,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:07:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:07:57,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272014179] [2019-11-19 20:07:57,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71061573] [2019-11-19 20:07:57,263 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:07:57,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 20:07:57,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 20:07:57,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 20:07:57,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:07:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:07:57,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:07:57,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-19 20:07:57,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91477615] [2019-11-19 20:07:57,329 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:07:57,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:57,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2019-11-19 20:07:57,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:57,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970352909] [2019-11-19 20:07:57,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,353 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:07:57,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:07:57,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 20:07:57,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-19 20:07:57,408 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-11-19 20:07:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:07:57,438 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-11-19 20:07:57,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:07:57,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2019-11-19 20:07:57,444 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:57,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2019-11-19 20:07:57,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 20:07:57,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 20:07:57,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-11-19 20:07:57,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:07:57,447 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-19 20:07:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-11-19 20:07:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-19 20:07:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 20:07:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-11-19 20:07:57,454 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-19 20:07:57,454 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-19 20:07:57,455 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 20:07:57,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-11-19 20:07:57,455 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:57,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:07:57,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:07:57,457 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-19 20:07:57,457 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:07:57,458 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 399#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 395#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 396#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 397#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 398#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 400#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 407#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 406#L23-3 assume !(main_~i~1 < 5); 394#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 383#L9-3 [2019-11-19 20:07:57,458 INFO L796 eck$LassoCheckResult]: Loop: 383#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 384#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 393#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 388#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 383#L9-3 [2019-11-19 20:07:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-19 20:07:57,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:57,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819628913] [2019-11-19 20:07:57,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:07:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:07:57,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819628913] [2019-11-19 20:07:57,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739552889] [2019-11-19 20:07:57,529 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:07:57,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-19 20:07:57,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 20:07:57,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 20:07:57,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:07:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:07:57,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:07:57,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-19 20:07:57,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596602646] [2019-11-19 20:07:57,594 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:07:57,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:57,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2019-11-19 20:07:57,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:57,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420392598] [2019-11-19 20:07:57,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,616 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:07:57,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:07:57,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 20:07:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:07:57,658 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-19 20:07:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:07:57,681 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-11-19 20:07:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 20:07:57,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-11-19 20:07:57,684 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:57,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2019-11-19 20:07:57,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 20:07:57,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 20:07:57,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2019-11-19 20:07:57,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:07:57,686 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-11-19 20:07:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2019-11-19 20:07:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-19 20:07:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 20:07:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-19 20:07:57,689 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-19 20:07:57,689 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-19 20:07:57,689 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 20:07:57,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-11-19 20:07:57,690 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:57,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:07:57,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:07:57,691 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-19 20:07:57,691 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:07:57,691 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 497#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 498#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 507#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 506#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 505#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 504#L23-3 assume !(main_~i~1 < 5); 492#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 481#L9-3 [2019-11-19 20:07:57,691 INFO L796 eck$LassoCheckResult]: Loop: 481#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 482#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 491#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 486#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 481#L9-3 [2019-11-19 20:07:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-19 20:07:57,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:57,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803753795] [2019-11-19 20:07:57,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:07:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:07:57,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803753795] [2019-11-19 20:07:57,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333791379] [2019-11-19 20:07:57,755 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:07:57,797 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 20:07:57,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 20:07:57,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 20:07:57,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:07:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:07:57,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:07:57,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-19 20:07:57,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624709166] [2019-11-19 20:07:57,812 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:07:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2019-11-19 20:07:57,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:57,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586262052] [2019-11-19 20:07:57,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,825 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:07:57,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:07:57,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 20:07:57,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:07:57,883 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-11-19 20:07:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:07:57,919 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-19 20:07:57,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 20:07:57,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2019-11-19 20:07:57,921 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:57,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2019-11-19 20:07:57,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 20:07:57,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 20:07:57,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2019-11-19 20:07:57,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:07:57,923 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-19 20:07:57,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2019-11-19 20:07:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-19 20:07:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 20:07:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-19 20:07:57,926 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-19 20:07:57,926 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-19 20:07:57,926 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 20:07:57,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2019-11-19 20:07:57,927 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-19 20:07:57,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:07:57,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:07:57,928 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-19 20:07:57,928 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:07:57,928 INFO L794 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 605#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 601#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 602#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 603#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 604#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 617#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 616#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 615#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 614#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 613#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 612#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 611#L23-3 assume !(main_~i~1 < 5); 600#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 589#L9-3 [2019-11-19 20:07:57,929 INFO L796 eck$LassoCheckResult]: Loop: 589#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 590#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 599#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 594#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 589#L9-3 [2019-11-19 20:07:57,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:57,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-19 20:07:57,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:57,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674317723] [2019-11-19 20:07:57,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,959 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:07:57,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:57,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2019-11-19 20:07:57,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:57,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186765262] [2019-11-19 20:07:57,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:57,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:07:57,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:57,970 INFO L82 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2019-11-19 20:07:57,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:57,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917804020] [2019-11-19 20:07:57,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:58,057 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-11-19 20:07:58,694 WARN L191 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 102 [2019-11-19 20:07:58,793 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 20:07:58,793 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 20:07:58,794 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 20:07:58,794 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 20:07:58,794 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 20:07:58,794 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:58,794 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 20:07:58,795 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 20:07:58,795 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration7_Lasso [2019-11-19 20:07:58,795 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 20:07:58,795 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 20:07:58,799 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-19 20:07:58,806 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-19 20:07:58,808 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-19 20:07:58,810 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-19 20:07:58,811 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-19 20:07:58,813 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-19 20:07:58,815 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-19 20:07:58,817 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-19 20:07:58,818 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-19 20:07:58,820 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-19 20:07:58,822 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-19 20:07:58,824 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-19 20:07:58,826 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-19 20:07:58,827 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-19 20:07:58,830 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-19 20:07:58,832 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-19 20:07:58,834 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-19 20:07:58,835 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-19 20:07:58,837 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-19 20:07:58,963 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-19 20:07:58,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:07:58,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-19 20:07:58,969 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-19 20:07:58,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-19 20:07:59,256 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 20:07:59,257 INFO L489 LassoAnalysis]: Using template 'affine'. 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-19 20:07:59,266 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-19 20:07:59,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,269 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-19 20:07:59,277 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,286 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-19 20:07:59,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:07:59,295 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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,301 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-19 20:07:59,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,305 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:07:59,312 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,325 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-19 20:07:59,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:07:59,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 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,349 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-19 20:07:59,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:07:59,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:07:59,361 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-19 20:07:59,379 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-19 20:07:59,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,384 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:07:59,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-19 20:07:59,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,406 INFO L402 nArgumentSynthesizer]: A total of 0 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-19 20:07:59,408 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:07:59,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-19 20:07:59,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,441 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:07:59,460 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-19 20:07:59,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,468 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:07:59,488 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-19 20:07:59,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,494 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:07:59,503 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-19 20:07:59,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:07:59,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,517 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) [2019-11-19 20:07:59,525 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-19 20:07:59,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:07:59,541 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-19 20:07:59,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,546 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) [2019-11-19 20:07:59,556 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-19 20:07:59,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,561 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) [2019-11-19 20:07:59,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-19 20:07:59,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,572 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-19 20:07:59,581 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-19 20:07:59,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,586 INFO L402 nArgumentSynthesizer]: A total of 0 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-19 20:07:59,590 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-19 20:07:59,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-19 20:07:59,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,601 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-19 20:07:59,604 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-19 20:07:59,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-19 20:07:59,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:07:59,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:07:59,615 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-19 20:07:59,621 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-19 20:07:59,629 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-19 20:07:59,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,632 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-19 20:07:59,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:07:59,642 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-19 20:07:59,642 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-19 20:07:59,654 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-19 20:07:59,662 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-19 20:07:59,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:07:59,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:07:59,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:07:59,665 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-19 20:07:59,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:07:59,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:07:59,686 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 20:07:59,732 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2019-11-19 20:07:59,732 INFO L444 ModelExtractionUtils]: 6 out of 22 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 20:07:59,740 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:07:59,743 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 20:07:59,743 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 20:07:59,743 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 9 Supporting invariants [] [2019-11-19 20:07:59,755 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-19 20:07:59,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:07:59,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:07:59,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:07:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:07:59,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 20:07:59,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:07:59,838 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-19 20:07:59,839 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-19 20:07:59,839 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-19 20:07:59,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2019-11-19 20:07:59,862 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-19 20:07:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 20:07:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-11-19 20:07:59,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2019-11-19 20:07:59,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:07:59,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 4 letters. [2019-11-19 20:07:59,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:07:59,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 8 letters. [2019-11-19 20:07:59,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:07:59,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-11-19 20:07:59,866 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:07:59,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2019-11-19 20:07:59,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-19 20:07:59,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-19 20:07:59,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-11-19 20:07:59,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:07:59,871 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-19 20:07:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-11-19 20:07:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-19 20:07:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-19 20:07:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-19 20:07:59,874 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-19 20:07:59,875 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-19 20:07:59,875 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 20:07:59,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2019-11-19 20:07:59,876 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:07:59,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:07:59,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:07:59,878 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:07:59,878 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:07:59,878 INFO L794 eck$LassoCheckResult]: Stem: 771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 768#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 764#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 765#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 766#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 767#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 780#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 779#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 778#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 777#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 776#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 775#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 774#L23-3 assume !(main_~i~1 < 5); 763#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 751#L9-3 assume !(max_~i~0 < 5); 747#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 748#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 772#L9-8 [2019-11-19 20:07:59,879 INFO L796 eck$LassoCheckResult]: Loop: 772#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 758#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 749#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 750#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 772#L9-8 [2019-11-19 20:07:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2019-11-19 20:07:59,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:59,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842288935] [2019-11-19 20:07:59,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:07:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 20:07:59,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842288935] [2019-11-19 20:07:59,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:07:59,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:07:59,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866292149] [2019-11-19 20:07:59,914 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:07:59,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:07:59,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2019-11-19 20:07:59,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:07:59,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419124339] [2019-11-19 20:07:59,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:07:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:07:59,930 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:07:59,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:07:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:07:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 20:07:59,969 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-19 20:08:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:08:00,000 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-11-19 20:08:00,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:08:00,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2019-11-19 20:08:00,002 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:08:00,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2019-11-19 20:08:00,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-19 20:08:00,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-19 20:08:00,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2019-11-19 20:08:00,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:00,004 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-11-19 20:08:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2019-11-19 20:08:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-11-19 20:08:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-19 20:08:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-11-19 20:08:00,007 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-19 20:08:00,007 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-11-19 20:08:00,007 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 20:08:00,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2019-11-19 20:08:00,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:08:00,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:00,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:00,008 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:08:00,008 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:08:00,009 INFO L794 eck$LassoCheckResult]: Stem: 854#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 853#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 849#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 850#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 851#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 852#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 866#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 865#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 864#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 863#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 862#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 861#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 860#L23-3 assume !(main_~i~1 < 5); 848#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 836#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 837#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 847#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 842#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 838#L9-3 assume !(max_~i~0 < 5); 832#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 833#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 857#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 843#L10-3 [2019-11-19 20:08:00,009 INFO L796 eck$LassoCheckResult]: Loop: 843#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 834#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 835#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 858#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 843#L10-3 [2019-11-19 20:08:00,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:00,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2019-11-19 20:08:00,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:00,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144498559] [2019-11-19 20:08:00,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 20:08:00,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144498559] [2019-11-19 20:08:00,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262741548] [2019-11-19 20:08:00,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:08:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:00,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 20:08:00,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:00,127 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 20:08:00,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:08:00,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-19 20:08:00,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574922345] [2019-11-19 20:08:00,128 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:08:00,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:00,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2019-11-19 20:08:00,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:00,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559689809] [2019-11-19 20:08:00,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:00,151 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:00,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:08:00,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:08:00,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:08:00,218 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-11-19 20:08:00,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:08:00,285 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-11-19 20:08:00,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:08:00,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2019-11-19 20:08:00,286 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:08:00,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2019-11-19 20:08:00,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-19 20:08:00,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-19 20:08:00,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2019-11-19 20:08:00,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:00,288 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-11-19 20:08:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2019-11-19 20:08:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-11-19 20:08:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-19 20:08:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-11-19 20:08:00,295 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-19 20:08:00,295 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-19 20:08:00,295 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-19 20:08:00,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-11-19 20:08:00,296 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:08:00,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:00,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:00,298 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:08:00,298 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:08:00,299 INFO L794 eck$LassoCheckResult]: Stem: 1020#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1018#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1014#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1015#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1016#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1017#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1019#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1035#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1034#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1033#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1031#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1030#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1029#L23-3 assume !(main_~i~1 < 5); 1013#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 999#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1000#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1032#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1006#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1001#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1002#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1011#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1012#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1027#L9-3 assume !(max_~i~0 < 5); 995#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 996#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1024#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1037#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1036#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1025#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1023#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10-3 [2019-11-19 20:08:00,299 INFO L796 eck$LassoCheckResult]: Loop: 1007#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 997#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 998#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1028#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10-3 [2019-11-19 20:08:00,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:00,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1525547091, now seen corresponding path program 1 times [2019-11-19 20:08:00,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:00,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822770072] [2019-11-19 20:08:00,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 20:08:00,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822770072] [2019-11-19 20:08:00,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384993462] [2019-11-19 20:08:00,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:08:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:00,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 20:08:00,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 20:08:00,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:08:00,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-19 20:08:00,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492375257] [2019-11-19 20:08:00,426 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:08:00,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:00,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2019-11-19 20:08:00,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:00,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908794727] [2019-11-19 20:08:00,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:00,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:00,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:08:00,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 20:08:00,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-19 20:08:00,500 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-11-19 20:08:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:08:00,579 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2019-11-19 20:08:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:08:00,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2019-11-19 20:08:00,581 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:08:00,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. [2019-11-19 20:08:00,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-19 20:08:00,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-19 20:08:00,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2019-11-19 20:08:00,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:00,583 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-11-19 20:08:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2019-11-19 20:08:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-11-19 20:08:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-19 20:08:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-11-19 20:08:00,587 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-11-19 20:08:00,587 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-11-19 20:08:00,587 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-19 20:08:00,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2019-11-19 20:08:00,588 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:08:00,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:00,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:00,590 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:08:00,590 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:08:00,590 INFO L794 eck$LassoCheckResult]: Stem: 1230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1227#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1223#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1224#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1225#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1226#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1248#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1247#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1246#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1245#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1244#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1243#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1242#L23-3 assume !(main_~i~1 < 5); 1222#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1207#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1208#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1220#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1221#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1209#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1210#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1253#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1214#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1215#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1237#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1252#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1238#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1236#L9-3 assume !(max_~i~0 < 5); 1203#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1204#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1231#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1232#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1251#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1233#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1234#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1216#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1205#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1206#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1250#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1240#L10-3 [2019-11-19 20:08:00,590 INFO L796 eck$LassoCheckResult]: Loop: 1240#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1249#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1241#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1239#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1240#L10-3 [2019-11-19 20:08:00,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:00,591 INFO L82 PathProgramCache]: Analyzing trace with hash 452444531, now seen corresponding path program 2 times [2019-11-19 20:08:00,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:00,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101105060] [2019-11-19 20:08:00,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-19 20:08:00,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101105060] [2019-11-19 20:08:00,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872737844] [2019-11-19 20:08:00,643 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:08:00,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 20:08:00,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 20:08:00,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 20:08:00,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-19 20:08:00,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:08:00,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-19 20:08:00,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749448770] [2019-11-19 20:08:00,723 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:08:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2019-11-19 20:08:00,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:00,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600049933] [2019-11-19 20:08:00,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:00,735 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:00,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:08:00,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 20:08:00,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:08:00,808 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-11-19 20:08:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:08:00,933 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-11-19 20:08:00,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 20:08:00,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2019-11-19 20:08:00,935 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:08:00,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 100 transitions. [2019-11-19 20:08:00,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-11-19 20:08:00,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-11-19 20:08:00,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 100 transitions. [2019-11-19 20:08:00,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:00,937 INFO L688 BuchiCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-11-19 20:08:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 100 transitions. [2019-11-19 20:08:00,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-11-19 20:08:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-19 20:08:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-11-19 20:08:00,942 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-11-19 20:08:00,942 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-11-19 20:08:00,942 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-19 20:08:00,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2019-11-19 20:08:00,943 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:08:00,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:00,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:00,945 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:08:00,945 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:08:00,946 INFO L794 eck$LassoCheckResult]: Stem: 1481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1478#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1474#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1475#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1476#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1477#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1497#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1492#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1491#L23-3 assume !(main_~i~1 < 5); 1473#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1460#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1461#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1472#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1467#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1462#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1463#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1513#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1511#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1509#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1507#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1505#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1503#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1501#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1486#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1499#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1487#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1485#L9-3 assume !(max_~i~0 < 5); 1458#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1459#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1482#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1468#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1456#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1457#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1483#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1514#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1512#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1510#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1508#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1506#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1504#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1502#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1500#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1489#L10-3 [2019-11-19 20:08:00,946 INFO L796 eck$LassoCheckResult]: Loop: 1489#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1498#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1490#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1488#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1489#L10-3 [2019-11-19 20:08:00,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:00,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 3 times [2019-11-19 20:08:00,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:00,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039710870] [2019-11-19 20:08:00,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-19 20:08:01,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039710870] [2019-11-19 20:08:01,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402144476] [2019-11-19 20:08:01,053 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:08:01,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-19 20:08:01,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 20:08:01,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 20:08:01,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-19 20:08:01,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 20:08:01,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2019-11-19 20:08:01,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518495520] [2019-11-19 20:08:01,169 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 20:08:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2019-11-19 20:08:01,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:01,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154002043] [2019-11-19 20:08:01,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:01,181 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:01,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:08:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 20:08:01,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-19 20:08:01,245 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand 10 states. [2019-11-19 20:08:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:08:01,462 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2019-11-19 20:08:01,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 20:08:01,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2019-11-19 20:08:01,463 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:08:01,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2019-11-19 20:08:01,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-19 20:08:01,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-19 20:08:01,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2019-11-19 20:08:01,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:01,465 INFO L688 BuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2019-11-19 20:08:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2019-11-19 20:08:01,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-11-19 20:08:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-19 20:08:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-11-19 20:08:01,469 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-11-19 20:08:01,469 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-11-19 20:08:01,469 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-19 20:08:01,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2019-11-19 20:08:01,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-19 20:08:01,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:01,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:01,471 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:08:01,471 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 20:08:01,472 INFO L794 eck$LassoCheckResult]: Stem: 1783#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1780#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1776#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1777#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1778#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1779#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1805#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1803#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1801#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1799#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1797#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1795#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1794#L23-3 assume !(main_~i~1 < 5); 1775#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1761#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1762#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1823#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1822#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1763#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1764#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1774#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1768#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1769#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1821#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1820#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1819#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1818#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1817#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1815#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1813#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1811#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1788#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1808#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1789#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1787#L9-3 assume !(max_~i~0 < 5); 1757#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1758#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1784#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1770#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1759#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1760#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1785#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1816#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1814#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1812#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1810#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1809#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1807#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1806#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1804#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1802#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1800#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1798#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1796#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1791#L10-3 [2019-11-19 20:08:01,472 INFO L796 eck$LassoCheckResult]: Loop: 1791#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1793#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1792#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1790#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1791#L10-3 [2019-11-19 20:08:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:01,472 INFO L82 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 4 times [2019-11-19 20:08:01,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:01,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352098334] [2019-11-19 20:08:01,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:01,547 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:01,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:01,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2019-11-19 20:08:01,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:01,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549268393] [2019-11-19 20:08:01,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:01,559 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:01,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash -746698386, now seen corresponding path program 1 times [2019-11-19 20:08:01,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:01,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214323104] [2019-11-19 20:08:01,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-19 20:08:01,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214323104] [2019-11-19 20:08:01,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:08:01,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 20:08:01,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848299985] [2019-11-19 20:08:01,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:08:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 20:08:01,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-19 20:08:01,806 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. cyclomatic complexity: 20 Second operand 10 states. [2019-11-19 20:08:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:08:02,010 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2019-11-19 20:08:02,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 20:08:02,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 100 transitions. [2019-11-19 20:08:02,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 20:08:02,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2019-11-19 20:08:02,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-19 20:08:02,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-11-19 20:08:02,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2019-11-19 20:08:02,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:02,015 INFO L688 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-11-19 20:08:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2019-11-19 20:08:02,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-19 20:08:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-19 20:08:02,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-11-19 20:08:02,022 INFO L711 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-11-19 20:08:02,022 INFO L591 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-11-19 20:08:02,022 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-19 20:08:02,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2019-11-19 20:08:02,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-19 20:08:02,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 20:08:02,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 20:08:02,025 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:08:02,025 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-19 20:08:02,026 INFO L794 eck$LassoCheckResult]: Stem: 1953#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1952#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1948#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1949#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1950#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1951#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1973#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1970#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1967#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1964#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1962#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1960#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1959#L23-3 assume !(main_~i~1 < 5); 1947#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1939#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1940#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1946#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1941#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1942#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1996#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1995#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1993#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1991#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1989#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1987#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1985#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1983#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1981#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1979#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1977#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1975#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1972#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1969#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1966#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1958#L9-3 assume !(max_~i~0 < 5); 1935#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1936#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1956#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1943#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1937#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1938#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1957#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1994#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1992#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1990#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1988#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1986#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1984#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1982#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1980#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1978#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1976#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1974#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1971#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1968#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1965#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem1;havoc max_#t~mem2; 1963#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1961#L9-8 assume !(max_~i~0 < 5); 1954#L9-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1955#L12-1 main_#t~ret9 := max_#res;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 1944#L32-3 [2019-11-19 20:08:02,026 INFO L796 eck$LassoCheckResult]: Loop: 1944#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 1945#L32-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 1944#L32-3 [2019-11-19 20:08:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash -260352212, now seen corresponding path program 1 times [2019-11-19 20:08:02,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:02,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952468221] [2019-11-19 20:08:02,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:02,097 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:02,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:02,098 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2019-11-19 20:08:02,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:02,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126047044] [2019-11-19 20:08:02,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:02,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:02,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:02,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1090370322, now seen corresponding path program 1 times [2019-11-19 20:08:02,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:08:02,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570749127] [2019-11-19 20:08:02,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:08:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 20:08:02,170 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 20:08:05,216 WARN L191 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 401 DAG size of output: 286 [2019-11-19 20:08:05,913 WARN L191 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 114 [2019-11-19 20:08:05,916 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 20:08:05,916 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 20:08:05,917 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 20:08:05,917 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 20:08:05,917 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 20:08:05,917 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:05,917 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 20:08:05,917 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 20:08:05,917 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration14_Lasso [2019-11-19 20:08:05,917 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 20:08:05,918 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 20:08:05,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:05,930 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-19 20:08:05,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:06,315 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-11-19 20:08:06,385 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-19 20:08:06,388 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-19 20:08:06,390 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-19 20:08:06,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-19 20:08:06,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:06,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:06,398 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-19 20:08:06,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:06,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-19 20:08:06,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-19 20:08:06,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-19 20:08:06,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 20:08:06,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-19 20:08:06,411 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-19 20:08:06,413 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-19 20:08:06,414 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-19 20:08:06,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-19 20:08:06,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-19 20:08:06,827 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 20:08:06,828 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:06,837 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-19 20:08:06,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:06,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:06,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:06,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:06,840 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:06,846 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-19 20:08:06,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:06,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:06,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,848 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:06,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:06,850 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 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-19 20:08:06,857 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-19 20:08:06,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:06,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:06,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:06,866 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-19 20:08:06,878 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:06,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:06,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:06,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:06,890 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-19 20:08:06,895 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-19 20:08:06,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:06,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:06,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:06,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:06,899 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) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:06,905 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-19 20:08:06,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:06,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:06,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:06,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:06,908 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-19 20:08:06,914 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-19 20:08:06,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:06,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:06,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:06,928 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) [2019-11-19 20:08:06,934 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-19 20:08:06,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,936 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-19 20:08:06,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,940 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-19 20:08:06,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:06,949 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) [2019-11-19 20:08:06,958 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-19 20:08:06,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:06,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:06,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:06,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:06,962 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-19 20:08:06,968 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-19 20:08:06,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:06,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:06,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:06,977 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-19 20:08:06,982 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-19 20:08:06,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:06,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:06,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:06,987 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-19 20:08:06,993 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-19 20:08:06,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:06,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:06,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:06,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:06,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:06,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:07,005 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-19 20:08:07,010 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-19 20:08:07,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:07,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 20:08:07,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:07,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:07,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:07,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 20:08:07,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 20:08:07,013 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-19 20:08:07,019 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-19 20:08:07,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 20:08:07,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 20:08:07,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 20:08:07,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 20:08:07,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 20:08:07,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 20:08:07,049 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 20:08:07,085 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-19 20:08:07,085 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. 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) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 20:08:07,090 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 20:08:07,093 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 20:08:07,093 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 20:08:07,093 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2019-11-19 20:08:07,181 INFO L297 tatePredicateManager]: 25 out of 25 supporting invariants were superfluous and have been removed [2019-11-19 20:08:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:08:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:07,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:08:07,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:08:07,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 20:08:07,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:08:07,272 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-19 20:08:07,272 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-19 20:08:07,273 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-19 20:08:07,284 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 64 states and 76 transitions. Complement of second has 4 states. [2019-11-19 20:08:07,284 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-19 20:08:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-19 20:08:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2019-11-19 20:08:07,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 2 letters. [2019-11-19 20:08:07,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:07,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 62 letters. Loop has 2 letters. [2019-11-19 20:08:07,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:07,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 60 letters. Loop has 4 letters. [2019-11-19 20:08:07,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 20:08:07,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2019-11-19 20:08:07,288 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 20:08:07,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2019-11-19 20:08:07,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 20:08:07,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 20:08:07,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 20:08:07,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 20:08:07,289 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:08:07,289 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:08:07,289 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:08:07,289 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-19 20:08:07,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:08:07,289 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 20:08:07,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 20:08:07,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 08:08:07 BoogieIcfgContainer [2019-11-19 20:08:07,297 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 20:08:07,297 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:08:07,297 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:08:07,297 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:08:07,298 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:07:55" (3/4) ... [2019-11-19 20:08:07,302 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 20:08:07,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:08:07,304 INFO L168 Benchmark]: Toolchain (without parser) took 13214.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 322.4 MB). Free memory was 953.7 MB in the beginning and 903.1 MB in the end (delta: 50.5 MB). Peak memory consumption was 373.0 MB. Max. memory is 11.5 GB. [2019-11-19 20:08:07,304 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:08:07,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.20 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 942.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 20:08:07,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-19 20:08:07,306 INFO L168 Benchmark]: Boogie Preprocessor took 73.79 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-19 20:08:07,306 INFO L168 Benchmark]: RCFGBuilder took 482.05 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:08:07,307 INFO L168 Benchmark]: BuchiAutomizer took 12170.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 903.1 MB in the end (delta: 202.8 MB). Peak memory consumption was 383.6 MB. Max. memory is 11.5 GB. [2019-11-19 20:08:07,307 INFO L168 Benchmark]: Witness Printer took 5.13 ms. Allocated memory is still 1.4 GB. Free memory is still 903.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:08:07,310 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.20 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 942.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 146.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.79 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 482.05 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12170.54 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 903.1 MB in the end (delta: 202.8 MB). Peak memory consumption was 383.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.13 ms. Allocated memory is still 1.4 GB. Free memory is still 903.1 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.1s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 10.4s. Construction of modules took 0.6s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 85 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 343 SDtfs, 499 SDslu, 704 SDs, 0 SdLazy, 454 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital253 mio100 ax100 hnf99 lsp95 ukn49 mio100 lsp56 div100 bol100 ite100 ukn100 eq164 hnf86 smp99 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...