./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max05-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:24:40,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:24:40,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:24:40,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:24:40,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:24:40,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:24:40,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:24:40,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:24:40,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:24:40,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:24:40,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:24:40,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:24:40,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:24:40,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:24:40,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:24:40,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:24:40,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:24:40,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:24:40,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:24:40,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:24:40,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:24:40,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:24:40,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:24:40,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:24:40,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:24:40,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:24:40,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:24:40,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:24:40,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:24:40,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:24:40,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:24:40,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:24:40,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:24:40,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:24:40,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:24:40,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:24:40,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:24:40,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:24:40,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:24:40,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:24:40,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:24:40,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:24:40,704 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:24:40,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:24:40,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:24:40,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:24:40,706 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:24:40,706 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:24:40,707 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:24:40,707 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:24:40,707 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:24:40,707 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:24:40,707 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:24:40,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:24:40,708 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:24:40,708 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:24:40,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:24:40,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:24:40,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:24:40,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:24:40,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:24:40,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:24:40,710 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:24:40,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:24:40,710 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:24:40,710 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:24:40,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:24:40,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:24:40,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:24:40,711 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:24:40,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:24:40,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:24:40,712 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:24:40,712 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:24:40,713 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:24:40,713 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 [2020-07-29 03:24:41,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:24:41,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:24:41,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:24:41,064 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:24:41,064 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:24:41,065 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max05-1.i [2020-07-29 03:24:41,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97dffeebc/d67d06e61b78427bb176ee1f0a998d08/FLAG7eb1ef4e1 [2020-07-29 03:24:41,562 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:24:41,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max05-1.i [2020-07-29 03:24:41,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97dffeebc/d67d06e61b78427bb176ee1f0a998d08/FLAG7eb1ef4e1 [2020-07-29 03:24:41,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97dffeebc/d67d06e61b78427bb176ee1f0a998d08 [2020-07-29 03:24:41,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:24:41,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:24:41,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:24:41,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:24:41,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:24:41,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:24:41" (1/1) ... [2020-07-29 03:24:41,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f89cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:41, skipping insertion in model container [2020-07-29 03:24:41,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:24:41" (1/1) ... [2020-07-29 03:24:41,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:24:42,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:24:42,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:24:42,196 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:24:42,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:24:42,239 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:24:42,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42 WrapperNode [2020-07-29 03:24:42,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:24:42,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:24:42,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:24:42,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:24:42,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42" (1/1) ... [2020-07-29 03:24:42,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42" (1/1) ... [2020-07-29 03:24:42,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:24:42,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:24:42,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:24:42,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:24:42,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42" (1/1) ... [2020-07-29 03:24:42,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42" (1/1) ... [2020-07-29 03:24:42,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42" (1/1) ... [2020-07-29 03:24:42,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42" (1/1) ... [2020-07-29 03:24:42,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42" (1/1) ... [2020-07-29 03:24:42,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42" (1/1) ... [2020-07-29 03:24:42,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42" (1/1) ... [2020-07-29 03:24:42,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:24:42,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:24:42,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:24:42,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:24:42,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42" (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 [2020-07-29 03:24:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:24:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:24:42,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:24:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:24:42,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:24:42,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:24:43,029 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:24:43,030 INFO L295 CfgBuilder]: Removed 15 assume(true) statements. [2020-07-29 03:24:43,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:24:43 BoogieIcfgContainer [2020-07-29 03:24:43,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:24:43,034 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:24:43,035 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:24:43,038 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:24:43,039 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:24:43,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:24:41" (1/3) ... [2020-07-29 03:24:43,041 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5277cdef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:24:43, skipping insertion in model container [2020-07-29 03:24:43,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:24:43,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:24:42" (2/3) ... [2020-07-29 03:24:43,041 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5277cdef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:24:43, skipping insertion in model container [2020-07-29 03:24:43,042 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:24:43,042 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:24:43" (3/3) ... [2020-07-29 03:24:43,043 INFO L371 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2020-07-29 03:24:43,096 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:24:43,097 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:24:43,097 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:24:43,097 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:24:43,097 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:24:43,097 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:24:43,097 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:24:43,098 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:24:43,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-07-29 03:24:43,145 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-07-29 03:24:43,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:43,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:43,153 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:24:43,153 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:24:43,153 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:24:43,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-07-29 03:24:43,159 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-07-29 03:24:43,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:43,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:43,160 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:24:43,160 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:24:43,169 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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 [2020-07-29 03:24:43,169 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 [2020-07-29 03:24:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 03:24:43,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:43,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986787564] [2020-07-29 03:24:43,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:43,291 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:43,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:43,346 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:43,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:43,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-07-29 03:24:43,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:43,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281174912] [2020-07-29 03:24:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:43,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:43,382 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:43,385 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-07-29 03:24:43,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:43,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741890473] [2020-07-29 03:24:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:43,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:43,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:43,423 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:43,680 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:24:43,680 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:24:43,681 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:24:43,681 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:24:43,681 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:24:43,681 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:43,681 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:24:43,681 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:24:43,682 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2020-07-29 03:24:43,682 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:24:43,682 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:24:43,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:43,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:44,397 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:24:44,402 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 [2020-07-29 03:24:44,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:24:44,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:44,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:44,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:44,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:44,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:44,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:44,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:44,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:44,447 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 [2020-07-29 03:24:44,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:44,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:44,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:44,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:44,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:24:44,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:24:44,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:24:44,502 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:44,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:44,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:44,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:44,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:44,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:24:44,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:24:44,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:24:44,550 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 [2020-07-29 03:24:44,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:44,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:44,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:44,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:44,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:44,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:44,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:44,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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 [2020-07-29 03:24:44,582 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 [2020-07-29 03:24:44,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:44,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:44,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:44,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:44,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:24:44,591 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:24:44,597 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 [2020-07-29 03:24:44,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:24:44,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:44,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:44,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:44,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:44,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:44,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:44,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:44,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:44,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 [2020-07-29 03:24:44,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:44,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:44,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:44,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:44,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:24:44,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:24:44,696 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:24:44,859 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-07-29 03:24:44,859 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 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) [2020-07-29 03:24:44,865 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 [2020-07-29 03:24:44,869 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:24:44,870 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:24:44,871 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 [] [2020-07-29 03:24:44,910 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 03:24:44,915 INFO L393 LassoCheck]: Loop: "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;" "main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4;" [2020-07-29 03:24:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:44,931 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:24:44,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:44,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:24:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:44,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:44,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {41#unseeded} is VALID [2020-07-29 03:24:44,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#unseeded} 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; {41#unseeded} is VALID [2020-07-29 03:24:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:44,998 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:24:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:45,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:45,063 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#(>= oldRank0 (+ (* (- 8) ULTIMATE.start_main_~i~1) (* 9 (select |#length| |ULTIMATE.start_main_~#x~0.base|))))} 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; {67#(and (<= (* 9 (select |#length| |ULTIMATE.start_main_~#x~0.base|)) (+ oldRank0 (* 8 ULTIMATE.start_main_~i~1))) (< ULTIMATE.start_main_~i~1 5) (<= 4 (select |#length| |ULTIMATE.start_main_~#x~0.base|)))} is VALID [2020-07-29 03:24:45,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#(and (<= (* 9 (select |#length| |ULTIMATE.start_main_~#x~0.base|)) (+ oldRank0 (* 8 ULTIMATE.start_main_~i~1))) (< ULTIMATE.start_main_~i~1 5) (<= 4 (select |#length| |ULTIMATE.start_main_~#x~0.base|)))} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {59#(or (and (> oldRank0 (+ (* (- 8) ULTIMATE.start_main_~i~1) (* 9 (select |#length| |ULTIMATE.start_main_~#x~0.base|)))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:24:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:45,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:24:45,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:45,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:24:45,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,101 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 [2020-07-29 03:24:45,103 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2020-07-29 03:24:45,480 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 84 states and 119 transitions. Complement of second has 8 states. [2020-07-29 03:24:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:24:45,481 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:24:45,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-07-29 03:24:45,485 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-07-29 03:24:45,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:45,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:45,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:24:45,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:24:45,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:45,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:45,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 119 transitions. [2020-07-29 03:24:45,501 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:45,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:45,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:45,504 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states. [2020-07-29 03:24:45,508 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2020-07-29 03:24:45,516 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 03:24:45,516 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:24:45,527 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:24:45,527 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:24:45,527 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 84 states and 119 transitions. cyclomatic complexity: 48 [2020-07-29 03:24:45,534 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 03:24:45,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:24:45,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:24:45,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:24:45,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:45,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:45,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:45,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:45,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:45,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:45,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 84 letters. Loop has 84 letters. [2020-07-29 03:24:45,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 84 letters. [2020-07-29 03:24:45,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 84 letters. Loop has 84 letters. [2020-07-29 03:24:45,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:24:45,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:24:45,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:24:45,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:24:45,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:24:45,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:24:45,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:45,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:45,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:45,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:24:45,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:24:45,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:24:45,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:24:45,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:24:45,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:24:45,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:24:45,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:24:45,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:24:45,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:24:45,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:24:45,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:24:45,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:24:45,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:24:45,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:24:45,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:24:45,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:24:45,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:24:45,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:24:45,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:24:45,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:24:45,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:24:45,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:24:45,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:24:45,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:45,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:45,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:45,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:24:45,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:24:45,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:24:45,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:24:45,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:24:45,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:24:45,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:24:45,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:24:45,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:24:45,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:24:45,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:24:45,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:24:45,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:24:45,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:24:45,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:24:45,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:45,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:45,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:45,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:45,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:45,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:45,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:24:45,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:24:45,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:24:45,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:24:45,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:24:45,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:24:45,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:24:45,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:24:45,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:24:45,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:24:45,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:24:45,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:24:45,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:24:45,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:24:45,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:24:45,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:24:45,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:24:45,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:24:45,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:24:45,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:24:45,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:24:45,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:24:45,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:24:45,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:24:45,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:24:45,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:24:45,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:24:45,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:24:45,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:24:45,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:24:45,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:45,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:45,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:45,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 119 transitions. cyclomatic complexity: 48 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:24:45,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,610 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:24:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:24:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2020-07-29 03:24:45,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:24:45,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:24:45,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:24:45,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:45,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. cyclomatic complexity: 48 [2020-07-29 03:24:45,628 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:45,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2020-07-29 03:24:45,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-29 03:24:45,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-29 03:24:45,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2020-07-29 03:24:45,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:45,637 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 03:24:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2020-07-29 03:24:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-29 03:24:45,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:45,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 33 transitions. Second operand 25 states. [2020-07-29 03:24:45,663 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 33 transitions. Second operand 25 states. [2020-07-29 03:24:45,680 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 25 states. [2020-07-29 03:24:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:45,710 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-07-29 03:24:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2020-07-29 03:24:45,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:45,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:45,716 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states and 33 transitions. [2020-07-29 03:24:45,717 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states and 33 transitions. [2020-07-29 03:24:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:45,719 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-07-29 03:24:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2020-07-29 03:24:45,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:45,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:45,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:45,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 03:24:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-07-29 03:24:45,722 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 03:24:45,722 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 03:24:45,722 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:24:45,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-07-29 03:24:45,723 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:45,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:45,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:45,724 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:24:45,724 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:45,724 INFO L794 eck$LassoCheckResult]: Stem: 186#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 185#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; 182#L23-3 assume !(main_~i~1 < 5); 181#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; 170#L9-3 [2020-07-29 03:24:45,725 INFO L796 eck$LassoCheckResult]: Loop: 170#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 171#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; 180#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 175#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 170#L9-3 [2020-07-29 03:24:45,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:45,726 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-07-29 03:24:45,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:45,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538422251] [2020-07-29 03:24:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:45,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {244#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {244#true} is VALID [2020-07-29 03:24:45,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {244#true} 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; {246#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:24:45,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {246#(= 0 ULTIMATE.start_main_~i~1)} assume !(main_~i~1 < 5); {245#false} is VALID [2020-07-29 03:24:45,785 INFO L280 TraceCheckUtils]: 3: Hoare triple {245#false} 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; {245#false} is VALID [2020-07-29 03:24:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:45,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538422251] [2020-07-29 03:24:45,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:24:45,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:24:45,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527289696] [2020-07-29 03:24:45,790 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:24:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:45,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2020-07-29 03:24:45,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:45,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314742812] [2020-07-29 03:24:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:45,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:45,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:45,808 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:45,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:45,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:24:45,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:24:45,878 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 03:24:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:45,958 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-29 03:24:45,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:24:45,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:24:45,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:45,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2020-07-29 03:24:45,968 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:45,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2020-07-29 03:24:45,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-29 03:24:45,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-29 03:24:45,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-07-29 03:24:45,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:45,970 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 03:24:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-07-29 03:24:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-29 03:24:45,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:45,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 33 transitions. Second operand 25 states. [2020-07-29 03:24:45,972 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 33 transitions. Second operand 25 states. [2020-07-29 03:24:45,972 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 25 states. [2020-07-29 03:24:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:45,974 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-29 03:24:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:24:45,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:45,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:45,974 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states and 33 transitions. [2020-07-29 03:24:45,974 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states and 33 transitions. [2020-07-29 03:24:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:45,976 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-29 03:24:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:24:45,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:45,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:45,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:45,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 03:24:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-07-29 03:24:45,978 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-07-29 03:24:45,979 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-07-29 03:24:45,979 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:24:45,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2020-07-29 03:24:45,979 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:45,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:45,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:45,980 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:24:45,980 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:45,980 INFO L794 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 294#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; 291#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; 292#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 293#L23-3 assume !(main_~i~1 < 5); 290#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; 279#L9-3 [2020-07-29 03:24:45,980 INFO L796 eck$LassoCheckResult]: Loop: 279#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 280#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; 289#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 284#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 279#L9-3 [2020-07-29 03:24:45,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:45,981 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-07-29 03:24:45,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:45,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467182432] [2020-07-29 03:24:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:46,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {355#true} is VALID [2020-07-29 03:24:46,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {355#true} 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; {357#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:24:46,050 INFO L280 TraceCheckUtils]: 2: Hoare triple {357#(= 0 ULTIMATE.start_main_~i~1)} 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; {357#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:24:46,051 INFO L280 TraceCheckUtils]: 3: Hoare triple {357#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {358#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:46,053 INFO L280 TraceCheckUtils]: 4: Hoare triple {358#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < 5); {356#false} is VALID [2020-07-29 03:24:46,053 INFO L280 TraceCheckUtils]: 5: Hoare triple {356#false} 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; {356#false} is VALID [2020-07-29 03:24:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:46,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467182432] [2020-07-29 03:24:46,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875233718] [2020-07-29 03:24:46,054 INFO L95 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 [2020-07-29 03:24:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:46,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 03:24:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:46,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:46,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {355#true} is VALID [2020-07-29 03:24:46,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {355#true} 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; {365#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:24:46,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {365#(<= ULTIMATE.start_main_~i~1 0)} 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; {365#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:24:46,207 INFO L280 TraceCheckUtils]: 3: Hoare triple {365#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {358#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:46,208 INFO L280 TraceCheckUtils]: 4: Hoare triple {358#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < 5); {356#false} is VALID [2020-07-29 03:24:46,208 INFO L280 TraceCheckUtils]: 5: Hoare triple {356#false} 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; {356#false} is VALID [2020-07-29 03:24:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:46,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:24:46,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-29 03:24:46,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792984449] [2020-07-29 03:24:46,210 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:24:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:46,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2020-07-29 03:24:46,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:46,211 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403268743] [2020-07-29 03:24:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:46,223 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:46,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:46,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:46,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:46,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:24:46,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:24:46,312 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-29 03:24:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:46,430 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-29 03:24:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:24:46,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:24:46,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:46,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2020-07-29 03:24:46,445 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:46,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2020-07-29 03:24:46,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-29 03:24:46,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-29 03:24:46,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2020-07-29 03:24:46,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:46,447 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-29 03:24:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2020-07-29 03:24:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-29 03:24:46,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:46,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 35 transitions. Second operand 27 states. [2020-07-29 03:24:46,452 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 35 transitions. Second operand 27 states. [2020-07-29 03:24:46,452 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 27 states. [2020-07-29 03:24:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:46,454 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-29 03:24:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-29 03:24:46,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:46,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:46,455 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states and 35 transitions. [2020-07-29 03:24:46,455 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states and 35 transitions. [2020-07-29 03:24:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:46,459 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-29 03:24:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-29 03:24:46,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:46,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:46,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:46,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 03:24:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-07-29 03:24:46,464 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-29 03:24:46,464 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-29 03:24:46,465 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:24:46,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2020-07-29 03:24:46,465 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:46,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:46,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:46,466 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-07-29 03:24:46,466 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:46,468 INFO L794 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 425#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; 421#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; 422#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 423#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; 424#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 431#L23-3 assume !(main_~i~1 < 5); 420#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; 409#L9-3 [2020-07-29 03:24:46,468 INFO L796 eck$LassoCheckResult]: Loop: 409#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 410#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; 419#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 414#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 409#L9-3 [2020-07-29 03:24:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:46,469 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-07-29 03:24:46,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:46,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178582819] [2020-07-29 03:24:46,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:46,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {491#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {491#true} is VALID [2020-07-29 03:24:46,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {491#true} 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#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:24:46,556 INFO L280 TraceCheckUtils]: 2: Hoare triple {493#(= 0 ULTIMATE.start_main_~i~1)} 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; {493#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:24:46,557 INFO L280 TraceCheckUtils]: 3: Hoare triple {493#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {494#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:46,558 INFO L280 TraceCheckUtils]: 4: Hoare triple {494#(<= ULTIMATE.start_main_~i~1 1)} 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#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:46,559 INFO L280 TraceCheckUtils]: 5: Hoare triple {494#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {495#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:24:46,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {495#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < 5); {492#false} is VALID [2020-07-29 03:24:46,561 INFO L280 TraceCheckUtils]: 7: Hoare triple {492#false} 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; {492#false} is VALID [2020-07-29 03:24:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:46,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178582819] [2020-07-29 03:24:46,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109148787] [2020-07-29 03:24:46,562 INFO L93 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 [2020-07-29 03:24:46,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:24:46,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:24:46,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:24:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:46,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:46,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {491#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {491#true} is VALID [2020-07-29 03:24:46,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {491#true} 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; {502#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:24:46,684 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#(<= ULTIMATE.start_main_~i~1 0)} 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; {502#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:24:46,685 INFO L280 TraceCheckUtils]: 3: Hoare triple {502#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {494#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:46,685 INFO L280 TraceCheckUtils]: 4: Hoare triple {494#(<= ULTIMATE.start_main_~i~1 1)} 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#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:46,687 INFO L280 TraceCheckUtils]: 5: Hoare triple {494#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {495#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:24:46,687 INFO L280 TraceCheckUtils]: 6: Hoare triple {495#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < 5); {492#false} is VALID [2020-07-29 03:24:46,688 INFO L280 TraceCheckUtils]: 7: Hoare triple {492#false} 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; {492#false} is VALID [2020-07-29 03:24:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:46,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:24:46,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-29 03:24:46,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011154794] [2020-07-29 03:24:46,689 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:24:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:46,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2020-07-29 03:24:46,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:46,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970836557] [2020-07-29 03:24:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:46,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:46,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:46,703 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:46,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:46,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 03:24:46,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 03:24:46,758 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2020-07-29 03:24:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:46,888 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-29 03:24:46,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:24:46,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:24:46,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:46,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2020-07-29 03:24:46,911 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:46,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2020-07-29 03:24:46,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-29 03:24:46,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-29 03:24:46,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2020-07-29 03:24:46,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:46,914 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-29 03:24:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2020-07-29 03:24:46,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-29 03:24:46,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:46,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 37 transitions. Second operand 29 states. [2020-07-29 03:24:46,918 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 37 transitions. Second operand 29 states. [2020-07-29 03:24:46,918 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 29 states. [2020-07-29 03:24:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:46,921 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-29 03:24:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-29 03:24:46,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:46,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:46,922 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states and 37 transitions. [2020-07-29 03:24:46,923 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states and 37 transitions. [2020-07-29 03:24:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:46,925 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2020-07-29 03:24:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-29 03:24:46,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:46,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:46,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:46,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 03:24:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-07-29 03:24:46,927 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-07-29 03:24:46,927 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-07-29 03:24:46,928 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:24:46,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-07-29 03:24:46,928 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:46,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:46,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:46,929 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-07-29 03:24:46,929 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:46,930 INFO L794 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 570#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; 566#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; 567#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 568#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; 569#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 571#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; 578#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 577#L23-3 assume !(main_~i~1 < 5); 565#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; 554#L9-3 [2020-07-29 03:24:46,930 INFO L796 eck$LassoCheckResult]: Loop: 554#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 555#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; 564#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 559#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 554#L9-3 [2020-07-29 03:24:46,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:46,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-07-29 03:24:46,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:46,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130575860] [2020-07-29 03:24:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:46,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {642#true} is VALID [2020-07-29 03:24:46,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#true} 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; {644#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:24:46,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {644#(= 0 ULTIMATE.start_main_~i~1)} 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; {644#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:24:46,988 INFO L280 TraceCheckUtils]: 3: Hoare triple {644#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {645#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:46,988 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#(<= ULTIMATE.start_main_~i~1 1)} 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; {645#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:46,989 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {646#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:24:46,990 INFO L280 TraceCheckUtils]: 6: Hoare triple {646#(<= ULTIMATE.start_main_~i~1 2)} 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; {646#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:24:46,991 INFO L280 TraceCheckUtils]: 7: Hoare triple {646#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {647#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:24:46,992 INFO L280 TraceCheckUtils]: 8: Hoare triple {647#(<= ULTIMATE.start_main_~i~1 3)} assume !(main_~i~1 < 5); {643#false} is VALID [2020-07-29 03:24:46,992 INFO L280 TraceCheckUtils]: 9: Hoare triple {643#false} 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; {643#false} is VALID [2020-07-29 03:24:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:46,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130575860] [2020-07-29 03:24:46,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102505106] [2020-07-29 03:24:46,994 INFO L93 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 [2020-07-29 03:24:47,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-29 03:24:47,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:24:47,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:24:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:47,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:47,195 INFO L280 TraceCheckUtils]: 0: Hoare triple {642#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {642#true} is VALID [2020-07-29 03:24:47,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {642#true} 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; {654#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:24:47,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {654#(<= ULTIMATE.start_main_~i~1 0)} 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; {654#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:24:47,198 INFO L280 TraceCheckUtils]: 3: Hoare triple {654#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {645#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:47,199 INFO L280 TraceCheckUtils]: 4: Hoare triple {645#(<= ULTIMATE.start_main_~i~1 1)} 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; {645#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:47,200 INFO L280 TraceCheckUtils]: 5: Hoare triple {645#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {646#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:24:47,204 INFO L280 TraceCheckUtils]: 6: Hoare triple {646#(<= ULTIMATE.start_main_~i~1 2)} 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; {646#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:24:47,205 INFO L280 TraceCheckUtils]: 7: Hoare triple {646#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {647#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:24:47,205 INFO L280 TraceCheckUtils]: 8: Hoare triple {647#(<= ULTIMATE.start_main_~i~1 3)} assume !(main_~i~1 < 5); {643#false} is VALID [2020-07-29 03:24:47,206 INFO L280 TraceCheckUtils]: 9: Hoare triple {643#false} 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; {643#false} is VALID [2020-07-29 03:24:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:47,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:24:47,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 03:24:47,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130193952] [2020-07-29 03:24:47,207 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:24:47,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:47,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2020-07-29 03:24:47,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:47,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330237847] [2020-07-29 03:24:47,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:47,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:47,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:47,217 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:47,220 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:47,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:47,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:24:47,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:24:47,297 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-07-29 03:24:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:47,469 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-07-29 03:24:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:24:47,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:24:47,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:47,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2020-07-29 03:24:47,489 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:47,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2020-07-29 03:24:47,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-29 03:24:47,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-29 03:24:47,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2020-07-29 03:24:47,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:47,492 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-29 03:24:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2020-07-29 03:24:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-29 03:24:47,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:47,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 39 transitions. Second operand 31 states. [2020-07-29 03:24:47,495 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 39 transitions. Second operand 31 states. [2020-07-29 03:24:47,496 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 31 states. [2020-07-29 03:24:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:47,498 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-07-29 03:24:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-29 03:24:47,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:47,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:47,499 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states and 39 transitions. [2020-07-29 03:24:47,500 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states and 39 transitions. [2020-07-29 03:24:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:47,504 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2020-07-29 03:24:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-29 03:24:47,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:47,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:47,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:47,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 03:24:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-07-29 03:24:47,512 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-07-29 03:24:47,512 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-07-29 03:24:47,512 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:24:47,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2020-07-29 03:24:47,513 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:47,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:47,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:47,515 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-07-29 03:24:47,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:47,515 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 730#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; 726#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; 727#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 728#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; 729#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 731#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; 740#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 739#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; 738#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 737#L23-3 assume !(main_~i~1 < 5); 725#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; 714#L9-3 [2020-07-29 03:24:47,516 INFO L796 eck$LassoCheckResult]: Loop: 714#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 715#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; 724#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 719#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 714#L9-3 [2020-07-29 03:24:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-07-29 03:24:47,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:47,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755246191] [2020-07-29 03:24:47,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:47,639 INFO L280 TraceCheckUtils]: 0: Hoare triple {808#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {808#true} is VALID [2020-07-29 03:24:47,640 INFO L280 TraceCheckUtils]: 1: Hoare triple {808#true} 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; {810#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:24:47,641 INFO L280 TraceCheckUtils]: 2: Hoare triple {810#(= 0 ULTIMATE.start_main_~i~1)} 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; {810#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:24:47,642 INFO L280 TraceCheckUtils]: 3: Hoare triple {810#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {811#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:47,643 INFO L280 TraceCheckUtils]: 4: Hoare triple {811#(<= ULTIMATE.start_main_~i~1 1)} 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; {811#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:47,644 INFO L280 TraceCheckUtils]: 5: Hoare triple {811#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {812#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:24:47,645 INFO L280 TraceCheckUtils]: 6: Hoare triple {812#(<= ULTIMATE.start_main_~i~1 2)} 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; {812#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:24:47,646 INFO L280 TraceCheckUtils]: 7: Hoare triple {812#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {813#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:24:47,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {813#(<= ULTIMATE.start_main_~i~1 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; {813#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:24:47,648 INFO L280 TraceCheckUtils]: 9: Hoare triple {813#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {814#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:24:47,649 INFO L280 TraceCheckUtils]: 10: Hoare triple {814#(<= ULTIMATE.start_main_~i~1 4)} assume !(main_~i~1 < 5); {809#false} is VALID [2020-07-29 03:24:47,650 INFO L280 TraceCheckUtils]: 11: Hoare triple {809#false} 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; {809#false} is VALID [2020-07-29 03:24:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:47,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755246191] [2020-07-29 03:24:47,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009799194] [2020-07-29 03:24:47,651 INFO L93 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 [2020-07-29 03:24:47,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 03:24:47,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:24:47,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:24:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:47,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:47,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {808#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {808#true} is VALID [2020-07-29 03:24:47,864 INFO L280 TraceCheckUtils]: 1: Hoare triple {808#true} 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; {821#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:24:47,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#(<= ULTIMATE.start_main_~i~1 0)} 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; {821#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:24:47,866 INFO L280 TraceCheckUtils]: 3: Hoare triple {821#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {811#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:47,867 INFO L280 TraceCheckUtils]: 4: Hoare triple {811#(<= ULTIMATE.start_main_~i~1 1)} 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; {811#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:24:47,868 INFO L280 TraceCheckUtils]: 5: Hoare triple {811#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {812#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:24:47,868 INFO L280 TraceCheckUtils]: 6: Hoare triple {812#(<= ULTIMATE.start_main_~i~1 2)} 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; {812#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:24:47,869 INFO L280 TraceCheckUtils]: 7: Hoare triple {812#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {813#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:24:47,870 INFO L280 TraceCheckUtils]: 8: Hoare triple {813#(<= ULTIMATE.start_main_~i~1 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; {813#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-29 03:24:47,871 INFO L280 TraceCheckUtils]: 9: Hoare triple {813#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {814#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-29 03:24:47,872 INFO L280 TraceCheckUtils]: 10: Hoare triple {814#(<= ULTIMATE.start_main_~i~1 4)} assume !(main_~i~1 < 5); {809#false} is VALID [2020-07-29 03:24:47,872 INFO L280 TraceCheckUtils]: 11: Hoare triple {809#false} 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; {809#false} is VALID [2020-07-29 03:24:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:47,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:24:47,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 03:24:47,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231184638] [2020-07-29 03:24:47,874 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:24:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:47,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2020-07-29 03:24:47,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:47,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257923208] [2020-07-29 03:24:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:47,879 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:47,882 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:47,884 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:47,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:47,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 03:24:47,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-29 03:24:47,937 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2020-07-29 03:24:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:48,095 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-29 03:24:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:24:48,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:24:48,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:48,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2020-07-29 03:24:48,124 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:48,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2020-07-29 03:24:48,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-07-29 03:24:48,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-29 03:24:48,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2020-07-29 03:24:48,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:48,127 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-07-29 03:24:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2020-07-29 03:24:48,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-29 03:24:48,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:48,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 40 transitions. Second operand 33 states. [2020-07-29 03:24:48,130 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 40 transitions. Second operand 33 states. [2020-07-29 03:24:48,130 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 33 states. [2020-07-29 03:24:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:48,132 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-29 03:24:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2020-07-29 03:24:48,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:48,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:48,133 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states and 40 transitions. [2020-07-29 03:24:48,133 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states and 40 transitions. [2020-07-29 03:24:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:48,134 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-29 03:24:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2020-07-29 03:24:48,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:48,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:48,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:48,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:24:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-07-29 03:24:48,137 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-07-29 03:24:48,138 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-07-29 03:24:48,138 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:24:48,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-07-29 03:24:48,138 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-07-29 03:24:48,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:48,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:48,139 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-07-29 03:24:48,140 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:48,140 INFO L794 eck$LassoCheckResult]: Stem: 905#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 904#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; 900#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; 901#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 902#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; 903#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 916#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; 915#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 914#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; 913#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 912#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; 911#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 910#L23-3 assume !(main_~i~1 < 5); 899#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; 888#L9-3 [2020-07-29 03:24:48,140 INFO L796 eck$LassoCheckResult]: Loop: 888#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 889#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; 898#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 893#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 888#L9-3 [2020-07-29 03:24:48,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-07-29 03:24:48,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:48,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315148995] [2020-07-29 03:24:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:48,158 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:48,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:48,188 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:48,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2020-07-29 03:24:48,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:48,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257196405] [2020-07-29 03:24:48,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:48,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:48,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:48,208 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:48,209 INFO L82 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2020-07-29 03:24:48,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:48,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613896933] [2020-07-29 03:24:48,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:48,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:48,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:48,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:49,115 WARN L193 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 104 [2020-07-29 03:24:49,340 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-07-29 03:24:49,343 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:24:49,343 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:24:49,343 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:24:49,343 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:24:49,343 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:24:49,343 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:49,343 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:24:49,343 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:24:49,343 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration7_Lasso [2020-07-29 03:24:49,344 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:24:49,344 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:24:49,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,581 WARN L257 bleTransFormulaUtils]: 5 quantified variables [2020-07-29 03:24:49,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:49,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:24:50,255 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:24:50,256 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:24:50,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,263 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 [2020-07-29 03:24:50,291 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 [2020-07-29 03:24:50,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,301 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 [2020-07-29 03:24:50,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 [2020-07-29 03:24:50,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,328 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 [2020-07-29 03:24:50,353 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 [2020-07-29 03:24:50,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,357 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 [2020-07-29 03:24:50,381 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 [2020-07-29 03:24:50,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:24:50,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:24:50,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,411 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 [2020-07-29 03:24:50,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,415 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,440 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 [2020-07-29 03:24:50,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,445 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,473 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 [2020-07-29 03:24:50,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,479 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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,502 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 [2020-07-29 03:24:50,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,507 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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,531 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 [2020-07-29 03:24:50,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,535 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) [2020-07-29 03:24:50,564 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:24:50,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:24:50,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,602 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 [2020-07-29 03:24:50,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,632 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 [2020-07-29 03:24:50,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,634 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,661 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 [2020-07-29 03:24:50,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,690 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 [2020-07-29 03:24:50,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,694 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,716 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 [2020-07-29 03:24:50,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,721 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,744 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 [2020-07-29 03:24:50,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:24:50,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:24:50,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:24:50,748 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) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,771 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 [2020-07-29 03:24:50,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:24:50,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:24:50,781 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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,803 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 [2020-07-29 03:24:50,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:24:50,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:24:50,816 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) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,839 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 [2020-07-29 03:24:50,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:24:50,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:24:50,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:24:50,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:24:50,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:24:50,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:24:50,860 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:24:50,901 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 03:24:50,901 INFO L444 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:24:50,903 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:24:50,905 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:24:50,905 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:24:50,905 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0) = -2*ULTIMATE.start_max_~i~0 + 9 Supporting invariants [] [2020-07-29 03:24:50,937 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 03:24:50,941 INFO L393 LassoCheck]: Loop: "assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);" "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;" "max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1;" "max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0;" [2020-07-29 03:24:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:50,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:50,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:24:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:50,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:51,008 INFO L280 TraceCheckUtils]: 0: Hoare triple {992#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {992#unseeded} is VALID [2020-07-29 03:24:51,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#unseeded} 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; {992#unseeded} is VALID [2020-07-29 03:24:51,010 INFO L280 TraceCheckUtils]: 2: Hoare triple {992#unseeded} 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; {992#unseeded} is VALID [2020-07-29 03:24:51,011 INFO L280 TraceCheckUtils]: 3: Hoare triple {992#unseeded} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {992#unseeded} is VALID [2020-07-29 03:24:51,011 INFO L280 TraceCheckUtils]: 4: Hoare triple {992#unseeded} 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; {992#unseeded} is VALID [2020-07-29 03:24:51,012 INFO L280 TraceCheckUtils]: 5: Hoare triple {992#unseeded} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {992#unseeded} is VALID [2020-07-29 03:24:51,012 INFO L280 TraceCheckUtils]: 6: Hoare triple {992#unseeded} 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; {992#unseeded} is VALID [2020-07-29 03:24:51,013 INFO L280 TraceCheckUtils]: 7: Hoare triple {992#unseeded} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {992#unseeded} is VALID [2020-07-29 03:24:51,014 INFO L280 TraceCheckUtils]: 8: Hoare triple {992#unseeded} 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; {992#unseeded} is VALID [2020-07-29 03:24:51,014 INFO L280 TraceCheckUtils]: 9: Hoare triple {992#unseeded} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {992#unseeded} is VALID [2020-07-29 03:24:51,015 INFO L280 TraceCheckUtils]: 10: Hoare triple {992#unseeded} 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; {992#unseeded} is VALID [2020-07-29 03:24:51,016 INFO L280 TraceCheckUtils]: 11: Hoare triple {992#unseeded} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {992#unseeded} is VALID [2020-07-29 03:24:51,017 INFO L280 TraceCheckUtils]: 12: Hoare triple {992#unseeded} assume !(main_~i~1 < 5); {992#unseeded} is VALID [2020-07-29 03:24:51,017 INFO L280 TraceCheckUtils]: 13: Hoare triple {992#unseeded} 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; {992#unseeded} is VALID [2020-07-29 03:24:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:51,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:24:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:51,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:51,051 INFO L280 TraceCheckUtils]: 0: Hoare triple {995#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_max_~i~0) 9))} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1064#(and (<= 9 (+ oldRank0 (* 2 ULTIMATE.start_max_~i~0))) (< ULTIMATE.start_max_~i~0 5))} is VALID [2020-07-29 03:24:51,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {1064#(and (<= 9 (+ oldRank0 (* 2 ULTIMATE.start_max_~i~0))) (< ULTIMATE.start_max_~i~0 5))} 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; {1064#(and (<= 9 (+ oldRank0 (* 2 ULTIMATE.start_max_~i~0))) (< ULTIMATE.start_max_~i~0 5))} is VALID [2020-07-29 03:24:51,053 INFO L280 TraceCheckUtils]: 2: Hoare triple {1064#(and (<= 9 (+ oldRank0 (* 2 ULTIMATE.start_max_~i~0))) (< ULTIMATE.start_max_~i~0 5))} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {1064#(and (<= 9 (+ oldRank0 (* 2 ULTIMATE.start_max_~i~0))) (< ULTIMATE.start_max_~i~0 5))} is VALID [2020-07-29 03:24:51,054 INFO L280 TraceCheckUtils]: 3: Hoare triple {1064#(and (<= 9 (+ oldRank0 (* 2 ULTIMATE.start_max_~i~0))) (< ULTIMATE.start_max_~i~0 5))} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {1020#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_max_~i~0) 9)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:24:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:24:51,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:24:51,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:51,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:51,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,063 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 [2020-07-29 03:24:51,064 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-07-29 03:24:51,128 INFO L75 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. [2020-07-29 03:24:51,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:24:51,128 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:24:51,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. cyclomatic complexity: 12 [2020-07-29 03:24:51,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:51,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:51,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:24:51,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:24:51,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:51,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:51,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2020-07-29 03:24:51,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:51,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:51,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:51,131 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 40 transitions. cyclomatic complexity: 12 [2020-07-29 03:24:51,135 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 03:24:51,135 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:24:51,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:24:51,136 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:24:51,136 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 50 transitions. cyclomatic complexity: 16 [2020-07-29 03:24:51,138 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 03:24:51,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:51,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:51,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:51,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:51,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:51,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:51,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 39 letters. Loop has 39 letters. [2020-07-29 03:24:51,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 39 letters. [2020-07-29 03:24:51,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 39 letters. Loop has 39 letters. [2020-07-29 03:24:51,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 33 letters. Loop has 33 letters. [2020-07-29 03:24:51,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 03:24:51,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 33 letters. Loop has 33 letters. [2020-07-29 03:24:51,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:51,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:51,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:24:51,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:24:51,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:24:51,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:24:51,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 22 letters. Loop has 4 letters. [2020-07-29 03:24:51,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 4 letters. [2020-07-29 03:24:51,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 4 letters. [2020-07-29 03:24:51,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:24:51,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:24:51,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:24:51,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 4 letters. [2020-07-29 03:24:51,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 4 letters. [2020-07-29 03:24:51,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 24 letters. Loop has 4 letters. [2020-07-29 03:24:51,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:24:51,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:24:51,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:24:51,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:24:51,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:24:51,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:24:51,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:24:51,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:24:51,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:24:51,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:24:51,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:24:51,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:24:51,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:24:51,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:24:51,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:24:51,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:24:51,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:24:51,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:24:51,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:51,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:51,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:51,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:24:51,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:24:51,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:24:51,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:51,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:51,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:24:51,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:24:51,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:24:51,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:24:51,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 4 letters. [2020-07-29 03:24:51,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 4 letters. [2020-07-29 03:24:51,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 24 letters. Loop has 4 letters. [2020-07-29 03:24:51,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:24:51,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:24:51,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 25 letters. Loop has 4 letters. [2020-07-29 03:24:51,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 22 letters. Loop has 4 letters. [2020-07-29 03:24:51,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 4 letters. [2020-07-29 03:24:51,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 4 letters. [2020-07-29 03:24:51,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:24:51,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:24:51,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:24:51,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:24:51,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:24:51,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:24:51,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:24:51,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:24:51,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:24:51,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:24:51,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:24:51,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:24:51,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:24:51,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 40 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:24:51,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:24:51,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 50 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:24:51,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,163 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:24:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:24:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 03:24:51,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:24:51,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:24:51,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:24:51,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:24:51,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. cyclomatic complexity: 16 [2020-07-29 03:24:51,166 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:51,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2020-07-29 03:24:51,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-29 03:24:51,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 03:24:51,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2020-07-29 03:24:51,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:51,168 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-07-29 03:24:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2020-07-29 03:24:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-29 03:24:51,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:51,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 42 transitions. Second operand 34 states. [2020-07-29 03:24:51,171 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 42 transitions. Second operand 34 states. [2020-07-29 03:24:51,171 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 34 states. [2020-07-29 03:24:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:51,172 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-29 03:24:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-29 03:24:51,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:51,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:51,173 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states and 42 transitions. [2020-07-29 03:24:51,173 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states and 42 transitions. [2020-07-29 03:24:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:51,174 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-07-29 03:24:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2020-07-29 03:24:51,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:51,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:51,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:51,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 03:24:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2020-07-29 03:24:51,176 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-07-29 03:24:51,176 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2020-07-29 03:24:51,176 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:24:51,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2020-07-29 03:24:51,177 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:51,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:51,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:51,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:24:51,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:51,178 INFO L794 eck$LassoCheckResult]: Stem: 1147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1144#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; 1140#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; 1141#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1142#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; 1143#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1156#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; 1155#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1154#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; 1153#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1152#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; 1151#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1150#L23-3 assume !(main_~i~1 < 5); 1139#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; 1127#L9-3 assume !(max_~i~0 < 5); 1123#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1124#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; 1148#L9-8 [2020-07-29 03:24:51,178 INFO L796 eck$LassoCheckResult]: Loop: 1148#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1134#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; 1125#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1126#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1148#L9-8 [2020-07-29 03:24:51,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:51,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2020-07-29 03:24:51,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:51,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147253158] [2020-07-29 03:24:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:51,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {1228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1228#true} is VALID [2020-07-29 03:24:51,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {1228#true} 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; {1228#true} is VALID [2020-07-29 03:24:51,221 INFO L280 TraceCheckUtils]: 2: Hoare triple {1228#true} 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; {1228#true} is VALID [2020-07-29 03:24:51,221 INFO L280 TraceCheckUtils]: 3: Hoare triple {1228#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1228#true} is VALID [2020-07-29 03:24:51,221 INFO L280 TraceCheckUtils]: 4: Hoare triple {1228#true} 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; {1228#true} is VALID [2020-07-29 03:24:51,222 INFO L280 TraceCheckUtils]: 5: Hoare triple {1228#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1228#true} is VALID [2020-07-29 03:24:51,222 INFO L280 TraceCheckUtils]: 6: Hoare triple {1228#true} 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; {1228#true} is VALID [2020-07-29 03:24:51,222 INFO L280 TraceCheckUtils]: 7: Hoare triple {1228#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1228#true} is VALID [2020-07-29 03:24:51,222 INFO L280 TraceCheckUtils]: 8: Hoare triple {1228#true} 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; {1228#true} is VALID [2020-07-29 03:24:51,223 INFO L280 TraceCheckUtils]: 9: Hoare triple {1228#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1228#true} is VALID [2020-07-29 03:24:51,223 INFO L280 TraceCheckUtils]: 10: Hoare triple {1228#true} 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; {1228#true} is VALID [2020-07-29 03:24:51,223 INFO L280 TraceCheckUtils]: 11: Hoare triple {1228#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1228#true} is VALID [2020-07-29 03:24:51,223 INFO L280 TraceCheckUtils]: 12: Hoare triple {1228#true} assume !(main_~i~1 < 5); {1228#true} is VALID [2020-07-29 03:24:51,224 INFO L280 TraceCheckUtils]: 13: Hoare triple {1228#true} 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; {1230#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:51,225 INFO L280 TraceCheckUtils]: 14: Hoare triple {1230#(= ULTIMATE.start_max_~i~0 0)} assume !(max_~i~0 < 5); {1229#false} is VALID [2020-07-29 03:24:51,225 INFO L280 TraceCheckUtils]: 15: Hoare triple {1229#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {1229#false} is VALID [2020-07-29 03:24:51,225 INFO L280 TraceCheckUtils]: 16: Hoare triple {1229#false} 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; {1229#false} is VALID [2020-07-29 03:24:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-29 03:24:51,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147253158] [2020-07-29 03:24:51,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:24:51,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:24:51,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912154058] [2020-07-29 03:24:51,227 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:24:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:51,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2020-07-29 03:24:51,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:51,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146980233] [2020-07-29 03:24:51,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:51,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:51,234 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:51,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:51,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:51,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:24:51,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:24:51,290 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-07-29 03:24:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:51,375 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-07-29 03:24:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:24:51,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:24:51,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:51,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2020-07-29 03:24:51,392 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:51,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2020-07-29 03:24:51,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-07-29 03:24:51,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-07-29 03:24:51,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2020-07-29 03:24:51,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:51,394 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2020-07-29 03:24:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2020-07-29 03:24:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2020-07-29 03:24:51,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:51,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states and 55 transitions. Second operand 35 states. [2020-07-29 03:24:51,396 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states and 55 transitions. Second operand 35 states. [2020-07-29 03:24:51,397 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 35 states. [2020-07-29 03:24:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:51,398 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-07-29 03:24:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2020-07-29 03:24:51,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:51,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:51,399 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 45 states and 55 transitions. [2020-07-29 03:24:51,399 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 45 states and 55 transitions. [2020-07-29 03:24:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:51,400 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-07-29 03:24:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2020-07-29 03:24:51,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:51,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:51,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:51,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 03:24:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2020-07-29 03:24:51,402 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-07-29 03:24:51,402 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-07-29 03:24:51,402 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:24:51,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2020-07-29 03:24:51,403 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:51,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:51,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:51,403 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:24:51,404 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:51,404 INFO L794 eck$LassoCheckResult]: Stem: 1300#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1299#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; 1295#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; 1296#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1297#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; 1298#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1312#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; 1311#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1310#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; 1309#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1308#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; 1307#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1306#L23-3 assume !(main_~i~1 < 5); 1294#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; 1282#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1283#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1293#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1288#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1284#L9-3 assume !(max_~i~0 < 5); 1278#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1279#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; 1303#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1289#L10-3 [2020-07-29 03:24:51,404 INFO L796 eck$LassoCheckResult]: Loop: 1289#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; 1280#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1281#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1304#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1289#L10-3 [2020-07-29 03:24:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:51,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2020-07-29 03:24:51,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:51,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018042612] [2020-07-29 03:24:51,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:51,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {1406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1406#true} is VALID [2020-07-29 03:24:51,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,469 INFO L280 TraceCheckUtils]: 3: Hoare triple {1406#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1406#true} is VALID [2020-07-29 03:24:51,470 INFO L280 TraceCheckUtils]: 4: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,470 INFO L280 TraceCheckUtils]: 5: Hoare triple {1406#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1406#true} is VALID [2020-07-29 03:24:51,470 INFO L280 TraceCheckUtils]: 6: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,470 INFO L280 TraceCheckUtils]: 7: Hoare triple {1406#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1406#true} is VALID [2020-07-29 03:24:51,471 INFO L280 TraceCheckUtils]: 8: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,471 INFO L280 TraceCheckUtils]: 9: Hoare triple {1406#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1406#true} is VALID [2020-07-29 03:24:51,471 INFO L280 TraceCheckUtils]: 10: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,471 INFO L280 TraceCheckUtils]: 11: Hoare triple {1406#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1406#true} is VALID [2020-07-29 03:24:51,472 INFO L280 TraceCheckUtils]: 12: Hoare triple {1406#true} assume !(main_~i~1 < 5); {1406#true} is VALID [2020-07-29 03:24:51,488 INFO L280 TraceCheckUtils]: 13: Hoare triple {1406#true} 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; {1408#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:51,488 INFO L280 TraceCheckUtils]: 14: Hoare triple {1408#(= ULTIMATE.start_max_~i~0 0)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1408#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:51,489 INFO L280 TraceCheckUtils]: 15: Hoare triple {1408#(= ULTIMATE.start_max_~i~0 0)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {1408#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:51,490 INFO L280 TraceCheckUtils]: 16: Hoare triple {1408#(= ULTIMATE.start_max_~i~0 0)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {1408#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:51,490 INFO L280 TraceCheckUtils]: 17: Hoare triple {1408#(= ULTIMATE.start_max_~i~0 0)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {1409#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:51,491 INFO L280 TraceCheckUtils]: 18: Hoare triple {1409#(<= ULTIMATE.start_max_~i~0 1)} assume !(max_~i~0 < 5); {1407#false} is VALID [2020-07-29 03:24:51,491 INFO L280 TraceCheckUtils]: 19: Hoare triple {1407#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {1407#false} is VALID [2020-07-29 03:24:51,491 INFO L280 TraceCheckUtils]: 20: Hoare triple {1407#false} 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; {1407#false} is VALID [2020-07-29 03:24:51,492 INFO L280 TraceCheckUtils]: 21: Hoare triple {1407#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1407#false} is VALID [2020-07-29 03:24:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-29 03:24:51,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018042612] [2020-07-29 03:24:51,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766526517] [2020-07-29 03:24:51,493 INFO L95 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 [2020-07-29 03:24:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:51,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 03:24:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:51,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:51,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {1406#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1406#true} is VALID [2020-07-29 03:24:51,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,627 INFO L280 TraceCheckUtils]: 2: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,627 INFO L280 TraceCheckUtils]: 3: Hoare triple {1406#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1406#true} is VALID [2020-07-29 03:24:51,627 INFO L280 TraceCheckUtils]: 4: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,627 INFO L280 TraceCheckUtils]: 5: Hoare triple {1406#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1406#true} is VALID [2020-07-29 03:24:51,628 INFO L280 TraceCheckUtils]: 6: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,628 INFO L280 TraceCheckUtils]: 7: Hoare triple {1406#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1406#true} is VALID [2020-07-29 03:24:51,628 INFO L280 TraceCheckUtils]: 8: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,628 INFO L280 TraceCheckUtils]: 9: Hoare triple {1406#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1406#true} is VALID [2020-07-29 03:24:51,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {1406#true} 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; {1406#true} is VALID [2020-07-29 03:24:51,629 INFO L280 TraceCheckUtils]: 11: Hoare triple {1406#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1406#true} is VALID [2020-07-29 03:24:51,629 INFO L280 TraceCheckUtils]: 12: Hoare triple {1406#true} assume !(main_~i~1 < 5); {1406#true} is VALID [2020-07-29 03:24:51,630 INFO L280 TraceCheckUtils]: 13: Hoare triple {1406#true} 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; {1452#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:51,631 INFO L280 TraceCheckUtils]: 14: Hoare triple {1452#(<= ULTIMATE.start_max_~i~0 0)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1452#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:51,631 INFO L280 TraceCheckUtils]: 15: Hoare triple {1452#(<= ULTIMATE.start_max_~i~0 0)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {1452#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:51,632 INFO L280 TraceCheckUtils]: 16: Hoare triple {1452#(<= ULTIMATE.start_max_~i~0 0)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {1452#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:51,633 INFO L280 TraceCheckUtils]: 17: Hoare triple {1452#(<= ULTIMATE.start_max_~i~0 0)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {1409#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:51,634 INFO L280 TraceCheckUtils]: 18: Hoare triple {1409#(<= ULTIMATE.start_max_~i~0 1)} assume !(max_~i~0 < 5); {1407#false} is VALID [2020-07-29 03:24:51,634 INFO L280 TraceCheckUtils]: 19: Hoare triple {1407#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {1407#false} is VALID [2020-07-29 03:24:51,634 INFO L280 TraceCheckUtils]: 20: Hoare triple {1407#false} 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; {1407#false} is VALID [2020-07-29 03:24:51,635 INFO L280 TraceCheckUtils]: 21: Hoare triple {1407#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1407#false} is VALID [2020-07-29 03:24:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-29 03:24:51,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:24:51,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-29 03:24:51,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893520596] [2020-07-29 03:24:51,637 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:24:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2020-07-29 03:24:51,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:51,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285695770] [2020-07-29 03:24:51,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:51,644 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:51,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:51,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:51,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:51,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:24:51,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:24:51,738 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-29 03:24:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:51,936 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2020-07-29 03:24:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:24:51,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:24:51,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:51,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2020-07-29 03:24:51,981 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:51,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2020-07-29 03:24:51,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-07-29 03:24:51,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-07-29 03:24:51,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2020-07-29 03:24:51,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:51,984 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2020-07-29 03:24:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2020-07-29 03:24:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2020-07-29 03:24:51,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:51,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states and 70 transitions. Second operand 43 states. [2020-07-29 03:24:51,987 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states and 70 transitions. Second operand 43 states. [2020-07-29 03:24:51,987 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 43 states. [2020-07-29 03:24:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:51,989 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2020-07-29 03:24:51,989 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2020-07-29 03:24:51,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:51,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:51,989 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 57 states and 70 transitions. [2020-07-29 03:24:51,989 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 57 states and 70 transitions. [2020-07-29 03:24:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:51,991 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2020-07-29 03:24:51,991 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2020-07-29 03:24:51,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:51,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:51,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:51,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 03:24:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2020-07-29 03:24:51,993 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-07-29 03:24:51,993 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-07-29 03:24:51,993 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 03:24:51,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2020-07-29 03:24:51,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:51,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:51,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:51,994 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:24:51,994 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:51,995 INFO L794 eck$LassoCheckResult]: Stem: 1558#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1556#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; 1552#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; 1553#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1554#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; 1555#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1557#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; 1573#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1572#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; 1571#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1569#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; 1568#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1567#L23-3 assume !(main_~i~1 < 5); 1551#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; 1537#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1538#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1570#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1544#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1539#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1540#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1549#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1550#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1565#L9-3 assume !(max_~i~0 < 5); 1533#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1534#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; 1562#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1575#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1574#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1563#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1561#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1545#L10-3 [2020-07-29 03:24:51,995 INFO L796 eck$LassoCheckResult]: Loop: 1545#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; 1535#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1536#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1566#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1545#L10-3 [2020-07-29 03:24:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:51,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1525547091, now seen corresponding path program 1 times [2020-07-29 03:24:51,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:51,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037784515] [2020-07-29 03:24:51,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:52,060 INFO L280 TraceCheckUtils]: 0: Hoare triple {1693#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1693#true} is VALID [2020-07-29 03:24:52,060 INFO L280 TraceCheckUtils]: 1: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,060 INFO L280 TraceCheckUtils]: 2: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,060 INFO L280 TraceCheckUtils]: 3: Hoare triple {1693#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1693#true} is VALID [2020-07-29 03:24:52,061 INFO L280 TraceCheckUtils]: 4: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,061 INFO L280 TraceCheckUtils]: 5: Hoare triple {1693#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1693#true} is VALID [2020-07-29 03:24:52,061 INFO L280 TraceCheckUtils]: 6: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,061 INFO L280 TraceCheckUtils]: 7: Hoare triple {1693#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1693#true} is VALID [2020-07-29 03:24:52,062 INFO L280 TraceCheckUtils]: 8: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,062 INFO L280 TraceCheckUtils]: 9: Hoare triple {1693#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1693#true} is VALID [2020-07-29 03:24:52,062 INFO L280 TraceCheckUtils]: 10: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,062 INFO L280 TraceCheckUtils]: 11: Hoare triple {1693#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1693#true} is VALID [2020-07-29 03:24:52,063 INFO L280 TraceCheckUtils]: 12: Hoare triple {1693#true} assume !(main_~i~1 < 5); {1693#true} is VALID [2020-07-29 03:24:52,063 INFO L280 TraceCheckUtils]: 13: Hoare triple {1693#true} 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; {1695#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,064 INFO L280 TraceCheckUtils]: 14: Hoare triple {1695#(= ULTIMATE.start_max_~i~0 0)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1695#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,065 INFO L280 TraceCheckUtils]: 15: Hoare triple {1695#(= ULTIMATE.start_max_~i~0 0)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {1695#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,065 INFO L280 TraceCheckUtils]: 16: Hoare triple {1695#(= ULTIMATE.start_max_~i~0 0)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {1695#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,066 INFO L280 TraceCheckUtils]: 17: Hoare triple {1695#(= ULTIMATE.start_max_~i~0 0)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {1696#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,066 INFO L280 TraceCheckUtils]: 18: Hoare triple {1696#(<= ULTIMATE.start_max_~i~0 1)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1696#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,067 INFO L280 TraceCheckUtils]: 19: Hoare triple {1696#(<= ULTIMATE.start_max_~i~0 1)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {1696#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,068 INFO L280 TraceCheckUtils]: 20: Hoare triple {1696#(<= ULTIMATE.start_max_~i~0 1)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {1696#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,069 INFO L280 TraceCheckUtils]: 21: Hoare triple {1696#(<= ULTIMATE.start_max_~i~0 1)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {1697#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:52,069 INFO L280 TraceCheckUtils]: 22: Hoare triple {1697#(<= ULTIMATE.start_max_~i~0 2)} assume !(max_~i~0 < 5); {1694#false} is VALID [2020-07-29 03:24:52,070 INFO L280 TraceCheckUtils]: 23: Hoare triple {1694#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {1694#false} is VALID [2020-07-29 03:24:52,070 INFO L280 TraceCheckUtils]: 24: Hoare triple {1694#false} 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; {1694#false} is VALID [2020-07-29 03:24:52,070 INFO L280 TraceCheckUtils]: 25: Hoare triple {1694#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1694#false} is VALID [2020-07-29 03:24:52,070 INFO L280 TraceCheckUtils]: 26: Hoare triple {1694#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {1694#false} is VALID [2020-07-29 03:24:52,071 INFO L280 TraceCheckUtils]: 27: Hoare triple {1694#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {1694#false} is VALID [2020-07-29 03:24:52,071 INFO L280 TraceCheckUtils]: 28: Hoare triple {1694#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {1694#false} is VALID [2020-07-29 03:24:52,071 INFO L280 TraceCheckUtils]: 29: Hoare triple {1694#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1694#false} is VALID [2020-07-29 03:24:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-29 03:24:52,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037784515] [2020-07-29 03:24:52,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206939425] [2020-07-29 03:24:52,074 INFO L95 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 [2020-07-29 03:24:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:52,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:24:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:52,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:52,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {1693#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1693#true} is VALID [2020-07-29 03:24:52,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,294 INFO L280 TraceCheckUtils]: 2: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,295 INFO L280 TraceCheckUtils]: 3: Hoare triple {1693#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1693#true} is VALID [2020-07-29 03:24:52,295 INFO L280 TraceCheckUtils]: 4: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,295 INFO L280 TraceCheckUtils]: 5: Hoare triple {1693#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1693#true} is VALID [2020-07-29 03:24:52,295 INFO L280 TraceCheckUtils]: 6: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,296 INFO L280 TraceCheckUtils]: 7: Hoare triple {1693#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1693#true} is VALID [2020-07-29 03:24:52,296 INFO L280 TraceCheckUtils]: 8: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,296 INFO L280 TraceCheckUtils]: 9: Hoare triple {1693#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1693#true} is VALID [2020-07-29 03:24:52,296 INFO L280 TraceCheckUtils]: 10: Hoare triple {1693#true} 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; {1693#true} is VALID [2020-07-29 03:24:52,296 INFO L280 TraceCheckUtils]: 11: Hoare triple {1693#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {1693#true} is VALID [2020-07-29 03:24:52,296 INFO L280 TraceCheckUtils]: 12: Hoare triple {1693#true} assume !(main_~i~1 < 5); {1693#true} is VALID [2020-07-29 03:24:52,300 INFO L280 TraceCheckUtils]: 13: Hoare triple {1693#true} 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; {1740#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,301 INFO L280 TraceCheckUtils]: 14: Hoare triple {1740#(<= ULTIMATE.start_max_~i~0 0)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1740#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,301 INFO L280 TraceCheckUtils]: 15: Hoare triple {1740#(<= ULTIMATE.start_max_~i~0 0)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {1740#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,302 INFO L280 TraceCheckUtils]: 16: Hoare triple {1740#(<= ULTIMATE.start_max_~i~0 0)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {1740#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,303 INFO L280 TraceCheckUtils]: 17: Hoare triple {1740#(<= ULTIMATE.start_max_~i~0 0)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {1696#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,306 INFO L280 TraceCheckUtils]: 18: Hoare triple {1696#(<= ULTIMATE.start_max_~i~0 1)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1696#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,310 INFO L280 TraceCheckUtils]: 19: Hoare triple {1696#(<= ULTIMATE.start_max_~i~0 1)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {1696#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,311 INFO L280 TraceCheckUtils]: 20: Hoare triple {1696#(<= ULTIMATE.start_max_~i~0 1)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {1696#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,311 INFO L280 TraceCheckUtils]: 21: Hoare triple {1696#(<= ULTIMATE.start_max_~i~0 1)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {1697#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:52,312 INFO L280 TraceCheckUtils]: 22: Hoare triple {1697#(<= ULTIMATE.start_max_~i~0 2)} assume !(max_~i~0 < 5); {1694#false} is VALID [2020-07-29 03:24:52,312 INFO L280 TraceCheckUtils]: 23: Hoare triple {1694#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {1694#false} is VALID [2020-07-29 03:24:52,312 INFO L280 TraceCheckUtils]: 24: Hoare triple {1694#false} 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; {1694#false} is VALID [2020-07-29 03:24:52,313 INFO L280 TraceCheckUtils]: 25: Hoare triple {1694#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1694#false} is VALID [2020-07-29 03:24:52,313 INFO L280 TraceCheckUtils]: 26: Hoare triple {1694#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {1694#false} is VALID [2020-07-29 03:24:52,313 INFO L280 TraceCheckUtils]: 27: Hoare triple {1694#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {1694#false} is VALID [2020-07-29 03:24:52,313 INFO L280 TraceCheckUtils]: 28: Hoare triple {1694#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {1694#false} is VALID [2020-07-29 03:24:52,313 INFO L280 TraceCheckUtils]: 29: Hoare triple {1694#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {1694#false} is VALID [2020-07-29 03:24:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-29 03:24:52,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:24:52,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-29 03:24:52,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119534117] [2020-07-29 03:24:52,317 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:24:52,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:52,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2020-07-29 03:24:52,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:52,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711204901] [2020-07-29 03:24:52,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:52,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:52,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:52,338 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:52,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 03:24:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 03:24:52,424 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-07-29 03:24:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:52,614 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2020-07-29 03:24:52,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:24:52,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:24:52,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:52,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2020-07-29 03:24:52,656 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:52,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. [2020-07-29 03:24:52,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2020-07-29 03:24:52,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-07-29 03:24:52,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2020-07-29 03:24:52,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:52,659 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2020-07-29 03:24:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2020-07-29 03:24:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2020-07-29 03:24:52,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:52,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states and 85 transitions. Second operand 51 states. [2020-07-29 03:24:52,662 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states and 85 transitions. Second operand 51 states. [2020-07-29 03:24:52,662 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 51 states. [2020-07-29 03:24:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:52,664 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2020-07-29 03:24:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2020-07-29 03:24:52,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:52,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:52,664 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 69 states and 85 transitions. [2020-07-29 03:24:52,665 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 69 states and 85 transitions. [2020-07-29 03:24:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:52,666 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2020-07-29 03:24:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2020-07-29 03:24:52,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:52,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:52,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:52,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-29 03:24:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2020-07-29 03:24:52,668 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2020-07-29 03:24:52,668 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2020-07-29 03:24:52,668 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 03:24:52,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2020-07-29 03:24:52,669 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:52,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:52,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:52,670 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:24:52,670 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:52,670 INFO L794 eck$LassoCheckResult]: Stem: 1884#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1881#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; 1877#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; 1878#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1879#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; 1880#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1902#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; 1901#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1900#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; 1899#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1898#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; 1897#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1896#L23-3 assume !(main_~i~1 < 5); 1876#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; 1861#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1862#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1874#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1875#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1863#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1864#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1907#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1868#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1869#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1891#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1906#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1892#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1890#L9-3 assume !(max_~i~0 < 5); 1857#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1858#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; 1885#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1886#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1905#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1887#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1888#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1870#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1859#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1860#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1904#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1894#L10-3 [2020-07-29 03:24:52,670 INFO L796 eck$LassoCheckResult]: Loop: 1894#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; 1903#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 1895#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1893#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1894#L10-3 [2020-07-29 03:24:52,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:52,670 INFO L82 PathProgramCache]: Analyzing trace with hash 452444531, now seen corresponding path program 2 times [2020-07-29 03:24:52,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:52,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248914396] [2020-07-29 03:24:52,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:52,741 INFO L280 TraceCheckUtils]: 0: Hoare triple {2049#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2049#true} is VALID [2020-07-29 03:24:52,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,742 INFO L280 TraceCheckUtils]: 2: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,742 INFO L280 TraceCheckUtils]: 3: Hoare triple {2049#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2049#true} is VALID [2020-07-29 03:24:52,742 INFO L280 TraceCheckUtils]: 4: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,742 INFO L280 TraceCheckUtils]: 5: Hoare triple {2049#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2049#true} is VALID [2020-07-29 03:24:52,742 INFO L280 TraceCheckUtils]: 6: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,743 INFO L280 TraceCheckUtils]: 7: Hoare triple {2049#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2049#true} is VALID [2020-07-29 03:24:52,743 INFO L280 TraceCheckUtils]: 8: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,743 INFO L280 TraceCheckUtils]: 9: Hoare triple {2049#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2049#true} is VALID [2020-07-29 03:24:52,743 INFO L280 TraceCheckUtils]: 10: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,743 INFO L280 TraceCheckUtils]: 11: Hoare triple {2049#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2049#true} is VALID [2020-07-29 03:24:52,744 INFO L280 TraceCheckUtils]: 12: Hoare triple {2049#true} assume !(main_~i~1 < 5); {2049#true} is VALID [2020-07-29 03:24:52,744 INFO L280 TraceCheckUtils]: 13: Hoare triple {2049#true} 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; {2051#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,745 INFO L280 TraceCheckUtils]: 14: Hoare triple {2051#(= ULTIMATE.start_max_~i~0 0)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2051#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,745 INFO L280 TraceCheckUtils]: 15: Hoare triple {2051#(= ULTIMATE.start_max_~i~0 0)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2051#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,746 INFO L280 TraceCheckUtils]: 16: Hoare triple {2051#(= ULTIMATE.start_max_~i~0 0)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2051#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,746 INFO L280 TraceCheckUtils]: 17: Hoare triple {2051#(= ULTIMATE.start_max_~i~0 0)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2052#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,747 INFO L280 TraceCheckUtils]: 18: Hoare triple {2052#(<= ULTIMATE.start_max_~i~0 1)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2052#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,747 INFO L280 TraceCheckUtils]: 19: Hoare triple {2052#(<= ULTIMATE.start_max_~i~0 1)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2052#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,748 INFO L280 TraceCheckUtils]: 20: Hoare triple {2052#(<= ULTIMATE.start_max_~i~0 1)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2052#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,749 INFO L280 TraceCheckUtils]: 21: Hoare triple {2052#(<= ULTIMATE.start_max_~i~0 1)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2053#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:52,749 INFO L280 TraceCheckUtils]: 22: Hoare triple {2053#(<= ULTIMATE.start_max_~i~0 2)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2053#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:52,750 INFO L280 TraceCheckUtils]: 23: Hoare triple {2053#(<= ULTIMATE.start_max_~i~0 2)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2053#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:52,750 INFO L280 TraceCheckUtils]: 24: Hoare triple {2053#(<= ULTIMATE.start_max_~i~0 2)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2053#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:52,751 INFO L280 TraceCheckUtils]: 25: Hoare triple {2053#(<= ULTIMATE.start_max_~i~0 2)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2054#(<= ULTIMATE.start_max_~i~0 3)} is VALID [2020-07-29 03:24:52,752 INFO L280 TraceCheckUtils]: 26: Hoare triple {2054#(<= ULTIMATE.start_max_~i~0 3)} assume !(max_~i~0 < 5); {2050#false} is VALID [2020-07-29 03:24:52,752 INFO L280 TraceCheckUtils]: 27: Hoare triple {2050#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {2050#false} is VALID [2020-07-29 03:24:52,752 INFO L280 TraceCheckUtils]: 28: Hoare triple {2050#false} 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; {2050#false} is VALID [2020-07-29 03:24:52,752 INFO L280 TraceCheckUtils]: 29: Hoare triple {2050#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2050#false} is VALID [2020-07-29 03:24:52,752 INFO L280 TraceCheckUtils]: 30: Hoare triple {2050#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2050#false} is VALID [2020-07-29 03:24:52,753 INFO L280 TraceCheckUtils]: 31: Hoare triple {2050#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2050#false} is VALID [2020-07-29 03:24:52,753 INFO L280 TraceCheckUtils]: 32: Hoare triple {2050#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2050#false} is VALID [2020-07-29 03:24:52,753 INFO L280 TraceCheckUtils]: 33: Hoare triple {2050#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2050#false} is VALID [2020-07-29 03:24:52,753 INFO L280 TraceCheckUtils]: 34: Hoare triple {2050#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2050#false} is VALID [2020-07-29 03:24:52,753 INFO L280 TraceCheckUtils]: 35: Hoare triple {2050#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2050#false} is VALID [2020-07-29 03:24:52,754 INFO L280 TraceCheckUtils]: 36: Hoare triple {2050#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2050#false} is VALID [2020-07-29 03:24:52,754 INFO L280 TraceCheckUtils]: 37: Hoare triple {2050#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2050#false} is VALID [2020-07-29 03:24:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-29 03:24:52,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248914396] [2020-07-29 03:24:52,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555125618] [2020-07-29 03:24:52,756 INFO L93 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 [2020-07-29 03:24:52,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:24:52,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:24:52,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:24:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:52,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:52,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {2049#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2049#true} is VALID [2020-07-29 03:24:52,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,949 INFO L280 TraceCheckUtils]: 3: Hoare triple {2049#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2049#true} is VALID [2020-07-29 03:24:52,950 INFO L280 TraceCheckUtils]: 4: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {2049#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2049#true} is VALID [2020-07-29 03:24:52,950 INFO L280 TraceCheckUtils]: 6: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,951 INFO L280 TraceCheckUtils]: 7: Hoare triple {2049#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2049#true} is VALID [2020-07-29 03:24:52,951 INFO L280 TraceCheckUtils]: 8: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,951 INFO L280 TraceCheckUtils]: 9: Hoare triple {2049#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2049#true} is VALID [2020-07-29 03:24:52,951 INFO L280 TraceCheckUtils]: 10: Hoare triple {2049#true} 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; {2049#true} is VALID [2020-07-29 03:24:52,951 INFO L280 TraceCheckUtils]: 11: Hoare triple {2049#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2049#true} is VALID [2020-07-29 03:24:52,952 INFO L280 TraceCheckUtils]: 12: Hoare triple {2049#true} assume !(main_~i~1 < 5); {2049#true} is VALID [2020-07-29 03:24:52,952 INFO L280 TraceCheckUtils]: 13: Hoare triple {2049#true} 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; {2097#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,953 INFO L280 TraceCheckUtils]: 14: Hoare triple {2097#(<= ULTIMATE.start_max_~i~0 0)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2097#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,953 INFO L280 TraceCheckUtils]: 15: Hoare triple {2097#(<= ULTIMATE.start_max_~i~0 0)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2097#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,953 INFO L280 TraceCheckUtils]: 16: Hoare triple {2097#(<= ULTIMATE.start_max_~i~0 0)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2097#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:52,954 INFO L280 TraceCheckUtils]: 17: Hoare triple {2097#(<= ULTIMATE.start_max_~i~0 0)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2052#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,954 INFO L280 TraceCheckUtils]: 18: Hoare triple {2052#(<= ULTIMATE.start_max_~i~0 1)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2052#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,955 INFO L280 TraceCheckUtils]: 19: Hoare triple {2052#(<= ULTIMATE.start_max_~i~0 1)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2052#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,955 INFO L280 TraceCheckUtils]: 20: Hoare triple {2052#(<= ULTIMATE.start_max_~i~0 1)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2052#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:52,956 INFO L280 TraceCheckUtils]: 21: Hoare triple {2052#(<= ULTIMATE.start_max_~i~0 1)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2053#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:52,956 INFO L280 TraceCheckUtils]: 22: Hoare triple {2053#(<= ULTIMATE.start_max_~i~0 2)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2053#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:52,957 INFO L280 TraceCheckUtils]: 23: Hoare triple {2053#(<= ULTIMATE.start_max_~i~0 2)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2053#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:52,957 INFO L280 TraceCheckUtils]: 24: Hoare triple {2053#(<= ULTIMATE.start_max_~i~0 2)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2053#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:52,958 INFO L280 TraceCheckUtils]: 25: Hoare triple {2053#(<= ULTIMATE.start_max_~i~0 2)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2054#(<= ULTIMATE.start_max_~i~0 3)} is VALID [2020-07-29 03:24:52,958 INFO L280 TraceCheckUtils]: 26: Hoare triple {2054#(<= ULTIMATE.start_max_~i~0 3)} assume !(max_~i~0 < 5); {2050#false} is VALID [2020-07-29 03:24:52,958 INFO L280 TraceCheckUtils]: 27: Hoare triple {2050#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {2050#false} is VALID [2020-07-29 03:24:52,958 INFO L280 TraceCheckUtils]: 28: Hoare triple {2050#false} 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; {2050#false} is VALID [2020-07-29 03:24:52,959 INFO L280 TraceCheckUtils]: 29: Hoare triple {2050#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2050#false} is VALID [2020-07-29 03:24:52,959 INFO L280 TraceCheckUtils]: 30: Hoare triple {2050#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2050#false} is VALID [2020-07-29 03:24:52,959 INFO L280 TraceCheckUtils]: 31: Hoare triple {2050#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2050#false} is VALID [2020-07-29 03:24:52,959 INFO L280 TraceCheckUtils]: 32: Hoare triple {2050#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2050#false} is VALID [2020-07-29 03:24:52,959 INFO L280 TraceCheckUtils]: 33: Hoare triple {2050#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2050#false} is VALID [2020-07-29 03:24:52,959 INFO L280 TraceCheckUtils]: 34: Hoare triple {2050#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2050#false} is VALID [2020-07-29 03:24:52,960 INFO L280 TraceCheckUtils]: 35: Hoare triple {2050#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2050#false} is VALID [2020-07-29 03:24:52,960 INFO L280 TraceCheckUtils]: 36: Hoare triple {2050#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2050#false} is VALID [2020-07-29 03:24:52,960 INFO L280 TraceCheckUtils]: 37: Hoare triple {2050#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2050#false} is VALID [2020-07-29 03:24:52,961 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-07-29 03:24:52,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:24:52,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 03:24:52,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181859189] [2020-07-29 03:24:52,962 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:24:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:52,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2020-07-29 03:24:52,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:52,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54100736] [2020-07-29 03:24:52,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:52,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:52,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:52,972 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:53,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:53,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:24:53,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:24:53,044 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-07-29 03:24:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:53,287 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2020-07-29 03:24:53,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:24:53,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:24:53,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:53,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2020-07-29 03:24:53,329 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:53,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 100 transitions. [2020-07-29 03:24:53,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2020-07-29 03:24:53,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-07-29 03:24:53,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 100 transitions. [2020-07-29 03:24:53,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:53,335 INFO L688 BuchiCegarLoop]: Abstraction has 81 states and 100 transitions. [2020-07-29 03:24:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 100 transitions. [2020-07-29 03:24:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2020-07-29 03:24:53,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:53,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states and 100 transitions. Second operand 59 states. [2020-07-29 03:24:53,341 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states and 100 transitions. Second operand 59 states. [2020-07-29 03:24:53,341 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 59 states. [2020-07-29 03:24:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:53,343 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2020-07-29 03:24:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2020-07-29 03:24:53,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:53,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:53,344 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 81 states and 100 transitions. [2020-07-29 03:24:53,344 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 81 states and 100 transitions. [2020-07-29 03:24:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:53,346 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2020-07-29 03:24:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2020-07-29 03:24:53,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:53,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:53,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:53,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-29 03:24:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2020-07-29 03:24:53,348 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-07-29 03:24:53,348 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-07-29 03:24:53,348 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 03:24:53,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2020-07-29 03:24:53,349 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:53,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:53,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:53,350 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:24:53,350 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:53,352 INFO L794 eck$LassoCheckResult]: Stem: 2275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2272#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; 2268#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; 2269#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2270#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; 2271#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2291#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; 2290#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2289#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; 2288#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2287#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; 2286#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2285#L23-3 assume !(main_~i~1 < 5); 2267#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; 2254#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2255#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2266#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2261#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2256#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2257#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2307#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2305#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2303#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2301#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2299#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2297#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2295#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2280#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2293#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2281#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2279#L9-3 assume !(max_~i~0 < 5); 2250#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2251#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; 2276#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2262#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2252#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2253#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2277#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2308#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2306#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2304#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2302#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2300#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2298#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2296#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2294#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2283#L10-3 [2020-07-29 03:24:53,352 INFO L796 eck$LassoCheckResult]: Loop: 2283#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; 2292#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2284#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2282#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2283#L10-3 [2020-07-29 03:24:53,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:53,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 3 times [2020-07-29 03:24:53,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:53,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805845747] [2020-07-29 03:24:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:53,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {2474#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2474#true} is VALID [2020-07-29 03:24:53,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,477 INFO L280 TraceCheckUtils]: 2: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,477 INFO L280 TraceCheckUtils]: 3: Hoare triple {2474#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2474#true} is VALID [2020-07-29 03:24:53,478 INFO L280 TraceCheckUtils]: 4: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,478 INFO L280 TraceCheckUtils]: 5: Hoare triple {2474#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2474#true} is VALID [2020-07-29 03:24:53,478 INFO L280 TraceCheckUtils]: 6: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,478 INFO L280 TraceCheckUtils]: 7: Hoare triple {2474#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2474#true} is VALID [2020-07-29 03:24:53,479 INFO L280 TraceCheckUtils]: 8: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,479 INFO L280 TraceCheckUtils]: 9: Hoare triple {2474#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2474#true} is VALID [2020-07-29 03:24:53,479 INFO L280 TraceCheckUtils]: 10: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,479 INFO L280 TraceCheckUtils]: 11: Hoare triple {2474#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2474#true} is VALID [2020-07-29 03:24:53,479 INFO L280 TraceCheckUtils]: 12: Hoare triple {2474#true} assume !(main_~i~1 < 5); {2474#true} is VALID [2020-07-29 03:24:53,481 INFO L280 TraceCheckUtils]: 13: Hoare triple {2474#true} 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; {2476#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:53,481 INFO L280 TraceCheckUtils]: 14: Hoare triple {2476#(= ULTIMATE.start_max_~i~0 0)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2476#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:53,482 INFO L280 TraceCheckUtils]: 15: Hoare triple {2476#(= ULTIMATE.start_max_~i~0 0)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2476#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:53,482 INFO L280 TraceCheckUtils]: 16: Hoare triple {2476#(= ULTIMATE.start_max_~i~0 0)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2476#(= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:53,483 INFO L280 TraceCheckUtils]: 17: Hoare triple {2476#(= ULTIMATE.start_max_~i~0 0)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2477#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:53,483 INFO L280 TraceCheckUtils]: 18: Hoare triple {2477#(<= ULTIMATE.start_max_~i~0 1)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2477#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:53,483 INFO L280 TraceCheckUtils]: 19: Hoare triple {2477#(<= ULTIMATE.start_max_~i~0 1)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2477#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:53,484 INFO L280 TraceCheckUtils]: 20: Hoare triple {2477#(<= ULTIMATE.start_max_~i~0 1)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2477#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:53,484 INFO L280 TraceCheckUtils]: 21: Hoare triple {2477#(<= ULTIMATE.start_max_~i~0 1)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2478#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:53,485 INFO L280 TraceCheckUtils]: 22: Hoare triple {2478#(<= ULTIMATE.start_max_~i~0 2)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2478#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:53,485 INFO L280 TraceCheckUtils]: 23: Hoare triple {2478#(<= ULTIMATE.start_max_~i~0 2)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2478#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:53,486 INFO L280 TraceCheckUtils]: 24: Hoare triple {2478#(<= ULTIMATE.start_max_~i~0 2)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2478#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:53,486 INFO L280 TraceCheckUtils]: 25: Hoare triple {2478#(<= ULTIMATE.start_max_~i~0 2)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2479#(<= ULTIMATE.start_max_~i~0 3)} is VALID [2020-07-29 03:24:53,487 INFO L280 TraceCheckUtils]: 26: Hoare triple {2479#(<= ULTIMATE.start_max_~i~0 3)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2479#(<= ULTIMATE.start_max_~i~0 3)} is VALID [2020-07-29 03:24:53,487 INFO L280 TraceCheckUtils]: 27: Hoare triple {2479#(<= ULTIMATE.start_max_~i~0 3)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2479#(<= ULTIMATE.start_max_~i~0 3)} is VALID [2020-07-29 03:24:53,488 INFO L280 TraceCheckUtils]: 28: Hoare triple {2479#(<= ULTIMATE.start_max_~i~0 3)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2479#(<= ULTIMATE.start_max_~i~0 3)} is VALID [2020-07-29 03:24:53,488 INFO L280 TraceCheckUtils]: 29: Hoare triple {2479#(<= ULTIMATE.start_max_~i~0 3)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2480#(<= ULTIMATE.start_max_~i~0 4)} is VALID [2020-07-29 03:24:53,489 INFO L280 TraceCheckUtils]: 30: Hoare triple {2480#(<= ULTIMATE.start_max_~i~0 4)} assume !(max_~i~0 < 5); {2475#false} is VALID [2020-07-29 03:24:53,489 INFO L280 TraceCheckUtils]: 31: Hoare triple {2475#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {2475#false} is VALID [2020-07-29 03:24:53,489 INFO L280 TraceCheckUtils]: 32: Hoare triple {2475#false} 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; {2475#false} is VALID [2020-07-29 03:24:53,489 INFO L280 TraceCheckUtils]: 33: Hoare triple {2475#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2475#false} is VALID [2020-07-29 03:24:53,489 INFO L280 TraceCheckUtils]: 34: Hoare triple {2475#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2475#false} is VALID [2020-07-29 03:24:53,490 INFO L280 TraceCheckUtils]: 35: Hoare triple {2475#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2475#false} is VALID [2020-07-29 03:24:53,490 INFO L280 TraceCheckUtils]: 36: Hoare triple {2475#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2475#false} is VALID [2020-07-29 03:24:53,490 INFO L280 TraceCheckUtils]: 37: Hoare triple {2475#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2475#false} is VALID [2020-07-29 03:24:53,490 INFO L280 TraceCheckUtils]: 38: Hoare triple {2475#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2475#false} is VALID [2020-07-29 03:24:53,490 INFO L280 TraceCheckUtils]: 39: Hoare triple {2475#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2475#false} is VALID [2020-07-29 03:24:53,491 INFO L280 TraceCheckUtils]: 40: Hoare triple {2475#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2475#false} is VALID [2020-07-29 03:24:53,491 INFO L280 TraceCheckUtils]: 41: Hoare triple {2475#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2475#false} is VALID [2020-07-29 03:24:53,491 INFO L280 TraceCheckUtils]: 42: Hoare triple {2475#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2475#false} is VALID [2020-07-29 03:24:53,491 INFO L280 TraceCheckUtils]: 43: Hoare triple {2475#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2475#false} is VALID [2020-07-29 03:24:53,491 INFO L280 TraceCheckUtils]: 44: Hoare triple {2475#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2475#false} is VALID [2020-07-29 03:24:53,491 INFO L280 TraceCheckUtils]: 45: Hoare triple {2475#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2475#false} is VALID [2020-07-29 03:24:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-29 03:24:53,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805845747] [2020-07-29 03:24:53,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344018706] [2020-07-29 03:24:53,494 INFO L93 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 [2020-07-29 03:24:53,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-29 03:24:53,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:24:53,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:24:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:24:53,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:24:53,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {2474#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2474#true} is VALID [2020-07-29 03:24:53,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,753 INFO L280 TraceCheckUtils]: 2: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,753 INFO L280 TraceCheckUtils]: 3: Hoare triple {2474#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2474#true} is VALID [2020-07-29 03:24:53,754 INFO L280 TraceCheckUtils]: 4: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,754 INFO L280 TraceCheckUtils]: 5: Hoare triple {2474#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2474#true} is VALID [2020-07-29 03:24:53,754 INFO L280 TraceCheckUtils]: 6: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,755 INFO L280 TraceCheckUtils]: 7: Hoare triple {2474#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2474#true} is VALID [2020-07-29 03:24:53,755 INFO L280 TraceCheckUtils]: 8: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,755 INFO L280 TraceCheckUtils]: 9: Hoare triple {2474#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2474#true} is VALID [2020-07-29 03:24:53,755 INFO L280 TraceCheckUtils]: 10: Hoare triple {2474#true} 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; {2474#true} is VALID [2020-07-29 03:24:53,755 INFO L280 TraceCheckUtils]: 11: Hoare triple {2474#true} main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; {2474#true} is VALID [2020-07-29 03:24:53,755 INFO L280 TraceCheckUtils]: 12: Hoare triple {2474#true} assume !(main_~i~1 < 5); {2474#true} is VALID [2020-07-29 03:24:53,756 INFO L280 TraceCheckUtils]: 13: Hoare triple {2474#true} 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; {2523#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:53,756 INFO L280 TraceCheckUtils]: 14: Hoare triple {2523#(<= ULTIMATE.start_max_~i~0 0)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2523#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:53,757 INFO L280 TraceCheckUtils]: 15: Hoare triple {2523#(<= ULTIMATE.start_max_~i~0 0)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2523#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:53,757 INFO L280 TraceCheckUtils]: 16: Hoare triple {2523#(<= ULTIMATE.start_max_~i~0 0)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2523#(<= ULTIMATE.start_max_~i~0 0)} is VALID [2020-07-29 03:24:53,758 INFO L280 TraceCheckUtils]: 17: Hoare triple {2523#(<= ULTIMATE.start_max_~i~0 0)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2477#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:53,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {2477#(<= ULTIMATE.start_max_~i~0 1)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2477#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:53,759 INFO L280 TraceCheckUtils]: 19: Hoare triple {2477#(<= ULTIMATE.start_max_~i~0 1)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2477#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:53,759 INFO L280 TraceCheckUtils]: 20: Hoare triple {2477#(<= ULTIMATE.start_max_~i~0 1)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2477#(<= ULTIMATE.start_max_~i~0 1)} is VALID [2020-07-29 03:24:53,760 INFO L280 TraceCheckUtils]: 21: Hoare triple {2477#(<= ULTIMATE.start_max_~i~0 1)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2478#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:53,760 INFO L280 TraceCheckUtils]: 22: Hoare triple {2478#(<= ULTIMATE.start_max_~i~0 2)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2478#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:53,761 INFO L280 TraceCheckUtils]: 23: Hoare triple {2478#(<= ULTIMATE.start_max_~i~0 2)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2478#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:53,761 INFO L280 TraceCheckUtils]: 24: Hoare triple {2478#(<= ULTIMATE.start_max_~i~0 2)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2478#(<= ULTIMATE.start_max_~i~0 2)} is VALID [2020-07-29 03:24:53,762 INFO L280 TraceCheckUtils]: 25: Hoare triple {2478#(<= ULTIMATE.start_max_~i~0 2)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2479#(<= ULTIMATE.start_max_~i~0 3)} is VALID [2020-07-29 03:24:53,762 INFO L280 TraceCheckUtils]: 26: Hoare triple {2479#(<= ULTIMATE.start_max_~i~0 3)} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2479#(<= ULTIMATE.start_max_~i~0 3)} is VALID [2020-07-29 03:24:53,762 INFO L280 TraceCheckUtils]: 27: Hoare triple {2479#(<= ULTIMATE.start_max_~i~0 3)} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2479#(<= ULTIMATE.start_max_~i~0 3)} is VALID [2020-07-29 03:24:53,763 INFO L280 TraceCheckUtils]: 28: Hoare triple {2479#(<= ULTIMATE.start_max_~i~0 3)} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2479#(<= ULTIMATE.start_max_~i~0 3)} is VALID [2020-07-29 03:24:53,763 INFO L280 TraceCheckUtils]: 29: Hoare triple {2479#(<= ULTIMATE.start_max_~i~0 3)} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2480#(<= ULTIMATE.start_max_~i~0 4)} is VALID [2020-07-29 03:24:53,764 INFO L280 TraceCheckUtils]: 30: Hoare triple {2480#(<= ULTIMATE.start_max_~i~0 4)} assume !(max_~i~0 < 5); {2475#false} is VALID [2020-07-29 03:24:53,764 INFO L280 TraceCheckUtils]: 31: Hoare triple {2475#false} max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); {2475#false} is VALID [2020-07-29 03:24:53,764 INFO L280 TraceCheckUtils]: 32: Hoare triple {2475#false} 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; {2475#false} is VALID [2020-07-29 03:24:53,764 INFO L280 TraceCheckUtils]: 33: Hoare triple {2475#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2475#false} is VALID [2020-07-29 03:24:53,765 INFO L280 TraceCheckUtils]: 34: Hoare triple {2475#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2475#false} is VALID [2020-07-29 03:24:53,765 INFO L280 TraceCheckUtils]: 35: Hoare triple {2475#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2475#false} is VALID [2020-07-29 03:24:53,765 INFO L280 TraceCheckUtils]: 36: Hoare triple {2475#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2475#false} is VALID [2020-07-29 03:24:53,765 INFO L280 TraceCheckUtils]: 37: Hoare triple {2475#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2475#false} is VALID [2020-07-29 03:24:53,767 INFO L280 TraceCheckUtils]: 38: Hoare triple {2475#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2475#false} is VALID [2020-07-29 03:24:53,768 INFO L280 TraceCheckUtils]: 39: Hoare triple {2475#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2475#false} is VALID [2020-07-29 03:24:53,768 INFO L280 TraceCheckUtils]: 40: Hoare triple {2475#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2475#false} is VALID [2020-07-29 03:24:53,768 INFO L280 TraceCheckUtils]: 41: Hoare triple {2475#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2475#false} is VALID [2020-07-29 03:24:53,768 INFO L280 TraceCheckUtils]: 42: Hoare triple {2475#false} assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; {2475#false} is VALID [2020-07-29 03:24:53,768 INFO L280 TraceCheckUtils]: 43: Hoare triple {2475#false} max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; {2475#false} is VALID [2020-07-29 03:24:53,769 INFO L280 TraceCheckUtils]: 44: Hoare triple {2475#false} max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; {2475#false} is VALID [2020-07-29 03:24:53,769 INFO L280 TraceCheckUtils]: 45: Hoare triple {2475#false} assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); {2475#false} is VALID [2020-07-29 03:24:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-29 03:24:53,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:24:53,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-29 03:24:53,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593184578] [2020-07-29 03:24:53,775 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:24:53,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:53,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2020-07-29 03:24:53,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:53,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160422105] [2020-07-29 03:24:53,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:53,782 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:24:53,787 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:24:53,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:24:53,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:24:53,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 03:24:53,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-29 03:24:53,869 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-07-29 03:24:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:54,160 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2020-07-29 03:24:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:24:54,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:24:54,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:24:54,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2020-07-29 03:24:54,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:54,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2020-07-29 03:24:54,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-07-29 03:24:54,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2020-07-29 03:24:54,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2020-07-29 03:24:54,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:24:54,206 INFO L688 BuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2020-07-29 03:24:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2020-07-29 03:24:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2020-07-29 03:24:54,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:24:54,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states and 103 transitions. Second operand 67 states. [2020-07-29 03:24:54,210 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states and 103 transitions. Second operand 67 states. [2020-07-29 03:24:54,211 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand 67 states. [2020-07-29 03:24:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:54,212 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2020-07-29 03:24:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2020-07-29 03:24:54,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:54,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:54,213 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 84 states and 103 transitions. [2020-07-29 03:24:54,213 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 84 states and 103 transitions. [2020-07-29 03:24:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:24:54,215 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2020-07-29 03:24:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2020-07-29 03:24:54,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:24:54,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:24:54,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:24:54,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:24:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-29 03:24:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2020-07-29 03:24:54,218 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2020-07-29 03:24:54,218 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2020-07-29 03:24:54,218 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-29 03:24:54,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2020-07-29 03:24:54,219 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-07-29 03:24:54,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:24:54,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:24:54,220 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:24:54,220 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:24:54,221 INFO L794 eck$LassoCheckResult]: Stem: 2728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2726#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; 2722#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; 2723#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2724#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; 2725#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2769#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; 2768#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2767#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; 2766#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2765#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; 2764#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 2763#L23-3 assume !(main_~i~1 < 5); 2721#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; 2707#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2708#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2727#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2756#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2709#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2710#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2720#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2714#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2715#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2753#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2751#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2749#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2747#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2745#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2744#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2742#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2740#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2735#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2737#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2736#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2734#L9-3 assume !(max_~i~0 < 5); 2703#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 2704#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; 2731#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2716#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2705#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2706#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2733#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2762#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2761#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2760#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2759#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2758#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2757#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2755#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2754#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2752#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2750#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2748#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2746#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2739#L10-3 [2020-07-29 03:24:54,221 INFO L796 eck$LassoCheckResult]: Loop: 2739#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; 2743#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~ite3;havoc max_#t~mem2;havoc max_#t~mem1; 2741#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 2738#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2739#L10-3 [2020-07-29 03:24:54,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:24:54,221 INFO L82 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 4 times [2020-07-29 03:24:54,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:24:54,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669702506] [2020-07-29 03:24:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:24:54,270 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:206) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:883) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:797) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 03:24:54,277 INFO L168 Benchmark]: Toolchain (without parser) took 12315.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 961.6 MB in the beginning and 947.8 MB in the end (delta: 13.8 MB). Peak memory consumption was 325.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:24:54,278 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:24:54,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.47 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:24:54,279 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:24:54,279 INFO L168 Benchmark]: Boogie Preprocessor took 47.41 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. [2020-07-29 03:24:54,280 INFO L168 Benchmark]: RCFGBuilder took 629.01 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: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:24:54,280 INFO L168 Benchmark]: BuchiAutomizer took 11241.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 947.8 MB in the end (delta: 130.1 MB). Peak memory consumption was 313.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:24:54,285 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.47 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 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 116.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.41 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 629.01 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: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11241.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 947.8 MB in the end (delta: 130.1 MB). Peak memory consumption was 313.6 MB. 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.buchiautomizer: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...