./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c --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/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c -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 621ffddab72a844815bc4eb1bc48bc0271a6c22b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:17:18,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:17:18,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:17:18,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:17:18,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:17:18,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:17:18,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:17:18,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:17:18,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:17:18,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:17:18,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:17:18,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:17:18,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:17:18,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:17:18,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:17:18,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:17:18,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:17:18,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:17:18,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:17:18,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:17:18,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:17:18,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:17:18,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:17:18,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:17:18,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:17:18,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:17:18,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:17:18,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:17:18,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:17:19,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:17:19,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:17:19,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:17:19,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:17:19,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:17:19,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:17:19,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:17:19,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:17:19,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:17:19,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:17:19,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:17:19,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:17:19,011 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:17:19,049 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:17:19,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:17:19,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:17:19,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:17:19,051 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:17:19,052 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:17:19,052 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:17:19,052 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:17:19,052 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:17:19,052 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:17:19,053 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:17:19,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:17:19,053 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:17:19,053 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:17:19,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:17:19,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:17:19,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:17:19,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:17:19,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:17:19,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:17:19,055 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:17:19,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:17:19,055 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:17:19,056 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:17:19,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:17:19,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:17:19,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:17:19,057 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:17:19,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:17:19,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:17:19,057 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:17:19,058 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:17:19,059 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:17:19,059 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 -> 621ffddab72a844815bc4eb1bc48bc0271a6c22b [2020-07-29 03:17:19,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:17:19,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:17:19,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:17:19,436 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:17:19,437 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:17:19,437 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2020-07-29 03:17:19,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e1718a2/4af5951261f94c719878f6208d32f62d/FLAG8b5229e16 [2020-07-29 03:17:20,020 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:17:20,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2020-07-29 03:17:20,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e1718a2/4af5951261f94c719878f6208d32f62d/FLAG8b5229e16 [2020-07-29 03:17:20,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86e1718a2/4af5951261f94c719878f6208d32f62d [2020-07-29 03:17:20,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:17:20,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:17:20,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:20,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:17:20,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:17:20,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:20" (1/1) ... [2020-07-29 03:17:20,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158c96c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:20, skipping insertion in model container [2020-07-29 03:17:20,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:20" (1/1) ... [2020-07-29 03:17:20,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:17:20,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:17:20,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:20,803 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:17:20,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:20,947 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:17:20,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:20 WrapperNode [2020-07-29 03:17:20,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:20,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:20,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:17:20,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:17:20,959 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:17:20" (1/1) ... [2020-07-29 03:17:20,971 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:17:20" (1/1) ... [2020-07-29 03:17:21,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:21,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:17:21,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:17:21,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:17:21,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:20" (1/1) ... [2020-07-29 03:17:21,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:20" (1/1) ... [2020-07-29 03:17:21,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:20" (1/1) ... [2020-07-29 03:17:21,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:20" (1/1) ... [2020-07-29 03:17:21,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:20" (1/1) ... [2020-07-29 03:17:21,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:20" (1/1) ... [2020-07-29 03:17:21,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:20" (1/1) ... [2020-07-29 03:17:21,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:17:21,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:17:21,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:17:21,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:17:21,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:20" (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:17:21,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:17:21,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:17:22,132 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:17:22,133 INFO L295 CfgBuilder]: Removed 23 assume(true) statements. [2020-07-29 03:17:22,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:22 BoogieIcfgContainer [2020-07-29 03:17:22,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:17:22,139 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:17:22,139 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:17:22,143 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:17:22,144 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:22,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:17:20" (1/3) ... [2020-07-29 03:17:22,146 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51c1d20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:17:22, skipping insertion in model container [2020-07-29 03:17:22,146 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:22,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:20" (2/3) ... [2020-07-29 03:17:22,147 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51c1d20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:17:22, skipping insertion in model container [2020-07-29 03:17:22,147 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:22,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:22" (3/3) ... [2020-07-29 03:17:22,149 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2020-07-29 03:17:22,201 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:17:22,202 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:17:22,202 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:17:22,202 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:17:22,203 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:17:22,204 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:17:22,204 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:17:22,204 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:17:22,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states. [2020-07-29 03:17:22,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2020-07-29 03:17:22,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:22,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:22,283 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:22,284 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:22,284 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:17:22,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states. [2020-07-29 03:17:22,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2020-07-29 03:17:22,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:22,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:22,303 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:22,304 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:22,317 INFO L794 eck$LassoCheckResult]: Stem: 89#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 9#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 21#L293true assume !(0 == ~r1~0);init_~tmp~0 := 0; 34#L293-1true init_#res := init_~tmp~0; 48#L422true main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 50#L67true assume !(0 == assume_abort_if_not_~cond); 93#L66true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 25#L491-2true [2020-07-29 03:17:22,318 INFO L796 eck$LassoCheckResult]: Loop: 25#L491-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 96#L121true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 23#L125true assume !(node1_~m1~0 != ~nomsg~0); 22#L125-1true ~mode1~0 := 0; 92#L121-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 115#L156true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 119#L159true assume !(node2_~m2~0 != ~nomsg~0); 100#L159-1true ~mode2~0 := 0; 111#L156-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 68#L190true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 73#L193true assume !(node3_~m3~0 != ~nomsg~0); 72#L193-1true ~mode3~0 := 0; 66#L190-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 46#L224true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 33#L227true assume !(node4_~m4~0 != ~nomsg~0); 30#L227-1true ~mode4~0 := 0; 24#L224-2true havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 122#L258true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 97#L261true assume !(node5_~m5~0 != ~nomsg~0); 109#L261-1true ~mode5~0 := 0; 120#L258-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 53#L430true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 55#L430-1true check_#res := check_~tmp~1; 17#L442true main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 44#L521true assume !(0 == assert_~arg % 256); 20#L516true main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 25#L491-2true [2020-07-29 03:17:22,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1984313218, now seen corresponding path program 1 times [2020-07-29 03:17:22,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:22,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784750463] [2020-07-29 03:17:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:22,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {125#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; {125#true} is VALID [2020-07-29 03:17:22,598 INFO L280 TraceCheckUtils]: 1: Hoare triple {125#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {125#true} is VALID [2020-07-29 03:17:22,599 INFO L280 TraceCheckUtils]: 2: Hoare triple {125#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {127#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:17:22,600 INFO L280 TraceCheckUtils]: 3: Hoare triple {127#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {128#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:17:22,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {128#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {129#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:17:22,602 INFO L280 TraceCheckUtils]: 5: Hoare triple {129#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {126#false} is VALID [2020-07-29 03:17:22,603 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; {126#false} is VALID [2020-07-29 03:17:22,606 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:17:22,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784750463] [2020-07-29 03:17:22,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:22,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:22,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239654189] [2020-07-29 03:17:22,614 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:17:22,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:22,615 INFO L82 PathProgramCache]: Analyzing trace with hash 738213390, now seen corresponding path program 1 times [2020-07-29 03:17:22,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:22,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029868267] [2020-07-29 03:17:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:22,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {130#true} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:22,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {130#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:22,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {130#true} assume !(node1_~m1~0 != ~nomsg~0); {130#true} is VALID [2020-07-29 03:17:22,860 INFO L280 TraceCheckUtils]: 3: Hoare triple {130#true} ~mode1~0 := 0; {130#true} is VALID [2020-07-29 03:17:22,860 INFO L280 TraceCheckUtils]: 4: Hoare triple {130#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:22,861 INFO L280 TraceCheckUtils]: 5: Hoare triple {130#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:22,861 INFO L280 TraceCheckUtils]: 6: Hoare triple {130#true} assume !(node2_~m2~0 != ~nomsg~0); {130#true} is VALID [2020-07-29 03:17:22,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {130#true} ~mode2~0 := 0; {130#true} is VALID [2020-07-29 03:17:22,862 INFO L280 TraceCheckUtils]: 8: Hoare triple {130#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:22,862 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:22,863 INFO L280 TraceCheckUtils]: 10: Hoare triple {130#true} assume !(node3_~m3~0 != ~nomsg~0); {130#true} is VALID [2020-07-29 03:17:22,863 INFO L280 TraceCheckUtils]: 11: Hoare triple {130#true} ~mode3~0 := 0; {130#true} is VALID [2020-07-29 03:17:22,863 INFO L280 TraceCheckUtils]: 12: Hoare triple {130#true} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:22,864 INFO L280 TraceCheckUtils]: 13: Hoare triple {130#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:22,864 INFO L280 TraceCheckUtils]: 14: Hoare triple {130#true} assume !(node4_~m4~0 != ~nomsg~0); {130#true} is VALID [2020-07-29 03:17:22,865 INFO L280 TraceCheckUtils]: 15: Hoare triple {130#true} ~mode4~0 := 0; {130#true} is VALID [2020-07-29 03:17:22,865 INFO L280 TraceCheckUtils]: 16: Hoare triple {130#true} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:22,866 INFO L280 TraceCheckUtils]: 17: Hoare triple {130#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {130#true} is VALID [2020-07-29 03:17:22,866 INFO L280 TraceCheckUtils]: 18: Hoare triple {130#true} assume !(node5_~m5~0 != ~nomsg~0); {130#true} is VALID [2020-07-29 03:17:22,866 INFO L280 TraceCheckUtils]: 19: Hoare triple {130#true} ~mode5~0 := 0; {130#true} is VALID [2020-07-29 03:17:22,867 INFO L280 TraceCheckUtils]: 20: Hoare triple {130#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {130#true} is VALID [2020-07-29 03:17:22,868 INFO L280 TraceCheckUtils]: 21: Hoare triple {130#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; {132#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:22,869 INFO L280 TraceCheckUtils]: 22: Hoare triple {132#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {133#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:22,871 INFO L280 TraceCheckUtils]: 23: Hoare triple {133#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {134#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:22,872 INFO L280 TraceCheckUtils]: 24: Hoare triple {134#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {131#false} is VALID [2020-07-29 03:17:22,872 INFO L280 TraceCheckUtils]: 25: Hoare triple {131#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {131#false} is VALID [2020-07-29 03:17:22,875 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:17:22,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029868267] [2020-07-29 03:17:22,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:22,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:22,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954590951] [2020-07-29 03:17:22,879 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:22,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:17:22,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:17:22,898 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 5 states. [2020-07-29 03:17:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:23,576 INFO L93 Difference]: Finished difference Result 124 states and 203 transitions. [2020-07-29 03:17:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:17:23,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:23,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:23,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 203 transitions. [2020-07-29 03:17:23,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:17:23,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 116 states and 164 transitions. [2020-07-29 03:17:23,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2020-07-29 03:17:23,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2020-07-29 03:17:23,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 164 transitions. [2020-07-29 03:17:23,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:23,641 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2020-07-29 03:17:23,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 164 transitions. [2020-07-29 03:17:23,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-07-29 03:17:23,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:23,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 164 transitions. Second operand 116 states. [2020-07-29 03:17:23,680 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 164 transitions. Second operand 116 states. [2020-07-29 03:17:23,682 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand 116 states. [2020-07-29 03:17:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:23,690 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2020-07-29 03:17:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2020-07-29 03:17:23,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:23,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:23,693 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 116 states and 164 transitions. [2020-07-29 03:17:23,693 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 116 states and 164 transitions. [2020-07-29 03:17:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:23,700 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2020-07-29 03:17:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2020-07-29 03:17:23,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:23,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:23,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:23,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-07-29 03:17:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2020-07-29 03:17:23,710 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2020-07-29 03:17:23,710 INFO L591 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2020-07-29 03:17:23,710 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:17:23,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 164 transitions. [2020-07-29 03:17:23,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:17:23,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:23,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:23,715 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:23,715 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:23,716 INFO L794 eck$LassoCheckResult]: Stem: 371#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 277#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 278#L293 assume 0 == ~r1~0; 299#L294 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 346#L295 assume ~id1~0 >= 0; 275#L296 assume 0 == ~st1~0; 276#L297 assume ~send1~0 == ~id1~0; 349#L298 assume 0 == ~mode1~0 % 256; 283#L299 assume ~id2~0 >= 0; 284#L300 assume 0 == ~st2~0; 338#L301 assume ~send2~0 == ~id2~0; 339#L302 assume 0 == ~mode2~0 % 256; 355#L303 assume ~id3~0 >= 0; 315#L304 assume 0 == ~st3~0; 316#L305 assume ~send3~0 == ~id3~0; 351#L306 assume 0 == ~mode3~0 % 256; 281#L307 assume ~id4~0 >= 0; 282#L308 assume 0 == ~st4~0; 348#L309 assume ~send4~0 == ~id4~0; 273#L310 assume 0 == ~mode4~0 % 256; 274#L311 assume ~id5~0 >= 0; 326#L312 assume 0 == ~st5~0; 327#L313 assume ~send5~0 == ~id5~0; 363#L314 assume 0 == ~mode5~0 % 256; 313#L315 assume ~id1~0 != ~id2~0; 314#L316 assume ~id1~0 != ~id3~0; 350#L317 assume ~id1~0 != ~id4~0; 279#L318 assume ~id1~0 != ~id5~0; 280#L319 assume ~id2~0 != ~id3~0; 347#L320 assume ~id2~0 != ~id4~0; 271#L321 assume ~id2~0 != ~id5~0; 272#L322 assume ~id3~0 != ~id4~0; 323#L323 assume ~id3~0 != ~id5~0; 324#L324 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 319#L293-1 init_#res := init_~tmp~0; 320#L422 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 340#L67 assume !(0 == assume_abort_if_not_~cond); 341#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 298#L491-2 [2020-07-29 03:17:23,716 INFO L796 eck$LassoCheckResult]: Loop: 298#L491-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 305#L121 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 301#L125 assume !(node1_~m1~0 != ~nomsg~0); 300#L125-1 ~mode1~0 := 0; 286#L121-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 372#L156 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 378#L159 assume !(node2_~m2~0 != ~nomsg~0); 296#L159-1 ~mode2~0 := 0; 373#L156-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 358#L190 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 359#L193 assume !(node3_~m3~0 != ~nomsg~0); 311#L193-1 ~mode3~0 := 0; 325#L190-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 336#L224 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 317#L227 assume !(node4_~m4~0 != ~nomsg~0); 312#L227-1 ~mode4~0 := 0; 303#L224-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 304#L258 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 374#L261 assume !(node5_~m5~0 != ~nomsg~0); 269#L261-1 ~mode5~0 := 0; 360#L258-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 344#L430 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 293#L430-1 check_#res := check_~tmp~1; 290#L442 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 291#L521 assume !(0 == assert_~arg % 256); 297#L516 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 298#L491-2 [2020-07-29 03:17:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 1 times [2020-07-29 03:17:23,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:23,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80853871] [2020-07-29 03:17:23,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:23,817 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:23,897 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:23,950 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:23,950 INFO L82 PathProgramCache]: Analyzing trace with hash 738213390, now seen corresponding path program 2 times [2020-07-29 03:17:23,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:23,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806925143] [2020-07-29 03:17:23,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:24,080 INFO L280 TraceCheckUtils]: 0: Hoare triple {616#true} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:24,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {616#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:24,081 INFO L280 TraceCheckUtils]: 2: Hoare triple {616#true} assume !(node1_~m1~0 != ~nomsg~0); {616#true} is VALID [2020-07-29 03:17:24,081 INFO L280 TraceCheckUtils]: 3: Hoare triple {616#true} ~mode1~0 := 0; {616#true} is VALID [2020-07-29 03:17:24,081 INFO L280 TraceCheckUtils]: 4: Hoare triple {616#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:24,082 INFO L280 TraceCheckUtils]: 5: Hoare triple {616#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:24,082 INFO L280 TraceCheckUtils]: 6: Hoare triple {616#true} assume !(node2_~m2~0 != ~nomsg~0); {616#true} is VALID [2020-07-29 03:17:24,082 INFO L280 TraceCheckUtils]: 7: Hoare triple {616#true} ~mode2~0 := 0; {616#true} is VALID [2020-07-29 03:17:24,083 INFO L280 TraceCheckUtils]: 8: Hoare triple {616#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:24,083 INFO L280 TraceCheckUtils]: 9: Hoare triple {616#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:24,083 INFO L280 TraceCheckUtils]: 10: Hoare triple {616#true} assume !(node3_~m3~0 != ~nomsg~0); {616#true} is VALID [2020-07-29 03:17:24,084 INFO L280 TraceCheckUtils]: 11: Hoare triple {616#true} ~mode3~0 := 0; {616#true} is VALID [2020-07-29 03:17:24,084 INFO L280 TraceCheckUtils]: 12: Hoare triple {616#true} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:24,084 INFO L280 TraceCheckUtils]: 13: Hoare triple {616#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:24,084 INFO L280 TraceCheckUtils]: 14: Hoare triple {616#true} assume !(node4_~m4~0 != ~nomsg~0); {616#true} is VALID [2020-07-29 03:17:24,085 INFO L280 TraceCheckUtils]: 15: Hoare triple {616#true} ~mode4~0 := 0; {616#true} is VALID [2020-07-29 03:17:24,085 INFO L280 TraceCheckUtils]: 16: Hoare triple {616#true} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:24,085 INFO L280 TraceCheckUtils]: 17: Hoare triple {616#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {616#true} is VALID [2020-07-29 03:17:24,086 INFO L280 TraceCheckUtils]: 18: Hoare triple {616#true} assume !(node5_~m5~0 != ~nomsg~0); {616#true} is VALID [2020-07-29 03:17:24,086 INFO L280 TraceCheckUtils]: 19: Hoare triple {616#true} ~mode5~0 := 0; {616#true} is VALID [2020-07-29 03:17:24,086 INFO L280 TraceCheckUtils]: 20: Hoare triple {616#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {616#true} is VALID [2020-07-29 03:17:24,087 INFO L280 TraceCheckUtils]: 21: Hoare triple {616#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; {618#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:24,088 INFO L280 TraceCheckUtils]: 22: Hoare triple {618#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {619#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:24,090 INFO L280 TraceCheckUtils]: 23: Hoare triple {619#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {620#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:24,091 INFO L280 TraceCheckUtils]: 24: Hoare triple {620#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {617#false} is VALID [2020-07-29 03:17:24,091 INFO L280 TraceCheckUtils]: 25: Hoare triple {617#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {617#false} is VALID [2020-07-29 03:17:24,092 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:17:24,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806925143] [2020-07-29 03:17:24,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:24,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:24,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969222904] [2020-07-29 03:17:24,094 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:24,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:24,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:17:24,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:17:24,095 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. cyclomatic complexity: 49 Second operand 5 states. [2020-07-29 03:17:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:24,686 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2020-07-29 03:17:24,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:17:24,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:24,725 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:17:24,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 166 transitions. [2020-07-29 03:17:24,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:17:24,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 116 states and 162 transitions. [2020-07-29 03:17:24,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2020-07-29 03:17:24,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2020-07-29 03:17:24,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 162 transitions. [2020-07-29 03:17:24,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:24,740 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2020-07-29 03:17:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 162 transitions. [2020-07-29 03:17:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-07-29 03:17:24,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:24,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 162 transitions. Second operand 116 states. [2020-07-29 03:17:24,747 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 162 transitions. Second operand 116 states. [2020-07-29 03:17:24,747 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand 116 states. [2020-07-29 03:17:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:24,752 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2020-07-29 03:17:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2020-07-29 03:17:24,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:24,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:24,753 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 116 states and 162 transitions. [2020-07-29 03:17:24,754 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 116 states and 162 transitions. [2020-07-29 03:17:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:24,758 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2020-07-29 03:17:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2020-07-29 03:17:24,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:24,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:24,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:24,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-07-29 03:17:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2020-07-29 03:17:24,764 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2020-07-29 03:17:24,764 INFO L591 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2020-07-29 03:17:24,765 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:17:24,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 162 transitions. [2020-07-29 03:17:24,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2020-07-29 03:17:24,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:24,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:24,768 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:24,768 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:24,768 INFO L794 eck$LassoCheckResult]: Stem: 852#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 758#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 759#L293 assume 0 == ~r1~0; 780#L294 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 827#L295 assume ~id1~0 >= 0; 756#L296 assume 0 == ~st1~0; 757#L297 assume ~send1~0 == ~id1~0; 830#L298 assume 0 == ~mode1~0 % 256; 764#L299 assume ~id2~0 >= 0; 765#L300 assume 0 == ~st2~0; 819#L301 assume ~send2~0 == ~id2~0; 820#L302 assume 0 == ~mode2~0 % 256; 836#L303 assume ~id3~0 >= 0; 796#L304 assume 0 == ~st3~0; 797#L305 assume ~send3~0 == ~id3~0; 832#L306 assume 0 == ~mode3~0 % 256; 762#L307 assume ~id4~0 >= 0; 763#L308 assume 0 == ~st4~0; 829#L309 assume ~send4~0 == ~id4~0; 754#L310 assume 0 == ~mode4~0 % 256; 755#L311 assume ~id5~0 >= 0; 807#L312 assume 0 == ~st5~0; 808#L313 assume ~send5~0 == ~id5~0; 844#L314 assume 0 == ~mode5~0 % 256; 794#L315 assume ~id1~0 != ~id2~0; 795#L316 assume ~id1~0 != ~id3~0; 831#L317 assume ~id1~0 != ~id4~0; 760#L318 assume ~id1~0 != ~id5~0; 761#L319 assume ~id2~0 != ~id3~0; 828#L320 assume ~id2~0 != ~id4~0; 752#L321 assume ~id2~0 != ~id5~0; 753#L322 assume ~id3~0 != ~id4~0; 804#L323 assume ~id3~0 != ~id5~0; 805#L324 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 800#L293-1 init_#res := init_~tmp~0; 801#L422 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 821#L67 assume !(0 == assume_abort_if_not_~cond); 822#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 779#L491-2 [2020-07-29 03:17:24,768 INFO L796 eck$LassoCheckResult]: Loop: 779#L491-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 786#L121 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 782#L125 assume !(node1_~m1~0 != ~nomsg~0); 781#L125-1 ~mode1~0 := 0; 767#L121-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 853#L156 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 859#L159 assume !(node2_~m2~0 != ~nomsg~0); 774#L159-1 ~mode2~0 := 0; 854#L156-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 839#L190 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 840#L193 assume !(node3_~m3~0 != ~nomsg~0); 792#L193-1 ~mode3~0 := 0; 806#L190-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 817#L224 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 798#L227 assume !(node4_~m4~0 != ~nomsg~0); 793#L227-1 ~mode4~0 := 0; 784#L224-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 785#L258 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 855#L261 assume !(node5_~m5~0 != ~nomsg~0); 750#L261-1 ~mode5~0 := 0; 841#L258-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 825#L430 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 775#L431 assume ~r1~0 < 5;check_~tmp~1 := 1; 776#L430-1 check_#res := check_~tmp~1; 771#L442 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 772#L521 assume !(0 == assert_~arg % 256); 778#L516 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 779#L491-2 [2020-07-29 03:17:24,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:24,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 2 times [2020-07-29 03:17:24,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:24,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923489862] [2020-07-29 03:17:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:24,797 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:24,822 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:24,836 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:24,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:24,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1026451556, now seen corresponding path program 1 times [2020-07-29 03:17:24,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:24,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531774368] [2020-07-29 03:17:24,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:24,852 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:24,864 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:24,871 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:24,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:24,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1906603762, now seen corresponding path program 1 times [2020-07-29 03:17:24,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:24,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151482530] [2020-07-29 03:17:24,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:24,953 INFO L280 TraceCheckUtils]: 0: Hoare triple {1099#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; {1099#true} is VALID [2020-07-29 03:17:24,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {1099#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1099#true} is VALID [2020-07-29 03:17:24,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {1099#true} assume 0 == ~r1~0; {1099#true} is VALID [2020-07-29 03:17:24,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {1099#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1099#true} is VALID [2020-07-29 03:17:24,954 INFO L280 TraceCheckUtils]: 4: Hoare triple {1099#true} assume ~id1~0 >= 0; {1099#true} is VALID [2020-07-29 03:17:24,954 INFO L280 TraceCheckUtils]: 5: Hoare triple {1099#true} assume 0 == ~st1~0; {1099#true} is VALID [2020-07-29 03:17:24,955 INFO L280 TraceCheckUtils]: 6: Hoare triple {1099#true} assume ~send1~0 == ~id1~0; {1099#true} is VALID [2020-07-29 03:17:24,956 INFO L280 TraceCheckUtils]: 7: Hoare triple {1099#true} assume 0 == ~mode1~0 % 256; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,956 INFO L280 TraceCheckUtils]: 8: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 >= 0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,957 INFO L280 TraceCheckUtils]: 9: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st2~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,958 INFO L280 TraceCheckUtils]: 10: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send2~0 == ~id2~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,958 INFO L280 TraceCheckUtils]: 11: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode2~0 % 256; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,959 INFO L280 TraceCheckUtils]: 12: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 >= 0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,959 INFO L280 TraceCheckUtils]: 13: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st3~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send3~0 == ~id3~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,960 INFO L280 TraceCheckUtils]: 15: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode3~0 % 256; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,961 INFO L280 TraceCheckUtils]: 16: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 >= 0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,961 INFO L280 TraceCheckUtils]: 17: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st4~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,962 INFO L280 TraceCheckUtils]: 18: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send4~0 == ~id4~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,963 INFO L280 TraceCheckUtils]: 19: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode4~0 % 256; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,963 INFO L280 TraceCheckUtils]: 20: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 >= 0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,964 INFO L280 TraceCheckUtils]: 21: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st5~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,965 INFO L280 TraceCheckUtils]: 22: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send5~0 == ~id5~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,965 INFO L280 TraceCheckUtils]: 23: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode5~0 % 256; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,966 INFO L280 TraceCheckUtils]: 24: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id2~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,967 INFO L280 TraceCheckUtils]: 25: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id3~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,967 INFO L280 TraceCheckUtils]: 26: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id4~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,968 INFO L280 TraceCheckUtils]: 27: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id5~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,968 INFO L280 TraceCheckUtils]: 28: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id3~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,969 INFO L280 TraceCheckUtils]: 29: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id4~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,969 INFO L280 TraceCheckUtils]: 30: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id5~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,970 INFO L280 TraceCheckUtils]: 31: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id4~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,970 INFO L280 TraceCheckUtils]: 32: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id5~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,971 INFO L280 TraceCheckUtils]: 33: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,972 INFO L280 TraceCheckUtils]: 34: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} init_#res := init_~tmp~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,974 INFO L280 TraceCheckUtils]: 35: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,974 INFO L280 TraceCheckUtils]: 36: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !(0 == assume_abort_if_not_~cond); {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,975 INFO L280 TraceCheckUtils]: 37: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,975 INFO L280 TraceCheckUtils]: 38: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:24,976 INFO L280 TraceCheckUtils]: 39: Hoare triple {1101#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:24,977 INFO L280 TraceCheckUtils]: 40: Hoare triple {1100#false} assume !(node1_~m1~0 != ~nomsg~0); {1100#false} is VALID [2020-07-29 03:17:24,977 INFO L280 TraceCheckUtils]: 41: Hoare triple {1100#false} ~mode1~0 := 0; {1100#false} is VALID [2020-07-29 03:17:24,977 INFO L280 TraceCheckUtils]: 42: Hoare triple {1100#false} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:24,978 INFO L280 TraceCheckUtils]: 43: Hoare triple {1100#false} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:24,978 INFO L280 TraceCheckUtils]: 44: Hoare triple {1100#false} assume !(node2_~m2~0 != ~nomsg~0); {1100#false} is VALID [2020-07-29 03:17:24,978 INFO L280 TraceCheckUtils]: 45: Hoare triple {1100#false} ~mode2~0 := 0; {1100#false} is VALID [2020-07-29 03:17:24,979 INFO L280 TraceCheckUtils]: 46: Hoare triple {1100#false} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:24,979 INFO L280 TraceCheckUtils]: 47: Hoare triple {1100#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:24,979 INFO L280 TraceCheckUtils]: 48: Hoare triple {1100#false} assume !(node3_~m3~0 != ~nomsg~0); {1100#false} is VALID [2020-07-29 03:17:24,980 INFO L280 TraceCheckUtils]: 49: Hoare triple {1100#false} ~mode3~0 := 0; {1100#false} is VALID [2020-07-29 03:17:24,980 INFO L280 TraceCheckUtils]: 50: Hoare triple {1100#false} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:24,980 INFO L280 TraceCheckUtils]: 51: Hoare triple {1100#false} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:24,980 INFO L280 TraceCheckUtils]: 52: Hoare triple {1100#false} assume !(node4_~m4~0 != ~nomsg~0); {1100#false} is VALID [2020-07-29 03:17:24,981 INFO L280 TraceCheckUtils]: 53: Hoare triple {1100#false} ~mode4~0 := 0; {1100#false} is VALID [2020-07-29 03:17:24,981 INFO L280 TraceCheckUtils]: 54: Hoare triple {1100#false} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:24,981 INFO L280 TraceCheckUtils]: 55: Hoare triple {1100#false} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1100#false} is VALID [2020-07-29 03:17:24,981 INFO L280 TraceCheckUtils]: 56: Hoare triple {1100#false} assume !(node5_~m5~0 != ~nomsg~0); {1100#false} is VALID [2020-07-29 03:17:24,982 INFO L280 TraceCheckUtils]: 57: Hoare triple {1100#false} ~mode5~0 := 0; {1100#false} is VALID [2020-07-29 03:17:24,982 INFO L280 TraceCheckUtils]: 58: Hoare triple {1100#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1100#false} is VALID [2020-07-29 03:17:24,982 INFO L280 TraceCheckUtils]: 59: Hoare triple {1100#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1100#false} is VALID [2020-07-29 03:17:24,982 INFO L280 TraceCheckUtils]: 60: Hoare triple {1100#false} assume ~r1~0 < 5;check_~tmp~1 := 1; {1100#false} is VALID [2020-07-29 03:17:24,983 INFO L280 TraceCheckUtils]: 61: Hoare triple {1100#false} check_#res := check_~tmp~1; {1100#false} is VALID [2020-07-29 03:17:24,983 INFO L280 TraceCheckUtils]: 62: Hoare triple {1100#false} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1100#false} is VALID [2020-07-29 03:17:24,983 INFO L280 TraceCheckUtils]: 63: Hoare triple {1100#false} assume !(0 == assert_~arg % 256); {1100#false} is VALID [2020-07-29 03:17:24,983 INFO L280 TraceCheckUtils]: 64: Hoare triple {1100#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {1100#false} is VALID [2020-07-29 03:17:24,991 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:17:24,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151482530] [2020-07-29 03:17:24,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:24,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:17:24,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101925662] [2020-07-29 03:17:25,437 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 137 [2020-07-29 03:17:25,879 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 118 [2020-07-29 03:17:25,899 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:25,900 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:25,900 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:25,900 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:25,901 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:17:25,901 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:25,901 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:25,901 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:25,901 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2020-07-29 03:17:25,901 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:25,902 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:25,980 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:17:25,996 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:17:26,001 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:17:26,005 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:17:26,012 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:17:26,016 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:17:26,034 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:17:26,038 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:17:26,045 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:17:26,051 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:17:26,055 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:17:26,058 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:17:26,062 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:17:26,066 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:17:26,069 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:17:26,072 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:17:26,076 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:17:26,083 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:17:26,090 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:17:26,134 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:17:26,142 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:17:26,146 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:17:26,150 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:17:26,154 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:17:26,158 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:17:26,161 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:17:26,165 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:17:26,171 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:17:26,175 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:17:26,182 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:17:26,187 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:17:26,190 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:17:26,194 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:17:26,913 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-29 03:17:27,418 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-29 03:17:27,607 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:27,608 INFO L404 LassoAnalysis]: Checking for nontermination... 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:17:27,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:17:27,618 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:17:27,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:17:27,658 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:17:27,812 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:17:27,816 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:27,816 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:27,816 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:27,816 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:27,816 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:17:27,819 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:27,819 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:27,819 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:27,819 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2020-07-29 03:17:27,819 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:27,819 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:27,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:17:27,883 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:17:27,886 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:17:27,934 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:17:27,939 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:17:27,946 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:17:27,949 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:17:27,954 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:17:27,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:27,977 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:17:27,982 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:17:27,988 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:17:27,991 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:17:27,994 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:17:27,997 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:17:28,002 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:17:28,005 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:17:28,011 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:17:28,019 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:17:28,025 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:17:28,041 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:17:28,057 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:17:28,061 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:17:28,065 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:17:28,073 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:17:28,076 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:17:28,079 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:17:28,082 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:17:28,087 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:17:28,090 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:17:28,099 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:17:28,108 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:17:28,111 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:17:28,594 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-29 03:17:29,098 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-07-29 03:17:29,455 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:29,461 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:29,466 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:17:29,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:29,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:29,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:29,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:29,498 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:17:29,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:29,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:29,512 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:29,536 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:17:29,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:29,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:29,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:29,573 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:17:29,606 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:17:29,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,611 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:29,611 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:29,616 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:17:29,640 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:17:29,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,641 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:29,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:29,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:29,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:29,687 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:17:29,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:29,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:29,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:29,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:17:29,719 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:17:29,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:29,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:29,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:29,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:29,750 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:17:29,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:29,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,752 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:17:29,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,753 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 03:17:29,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:29,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:29,782 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:17:29,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:29,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:29,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:29,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:29,810 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:17:29,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:29,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:29,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:17:29,841 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:17:29,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:29,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:29,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:29,851 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:17:29,875 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:17:29,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:29,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:29,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:29,879 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:17:29,903 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:17:29,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:29,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,906 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:29,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:29,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:29,933 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:17:29,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:29,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:29,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:29,937 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:17:29,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:29,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:29,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:29,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:29,973 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:17:29,995 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:17:29,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:29,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:29,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:29,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:29,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:29,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:30,002 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:17:30,025 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:17:30,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:30,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:30,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:30,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:30,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:30,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:30,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:30,029 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:17:30,061 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:17:30,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:30,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:30,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:30,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:30,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:30,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:30,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:30,066 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) [2020-07-29 03:17:30,091 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:17:30,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:30,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:30,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:30,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:30,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:30,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:30,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:30,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:17:30,109 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:17:30,109 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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) [2020-07-29 03:17:30,115 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:17:30,115 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:17:30,115 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:17:30,116 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:30,177 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:17:30,186 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node1_~m1~0 != ~nomsg~0);" "~mode1~0 := 0;" "havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0 != ~nomsg~0);" "~mode2~0 := 0;" "havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0 != ~nomsg~0);" "~mode3~0 := 0;" "havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0 != ~nomsg~0);" "~mode4~0 := 0;" "havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0 != ~nomsg~0);" "~mode5~0 := 0;" "~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1;" "assume ~r1~0 < 5;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg;" "assume !(0 == assert_~arg % 256);" "main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38;" [2020-07-29 03:17:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:30,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:30,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:17:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:30,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:30,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {1102#unseeded} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; {1102#unseeded} is VALID [2020-07-29 03:17:30,333 INFO L280 TraceCheckUtils]: 1: Hoare triple {1102#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~alive1~0 := main_#t~nondet15;havoc main_#t~nondet15;~id2~0 := main_#t~nondet16;havoc main_#t~nondet16;~st2~0 := main_#t~nondet17;havoc main_#t~nondet17;~send2~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode2~0 := main_#t~nondet19;havoc main_#t~nondet19;~alive2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~alive3~0 := main_#t~nondet25;havoc main_#t~nondet25;~id4~0 := main_#t~nondet26;havoc main_#t~nondet26;~st4~0 := main_#t~nondet27;havoc main_#t~nondet27;~send4~0 := main_#t~nondet28;havoc main_#t~nondet28;~mode4~0 := main_#t~nondet29;havoc main_#t~nondet29;~alive4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~alive5~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,334 INFO L280 TraceCheckUtils]: 2: Hoare triple {1102#unseeded} assume 0 == ~r1~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,335 INFO L280 TraceCheckUtils]: 3: Hoare triple {1102#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1102#unseeded} is VALID [2020-07-29 03:17:30,335 INFO L280 TraceCheckUtils]: 4: Hoare triple {1102#unseeded} assume ~id1~0 >= 0; {1102#unseeded} is VALID [2020-07-29 03:17:30,336 INFO L280 TraceCheckUtils]: 5: Hoare triple {1102#unseeded} assume 0 == ~st1~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,336 INFO L280 TraceCheckUtils]: 6: Hoare triple {1102#unseeded} assume ~send1~0 == ~id1~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,337 INFO L280 TraceCheckUtils]: 7: Hoare triple {1102#unseeded} assume 0 == ~mode1~0 % 256; {1102#unseeded} is VALID [2020-07-29 03:17:30,338 INFO L280 TraceCheckUtils]: 8: Hoare triple {1102#unseeded} assume ~id2~0 >= 0; {1102#unseeded} is VALID [2020-07-29 03:17:30,338 INFO L280 TraceCheckUtils]: 9: Hoare triple {1102#unseeded} assume 0 == ~st2~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,339 INFO L280 TraceCheckUtils]: 10: Hoare triple {1102#unseeded} assume ~send2~0 == ~id2~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,340 INFO L280 TraceCheckUtils]: 11: Hoare triple {1102#unseeded} assume 0 == ~mode2~0 % 256; {1102#unseeded} is VALID [2020-07-29 03:17:30,340 INFO L280 TraceCheckUtils]: 12: Hoare triple {1102#unseeded} assume ~id3~0 >= 0; {1102#unseeded} is VALID [2020-07-29 03:17:30,341 INFO L280 TraceCheckUtils]: 13: Hoare triple {1102#unseeded} assume 0 == ~st3~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,342 INFO L280 TraceCheckUtils]: 14: Hoare triple {1102#unseeded} assume ~send3~0 == ~id3~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,342 INFO L280 TraceCheckUtils]: 15: Hoare triple {1102#unseeded} assume 0 == ~mode3~0 % 256; {1102#unseeded} is VALID [2020-07-29 03:17:30,343 INFO L280 TraceCheckUtils]: 16: Hoare triple {1102#unseeded} assume ~id4~0 >= 0; {1102#unseeded} is VALID [2020-07-29 03:17:30,344 INFO L280 TraceCheckUtils]: 17: Hoare triple {1102#unseeded} assume 0 == ~st4~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,344 INFO L280 TraceCheckUtils]: 18: Hoare triple {1102#unseeded} assume ~send4~0 == ~id4~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,345 INFO L280 TraceCheckUtils]: 19: Hoare triple {1102#unseeded} assume 0 == ~mode4~0 % 256; {1102#unseeded} is VALID [2020-07-29 03:17:30,346 INFO L280 TraceCheckUtils]: 20: Hoare triple {1102#unseeded} assume ~id5~0 >= 0; {1102#unseeded} is VALID [2020-07-29 03:17:30,346 INFO L280 TraceCheckUtils]: 21: Hoare triple {1102#unseeded} assume 0 == ~st5~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,347 INFO L280 TraceCheckUtils]: 22: Hoare triple {1102#unseeded} assume ~send5~0 == ~id5~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,347 INFO L280 TraceCheckUtils]: 23: Hoare triple {1102#unseeded} assume 0 == ~mode5~0 % 256; {1102#unseeded} is VALID [2020-07-29 03:17:30,348 INFO L280 TraceCheckUtils]: 24: Hoare triple {1102#unseeded} assume ~id1~0 != ~id2~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,349 INFO L280 TraceCheckUtils]: 25: Hoare triple {1102#unseeded} assume ~id1~0 != ~id3~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,349 INFO L280 TraceCheckUtils]: 26: Hoare triple {1102#unseeded} assume ~id1~0 != ~id4~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,350 INFO L280 TraceCheckUtils]: 27: Hoare triple {1102#unseeded} assume ~id1~0 != ~id5~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,351 INFO L280 TraceCheckUtils]: 28: Hoare triple {1102#unseeded} assume ~id2~0 != ~id3~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,351 INFO L280 TraceCheckUtils]: 29: Hoare triple {1102#unseeded} assume ~id2~0 != ~id4~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,352 INFO L280 TraceCheckUtils]: 30: Hoare triple {1102#unseeded} assume ~id2~0 != ~id5~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,353 INFO L280 TraceCheckUtils]: 31: Hoare triple {1102#unseeded} assume ~id3~0 != ~id4~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,353 INFO L280 TraceCheckUtils]: 32: Hoare triple {1102#unseeded} assume ~id3~0 != ~id5~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,354 INFO L280 TraceCheckUtils]: 33: Hoare triple {1102#unseeded} assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; {1102#unseeded} is VALID [2020-07-29 03:17:30,354 INFO L280 TraceCheckUtils]: 34: Hoare triple {1102#unseeded} init_#res := init_~tmp~0; {1102#unseeded} is VALID [2020-07-29 03:17:30,355 INFO L280 TraceCheckUtils]: 35: Hoare triple {1102#unseeded} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1102#unseeded} is VALID [2020-07-29 03:17:30,356 INFO L280 TraceCheckUtils]: 36: Hoare triple {1102#unseeded} assume !(0 == assume_abort_if_not_~cond); {1102#unseeded} is VALID [2020-07-29 03:17:30,356 INFO L280 TraceCheckUtils]: 37: Hoare triple {1102#unseeded} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; {1102#unseeded} is VALID [2020-07-29 03:17:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:30,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:17:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:30,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:30,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {1105#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 19))} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node1_~m1~0 != ~nomsg~0); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,459 INFO L280 TraceCheckUtils]: 3: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,460 INFO L280 TraceCheckUtils]: 4: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,460 INFO L280 TraceCheckUtils]: 5: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,461 INFO L280 TraceCheckUtils]: 6: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node2_~m2~0 != ~nomsg~0); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,462 INFO L280 TraceCheckUtils]: 7: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,463 INFO L280 TraceCheckUtils]: 8: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,464 INFO L280 TraceCheckUtils]: 9: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,464 INFO L280 TraceCheckUtils]: 10: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node3_~m3~0 != ~nomsg~0); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,465 INFO L280 TraceCheckUtils]: 11: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,466 INFO L280 TraceCheckUtils]: 12: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,467 INFO L280 TraceCheckUtils]: 13: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,468 INFO L280 TraceCheckUtils]: 14: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node4_~m4~0 != ~nomsg~0); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,468 INFO L280 TraceCheckUtils]: 15: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,469 INFO L280 TraceCheckUtils]: 16: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,470 INFO L280 TraceCheckUtils]: 17: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,471 INFO L280 TraceCheckUtils]: 18: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node5_~m5~0 != ~nomsg~0); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,472 INFO L280 TraceCheckUtils]: 19: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode5~0 := 0; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,473 INFO L280 TraceCheckUtils]: 20: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,474 INFO L280 TraceCheckUtils]: 21: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,475 INFO L280 TraceCheckUtils]: 22: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 5;check_~tmp~1 := 1; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,476 INFO L280 TraceCheckUtils]: 23: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,477 INFO L280 TraceCheckUtils]: 24: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,478 INFO L280 TraceCheckUtils]: 25: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:30,479 INFO L280 TraceCheckUtils]: 26: Hoare triple {1231#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {1115#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 19)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:17:30,479 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:17:30,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:17:30,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:30,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:30,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:30,519 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:17:30,520 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 162 transitions. cyclomatic complexity: 47 Second operand 3 states. [2020-07-29 03:17:30,983 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 162 transitions. cyclomatic complexity: 47. Second operand 3 states. Result 194 states and 287 transitions. Complement of second has 4 states. [2020-07-29 03:17:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:17:30,983 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:17:30,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 162 transitions. cyclomatic complexity: 47 [2020-07-29 03:17:30,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:30,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:30,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:17:30,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:30,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:30,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:30,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. [2020-07-29 03:17:30,999 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:30,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:31,003 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 116 states and 162 transitions. cyclomatic complexity: 47 [2020-07-29 03:17:31,071 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 78 examples of accepted words. [2020-07-29 03:17:31,072 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:17:31,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:31,077 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:17:31,077 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2020-07-29 03:17:31,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2020-07-29 03:17:31,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:31,077 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:17:31,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:31,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:31,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:31,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:31,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:31,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:31,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 194 letters. Loop has 194 letters. [2020-07-29 03:17:31,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 194 letters. Loop has 194 letters. [2020-07-29 03:17:31,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 194 letters. Loop has 194 letters. [2020-07-29 03:17:31,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 116 letters. Loop has 116 letters. [2020-07-29 03:17:31,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 116 letters. Loop has 116 letters. [2020-07-29 03:17:31,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 116 letters. Loop has 116 letters. [2020-07-29 03:17:31,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:31,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:31,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:31,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:31,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:31,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:31,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 30 letters. [2020-07-29 03:17:31,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 30 letters. [2020-07-29 03:17:31,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 30 letters. [2020-07-29 03:17:31,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 28 letters. [2020-07-29 03:17:31,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 28 letters. [2020-07-29 03:17:31,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 28 letters. [2020-07-29 03:17:31,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:17:31,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:17:31,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 27 letters. [2020-07-29 03:17:31,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:17:31,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:17:31,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 27 letters. [2020-07-29 03:17:31,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:31,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:31,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:31,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:17:31,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:17:31,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 27 letters. [2020-07-29 03:17:31,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:17:31,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:17:31,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 27 letters. [2020-07-29 03:17:31,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:17:31,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:17:31,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 27 letters. [2020-07-29 03:17:31,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 61 letters. Loop has 28 letters. [2020-07-29 03:17:31,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 28 letters. [2020-07-29 03:17:31,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 28 letters. [2020-07-29 03:17:31,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:17:31,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:17:31,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 27 letters. [2020-07-29 03:17:31,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:31,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:31,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:31,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:31,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:31,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 27 letters. [2020-07-29 03:17:31,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:31,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:31,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 40 letters. Loop has 27 letters. [2020-07-29 03:17:31,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:31,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:31,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 28 letters. [2020-07-29 03:17:31,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:17:31,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:17:31,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 27 letters. [2020-07-29 03:17:31,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:17:31,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:17:31,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 27 letters. [2020-07-29 03:17:31,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 39 letters. Loop has 27 letters. [2020-07-29 03:17:31,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 27 letters. [2020-07-29 03:17:31,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 39 letters. Loop has 27 letters. [2020-07-29 03:17:31,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 40 letters. Loop has 28 letters. [2020-07-29 03:17:31,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 28 letters. [2020-07-29 03:17:31,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 40 letters. Loop has 28 letters. [2020-07-29 03:17:31,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:17:31,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:17:31,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:17:31,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:31,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:31,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:31,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:31,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:31,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:31,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:31,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:31,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:31,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:17:31,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:17:31,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 27 letters. [2020-07-29 03:17:31,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:17:31,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:17:31,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 27 letters. [2020-07-29 03:17:31,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:17:31,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:17:31,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 27 letters. [2020-07-29 03:17:31,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:31,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:31,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:31,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:31,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:31,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 30 letters. [2020-07-29 03:17:31,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 28 letters. [2020-07-29 03:17:31,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 28 letters. [2020-07-29 03:17:31,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 28 letters. [2020-07-29 03:17:31,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:17:31,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:17:31,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 27 letters. [2020-07-29 03:17:31,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 30 letters. [2020-07-29 03:17:31,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 30 letters. [2020-07-29 03:17:31,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 30 letters. [2020-07-29 03:17:31,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:31,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:31,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 28 letters. [2020-07-29 03:17:31,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:17:31,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:17:31,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 30 letters. [2020-07-29 03:17:31,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:31,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:31,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:31,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 28 letters. [2020-07-29 03:17:31,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 28 letters. [2020-07-29 03:17:31,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 28 letters. [2020-07-29 03:17:31,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:31,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:31,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:31,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:17:31,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:17:31,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:17:31,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:31,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:31,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:31,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:17:31,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:17:31,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 27 letters. [2020-07-29 03:17:31,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:17:31,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:17:31,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2020-07-29 03:17:31,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 48 letters. Loop has 28 letters. [2020-07-29 03:17:31,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 28 letters. [2020-07-29 03:17:31,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 28 letters. [2020-07-29 03:17:31,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:31,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:31,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:31,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:17:31,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:17:31,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 27 letters. [2020-07-29 03:17:31,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:31,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:31,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:31,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:31,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:31,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:17:31,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:31,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:31,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:31,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:17:31,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:17:31,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:17:31,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:31,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:31,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2020-07-29 03:17:31,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 28 letters. [2020-07-29 03:17:31,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 28 letters. [2020-07-29 03:17:31,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 28 letters. [2020-07-29 03:17:31,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:17:31,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:17:31,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 27 letters. [2020-07-29 03:17:31,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:17:31,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:17:31,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 27 letters. [2020-07-29 03:17:31,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:17:31,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:17:31,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 27 letters. [2020-07-29 03:17:31,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:31,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:31,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:31,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:31,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:31,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:31,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:31,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:31,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 30 letters. [2020-07-29 03:17:31,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:31,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:31,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 28 letters. [2020-07-29 03:17:31,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:31,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:31,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:17:31,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:31,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:31,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:31,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 56 letters. Loop has 28 letters. [2020-07-29 03:17:31,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 28 letters. [2020-07-29 03:17:31,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 28 letters. [2020-07-29 03:17:31,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:31,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:31,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 28 letters. [2020-07-29 03:17:31,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:17:31,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:17:31,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2020-07-29 03:17:31,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 27 letters. [2020-07-29 03:17:31,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 27 letters. [2020-07-29 03:17:31,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 27 letters. [2020-07-29 03:17:31,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:17:31,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:17:31,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 27 letters. [2020-07-29 03:17:31,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:17:31,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:17:31,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 27 letters. [2020-07-29 03:17:31,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:31,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:31,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:17:31,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 44 letters. Loop has 28 letters. [2020-07-29 03:17:31,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 28 letters. [2020-07-29 03:17:31,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 44 letters. Loop has 28 letters. [2020-07-29 03:17:31,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:31,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:31,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2020-07-29 03:17:31,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 44 letters. Loop has 27 letters. [2020-07-29 03:17:31,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 27 letters. [2020-07-29 03:17:31,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 44 letters. Loop has 27 letters. [2020-07-29 03:17:31,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:17:31,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:17:31,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:17:31,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:31,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:31,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:17:31,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 52 letters. Loop has 28 letters. [2020-07-29 03:17:31,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 28 letters. [2020-07-29 03:17:31,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 28 letters. [2020-07-29 03:17:31,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:17:31,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:17:31,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:17:31,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:31,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:31,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 28 letters. [2020-07-29 03:17:31,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:31,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:31,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:17:31,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:17:31,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:17:31,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 27 letters. [2020-07-29 03:17:31,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:31,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:31,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2020-07-29 03:17:31,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 28 letters. [2020-07-29 03:17:31,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 28 letters. [2020-07-29 03:17:31,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 28 letters. [2020-07-29 03:17:31,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 27 letters. [2020-07-29 03:17:31,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 27 letters. [2020-07-29 03:17:31,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 27 letters. [2020-07-29 03:17:31,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:31,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:31,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:31,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,247 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:17:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:17:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-29 03:17:31,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 38 letters. Loop has 27 letters. [2020-07-29 03:17:31,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 65 letters. Loop has 27 letters. [2020-07-29 03:17:31,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 38 letters. Loop has 54 letters. [2020-07-29 03:17:31,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:31,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2020-07-29 03:17:31,267 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:31,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 0 states and 0 transitions. [2020-07-29 03:17:31,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:17:31,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:17:31,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:17:31,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:31,268 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:31,268 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:31,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:31,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:17:31,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:17:31,269 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:17:31,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:31,270 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:17:31,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:17:31,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:17:31,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:31,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:17:31,358 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:31,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:17:31,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:17:31,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:17:31,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:17:31,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:31,359 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:31,359 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:31,359 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:31,359 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:17:31,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:17:31,359 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:31,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:31,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:17:31 BoogieIcfgContainer [2020-07-29 03:17:31,377 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:17:31,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:17:31,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:17:31,378 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:17:31,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:22" (3/4) ... [2020-07-29 03:17:31,383 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:17:31,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:17:31,386 INFO L168 Benchmark]: Toolchain (without parser) took 11039.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 961.6 MB in the beginning and 1.0 GB in the end (delta: -48.6 MB). Peak memory consumption was 260.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:31,387 INFO L168 Benchmark]: CDTParser took 0.24 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:17:31,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:31,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:31,393 INFO L168 Benchmark]: Boogie Preprocessor took 70.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:17:31,397 INFO L168 Benchmark]: RCFGBuilder took 1029.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.1 MB). Peak memory consumption was 86.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:31,397 INFO L168 Benchmark]: BuchiAutomizer took 9238.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.5 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:31,399 INFO L168 Benchmark]: Witness Printer took 5.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:17:31,406 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.24 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 598.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1029.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.1 MB). Peak memory consumption was 86.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9238.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 190.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.5 MB). Peak memory consumption was 193.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.62 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 6.3s. Construction of modules took 0.0s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 116 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 521 SDtfs, 263 SDslu, 1164 SDs, 0 SdLazy, 26 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax135 hnf108 lsp25 ukn100 mio100 lsp100 div103 bol100 ite100 ukn100 eq221 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...