./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.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.6.1.ufo.BOUNDED-12.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 11584edddf9ae23b531664348aa5f35937f7d50d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:19:08,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:19:08,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:19:08,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:19:08,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:19:08,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:19:08,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:19:08,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:19:08,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:19:08,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:19:08,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:19:08,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:19:08,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:19:08,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:19:08,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:19:08,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:19:08,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:19:08,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:19:08,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:19:08,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:19:08,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:19:08,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:19:08,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:19:08,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:19:08,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:19:08,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:19:08,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:19:08,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:19:08,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:19:08,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:19:08,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:19:08,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:19:08,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:19:08,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:19:08,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:19:08,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:19:08,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:19:08,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:19:08,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:19:08,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:19:08,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:19:08,866 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:19:08,903 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:19:08,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:19:08,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:19:08,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:19:08,914 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:19:08,914 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:19:08,915 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:19:08,917 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:19:08,918 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:19:08,918 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:19:08,918 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:19:08,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:19:08,919 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:19:08,919 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:19:08,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:19:08,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:19:08,920 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:19:08,920 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:19:08,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:19:08,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:19:08,921 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:19:08,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:19:08,922 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:19:08,922 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:19:08,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:19:08,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:19:08,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:19:08,923 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:19:08,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:19:08,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:19:08,925 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:19:08,926 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:19:08,927 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:19:08,928 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 -> 11584edddf9ae23b531664348aa5f35937f7d50d [2020-07-29 03:19:09,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:19:09,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:19:09,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:19:09,331 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:19:09,333 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:19:09,334 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2020-07-29 03:19:09,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921085e90/97e58bbe19aa4a44addc6e0fa05c9aac/FLAG8e3743881 [2020-07-29 03:19:09,900 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:19:09,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2020-07-29 03:19:09,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921085e90/97e58bbe19aa4a44addc6e0fa05c9aac/FLAG8e3743881 [2020-07-29 03:19:10,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921085e90/97e58bbe19aa4a44addc6e0fa05c9aac [2020-07-29 03:19:10,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:19:10,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:19:10,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:19:10,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:19:10,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:19:10,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:19:10" (1/1) ... [2020-07-29 03:19:10,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cdd5219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:19:10, skipping insertion in model container [2020-07-29 03:19:10,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:19:10" (1/1) ... [2020-07-29 03:19:10,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:19:10,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:19:10,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:19:10,788 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:19:10,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:19:10,913 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:19:10,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:19:10 WrapperNode [2020-07-29 03:19:10,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:19:10,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:19:10,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:19:10,916 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:19:10,924 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:19:10" (1/1) ... [2020-07-29 03:19:10,936 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:19:10" (1/1) ... [2020-07-29 03:19:10,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:19:10,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:19:10,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:19:10,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:19:11,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:19:10" (1/1) ... [2020-07-29 03:19:11,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:19:10" (1/1) ... [2020-07-29 03:19:11,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:19:10" (1/1) ... [2020-07-29 03:19:11,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:19:10" (1/1) ... [2020-07-29 03:19:11,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:19:10" (1/1) ... [2020-07-29 03:19:11,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:19:10" (1/1) ... [2020-07-29 03:19:11,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:19:10" (1/1) ... [2020-07-29 03:19:11,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:19:11,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:19:11,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:19:11,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:19:11,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:19:10" (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:19:11,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:19:11,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:19:12,108 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:19:12,109 INFO L295 CfgBuilder]: Removed 25 assume(true) statements. [2020-07-29 03:19:12,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:19:12 BoogieIcfgContainer [2020-07-29 03:19:12,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:19:12,124 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:19:12,125 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:19:12,129 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:19:12,130 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:19:12,130 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:19:10" (1/3) ... [2020-07-29 03:19:12,132 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc08afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:19:12, skipping insertion in model container [2020-07-29 03:19:12,132 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:19:12,132 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:19:10" (2/3) ... [2020-07-29 03:19:12,133 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cc08afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:19:12, skipping insertion in model container [2020-07-29 03:19:12,133 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:19:12,133 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:19:12" (3/3) ... [2020-07-29 03:19:12,135 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2020-07-29 03:19:12,194 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:19:12,194 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:19:12,194 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:19:12,196 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:19:12,196 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:19:12,196 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:19:12,197 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:19:12,197 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:19:12,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states. [2020-07-29 03:19:12,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2020-07-29 03:19:12,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:19:12,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:19:12,302 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:19:12,302 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, 1, 1, 1] [2020-07-29 03:19:12,302 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:19:12,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states. [2020-07-29 03:19:12,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2020-07-29 03:19:12,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:19:12,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:19:12,318 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:19:12,318 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, 1, 1, 1] [2020-07-29 03:19:12,328 INFO L794 eck$LassoCheckResult]: Stem: 83#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 10#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 12#L277true assume !(0 == ~r1~0);init_~tmp~0 := 0; 105#L277-1true init_#res := init_~tmp~0; 59#L438true main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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; 43#L67true assume !(0 == assume_abort_if_not_~cond); 87#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 21#L516-2true [2020-07-29 03:19:12,329 INFO L796 eck$LassoCheckResult]: Loop: 21#L516-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 101#L123true assume !(0 != ~mode1~0 % 256); 27#L139true assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; 9#L139-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 111#L123-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 96#L151true assume !(0 != ~mode2~0 % 256); 18#L164true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 16#L164-2true ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 95#L151-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 75#L176true assume !(0 != ~mode3~0 % 256); 103#L189true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 102#L189-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 88#L176-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 61#L201true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 67#L204true assume !(node4_~m4~0 != ~nomsg~0); 65#L204-1true ~mode4~0 := 0; 57#L201-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 69#L226true assume !(0 != ~mode5~0 % 256); 90#L239true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 99#L239-2true ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 64#L226-2true havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 45#L251true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 36#L254true assume !(node6_~m6~0 != ~nomsg~0); 35#L254-1true ~mode6~0 := 0; 54#L251-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 63#L446true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 66#L446-1true check_#res := check_~tmp~1; 38#L466true main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 32#L549true assume !(0 == assert_~arg % 256); 8#L544true main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 21#L516-2true [2020-07-29 03:19:12,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:19:12,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2030119858, now seen corresponding path program 1 times [2020-07-29 03:19:12,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:19:12,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365204334] [2020-07-29 03:19:12,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:19:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:12,621 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {113#true} is VALID [2020-07-29 03:19:12,622 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {113#true} is VALID [2020-07-29 03:19:12,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {113#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {115#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:19:12,625 INFO L280 TraceCheckUtils]: 3: Hoare triple {115#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {116#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:19:12,627 INFO L280 TraceCheckUtils]: 4: Hoare triple {116#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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; {117#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:19:12,628 INFO L280 TraceCheckUtils]: 5: Hoare triple {117#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {114#false} is VALID [2020-07-29 03:19:12,628 INFO L280 TraceCheckUtils]: 6: Hoare triple {114#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {114#false} is VALID [2020-07-29 03:19:12,631 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:19:12,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365204334] [2020-07-29 03:19:12,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:19:12,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:19:12,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191370001] [2020-07-29 03:19:12,640 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:19:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:19:12,641 INFO L82 PathProgramCache]: Analyzing trace with hash 408550741, now seen corresponding path program 1 times [2020-07-29 03:19:12,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:19:12,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288369550] [2020-07-29 03:19:12,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:19:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:12,931 INFO L280 TraceCheckUtils]: 0: Hoare triple {118#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {118#true} is VALID [2020-07-29 03:19:12,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#true} assume !(0 != ~mode1~0 % 256); {118#true} is VALID [2020-07-29 03:19:12,932 INFO L280 TraceCheckUtils]: 2: Hoare triple {118#true} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; {118#true} is VALID [2020-07-29 03:19:12,932 INFO L280 TraceCheckUtils]: 3: Hoare triple {118#true} ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; {118#true} is VALID [2020-07-29 03:19:12,932 INFO L280 TraceCheckUtils]: 4: Hoare triple {118#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {118#true} is VALID [2020-07-29 03:19:12,933 INFO L280 TraceCheckUtils]: 5: Hoare triple {118#true} assume !(0 != ~mode2~0 % 256); {118#true} is VALID [2020-07-29 03:19:12,933 INFO L280 TraceCheckUtils]: 6: Hoare triple {118#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {118#true} is VALID [2020-07-29 03:19:12,934 INFO L280 TraceCheckUtils]: 7: Hoare triple {118#true} ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; {118#true} is VALID [2020-07-29 03:19:12,934 INFO L280 TraceCheckUtils]: 8: Hoare triple {118#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {118#true} is VALID [2020-07-29 03:19:12,934 INFO L280 TraceCheckUtils]: 9: Hoare triple {118#true} assume !(0 != ~mode3~0 % 256); {118#true} is VALID [2020-07-29 03:19:12,935 INFO L280 TraceCheckUtils]: 10: Hoare triple {118#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; {118#true} is VALID [2020-07-29 03:19:12,935 INFO L280 TraceCheckUtils]: 11: Hoare triple {118#true} ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; {118#true} is VALID [2020-07-29 03:19:12,935 INFO L280 TraceCheckUtils]: 12: Hoare triple {118#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {118#true} is VALID [2020-07-29 03:19:12,936 INFO L280 TraceCheckUtils]: 13: Hoare triple {118#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {118#true} is VALID [2020-07-29 03:19:12,936 INFO L280 TraceCheckUtils]: 14: Hoare triple {118#true} assume !(node4_~m4~0 != ~nomsg~0); {118#true} is VALID [2020-07-29 03:19:12,937 INFO L280 TraceCheckUtils]: 15: Hoare triple {118#true} ~mode4~0 := 0; {118#true} is VALID [2020-07-29 03:19:12,937 INFO L280 TraceCheckUtils]: 16: Hoare triple {118#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {118#true} is VALID [2020-07-29 03:19:12,937 INFO L280 TraceCheckUtils]: 17: Hoare triple {118#true} assume !(0 != ~mode5~0 % 256); {118#true} is VALID [2020-07-29 03:19:12,938 INFO L280 TraceCheckUtils]: 18: Hoare triple {118#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; {118#true} is VALID [2020-07-29 03:19:12,938 INFO L280 TraceCheckUtils]: 19: Hoare triple {118#true} ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; {118#true} is VALID [2020-07-29 03:19:12,939 INFO L280 TraceCheckUtils]: 20: Hoare triple {118#true} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {118#true} is VALID [2020-07-29 03:19:12,939 INFO L280 TraceCheckUtils]: 21: Hoare triple {118#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {118#true} is VALID [2020-07-29 03:19:12,939 INFO L280 TraceCheckUtils]: 22: Hoare triple {118#true} assume !(node6_~m6~0 != ~nomsg~0); {118#true} is VALID [2020-07-29 03:19:12,940 INFO L280 TraceCheckUtils]: 23: Hoare triple {118#true} ~mode6~0 := 0; {118#true} is VALID [2020-07-29 03:19:12,940 INFO L280 TraceCheckUtils]: 24: Hoare triple {118#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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {118#true} is VALID [2020-07-29 03:19:12,941 INFO L280 TraceCheckUtils]: 25: Hoare triple {118#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; {120#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:19:12,942 INFO L280 TraceCheckUtils]: 26: Hoare triple {120#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {121#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:19:12,944 INFO L280 TraceCheckUtils]: 27: Hoare triple {121#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {122#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:19:12,946 INFO L280 TraceCheckUtils]: 28: Hoare triple {122#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {119#false} is VALID [2020-07-29 03:19:12,946 INFO L280 TraceCheckUtils]: 29: Hoare triple {119#false} main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; {119#false} is VALID [2020-07-29 03:19:12,951 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:19:12,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288369550] [2020-07-29 03:19:12,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:19:12,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:19:12,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297737008] [2020-07-29 03:19:12,954 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:19:12,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:19:12,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:19:12,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:19:12,976 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 5 states. [2020-07-29 03:19:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:19:13,632 INFO L93 Difference]: Finished difference Result 112 states and 186 transitions. [2020-07-29 03:19:13,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:19:13,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:19:13,648 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:19:13,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 186 transitions. [2020-07-29 03:19:13,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2020-07-29 03:19:13,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 104 states and 139 transitions. [2020-07-29 03:19:13,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2020-07-29 03:19:13,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2020-07-29 03:19:13,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 139 transitions. [2020-07-29 03:19:13,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:19:13,675 INFO L688 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2020-07-29 03:19:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 139 transitions. [2020-07-29 03:19:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-07-29 03:19:13,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:19:13,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states and 139 transitions. Second operand 104 states. [2020-07-29 03:19:13,715 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states and 139 transitions. Second operand 104 states. [2020-07-29 03:19:13,717 INFO L87 Difference]: Start difference. First operand 104 states and 139 transitions. Second operand 104 states. [2020-07-29 03:19:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:19:13,725 INFO L93 Difference]: Finished difference Result 104 states and 139 transitions. [2020-07-29 03:19:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 139 transitions. [2020-07-29 03:19:13,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:19:13,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:19:13,728 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states and 139 transitions. [2020-07-29 03:19:13,728 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states and 139 transitions. [2020-07-29 03:19:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:19:13,735 INFO L93 Difference]: Finished difference Result 104 states and 139 transitions. [2020-07-29 03:19:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 139 transitions. [2020-07-29 03:19:13,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:19:13,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:19:13,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:19:13,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:19:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-29 03:19:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 139 transitions. [2020-07-29 03:19:13,745 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2020-07-29 03:19:13,745 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2020-07-29 03:19:13,745 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:19:13,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 139 transitions. [2020-07-29 03:19:13,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2020-07-29 03:19:13,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:19:13,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:19:13,751 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:19:13,751 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, 1, 1, 1] [2020-07-29 03:19:13,752 INFO L794 eck$LassoCheckResult]: Stem: 337#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 254#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 255#L277 assume 0 == ~r1~0; 259#L278 assume ~id1~0 >= 0; 300#L279 assume 0 == ~st1~0; 301#L280 assume ~send1~0 == ~id1~0; 330#L281 assume 0 == ~mode1~0 % 256; 271#L282 assume ~id2~0 >= 0; 272#L283 assume 0 == ~st2~0; 311#L284 assume ~send2~0 == ~id2~0; 244#L285 assume 0 == ~mode2~0 % 256; 245#L286 assume ~id3~0 >= 0; 314#L287 assume 0 == ~st3~0; 260#L288 assume ~send3~0 == ~id3~0; 261#L289 assume 0 == ~mode3~0 % 256; 302#L290 assume ~id4~0 >= 0; 303#L291 assume 0 == ~st4~0; 332#L292 assume ~send4~0 == ~id4~0; 273#L293 assume 0 == ~mode4~0 % 256; 274#L294 assume ~id5~0 >= 0; 312#L295 assume 0 == ~st5~0; 248#L296 assume ~send5~0 == ~id5~0; 249#L297 assume 0 == ~mode5~0 % 256; 315#L298 assume ~id6~0 >= 0; 264#L299 assume 0 == ~st6~0; 265#L300 assume ~send6~0 == ~id6~0; 304#L301 assume 0 == ~mode6~0 % 256; 305#L302 assume ~id1~0 != ~id2~0; 319#L303 assume ~id1~0 != ~id3~0; 289#L304 assume ~id1~0 != ~id4~0; 290#L305 assume ~id1~0 != ~id5~0; 316#L306 assume ~id1~0 != ~id6~0; 262#L307 assume ~id2~0 != ~id3~0; 263#L308 assume ~id2~0 != ~id4~0; 313#L309 assume ~id2~0 != ~id5~0; 246#L310 assume ~id2~0 != ~id6~0; 247#L311 assume ~id3~0 != ~id4~0; 292#L312 assume ~id3~0 != ~id5~0; 293#L313 assume ~id3~0 != ~id6~0; 331#L314 assume ~id4~0 != ~id5~0; 287#L315 assume ~id4~0 != ~id6~0; 288#L316 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 340#L277-1 init_#res := init_~tmp~0; 323#L438 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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; 306#L67 assume !(0 == assume_abort_if_not_~cond); 307#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 251#L516-2 [2020-07-29 03:19:13,752 INFO L796 eck$LassoCheckResult]: Loop: 251#L516-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 275#L123 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 328#L127 assume !(node1_~m1~0 != ~nomsg~0); 269#L127-1 ~mode1~0 := 0; 253#L123-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 341#L151 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 333#L154 assume !(node2_~m2~0 != ~nomsg~0); 280#L154-1 ~mode2~0 := 0; 267#L151-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 334#L176 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 324#L179 assume !(node3_~m3~0 != ~nomsg~0); 282#L179-1 ~mode3~0 := 0; 322#L176-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 325#L201 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 326#L204 assume !(node4_~m4~0 != ~nomsg~0); 240#L204-1 ~mode4~0 := 0; 320#L201-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 321#L226 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 308#L229 assume !(node5_~m5~0 != ~nomsg~0); 242#L229-1 ~mode5~0 := 0; 318#L226-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 309#L251 assume !(0 != ~mode6~0 % 256); 310#L264 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 336#L264-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 295#L251-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 317#L446 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 277#L446-1 check_#res := check_~tmp~1; 298#L466 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 291#L549 assume !(0 == assert_~arg % 256); 250#L544 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 251#L516-2 [2020-07-29 03:19:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:19:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 1 times [2020-07-29 03:19:13,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:19:13,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505853122] [2020-07-29 03:19:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:19:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:19:13,826 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:19:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:19:13,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:19:13,937 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:19:13,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:19:13,938 INFO L82 PathProgramCache]: Analyzing trace with hash 930294581, now seen corresponding path program 1 times [2020-07-29 03:19:13,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:19:13,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017678675] [2020-07-29 03:19:13,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:19:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:14,053 INFO L280 TraceCheckUtils]: 0: Hoare triple {556#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {556#true} is VALID [2020-07-29 03:19:14,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {556#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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {556#true} is VALID [2020-07-29 03:19:14,054 INFO L280 TraceCheckUtils]: 2: Hoare triple {556#true} assume !(node1_~m1~0 != ~nomsg~0); {556#true} is VALID [2020-07-29 03:19:14,054 INFO L280 TraceCheckUtils]: 3: Hoare triple {556#true} ~mode1~0 := 0; {556#true} is VALID [2020-07-29 03:19:14,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {556#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {556#true} is VALID [2020-07-29 03:19:14,054 INFO L280 TraceCheckUtils]: 5: Hoare triple {556#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {556#true} is VALID [2020-07-29 03:19:14,055 INFO L280 TraceCheckUtils]: 6: Hoare triple {556#true} assume !(node2_~m2~0 != ~nomsg~0); {556#true} is VALID [2020-07-29 03:19:14,055 INFO L280 TraceCheckUtils]: 7: Hoare triple {556#true} ~mode2~0 := 0; {556#true} is VALID [2020-07-29 03:19:14,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {556#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {556#true} is VALID [2020-07-29 03:19:14,056 INFO L280 TraceCheckUtils]: 9: Hoare triple {556#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {556#true} is VALID [2020-07-29 03:19:14,056 INFO L280 TraceCheckUtils]: 10: Hoare triple {556#true} assume !(node3_~m3~0 != ~nomsg~0); {556#true} is VALID [2020-07-29 03:19:14,056 INFO L280 TraceCheckUtils]: 11: Hoare triple {556#true} ~mode3~0 := 0; {556#true} is VALID [2020-07-29 03:19:14,057 INFO L280 TraceCheckUtils]: 12: Hoare triple {556#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {556#true} is VALID [2020-07-29 03:19:14,057 INFO L280 TraceCheckUtils]: 13: Hoare triple {556#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {556#true} is VALID [2020-07-29 03:19:14,057 INFO L280 TraceCheckUtils]: 14: Hoare triple {556#true} assume !(node4_~m4~0 != ~nomsg~0); {556#true} is VALID [2020-07-29 03:19:14,058 INFO L280 TraceCheckUtils]: 15: Hoare triple {556#true} ~mode4~0 := 0; {556#true} is VALID [2020-07-29 03:19:14,058 INFO L280 TraceCheckUtils]: 16: Hoare triple {556#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {556#true} is VALID [2020-07-29 03:19:14,058 INFO L280 TraceCheckUtils]: 17: Hoare triple {556#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {556#true} is VALID [2020-07-29 03:19:14,059 INFO L280 TraceCheckUtils]: 18: Hoare triple {556#true} assume !(node5_~m5~0 != ~nomsg~0); {556#true} is VALID [2020-07-29 03:19:14,059 INFO L280 TraceCheckUtils]: 19: Hoare triple {556#true} ~mode5~0 := 0; {556#true} is VALID [2020-07-29 03:19:14,059 INFO L280 TraceCheckUtils]: 20: Hoare triple {556#true} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {556#true} is VALID [2020-07-29 03:19:14,060 INFO L280 TraceCheckUtils]: 21: Hoare triple {556#true} assume !(0 != ~mode6~0 % 256); {556#true} is VALID [2020-07-29 03:19:14,060 INFO L280 TraceCheckUtils]: 22: Hoare triple {556#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; {556#true} is VALID [2020-07-29 03:19:14,060 INFO L280 TraceCheckUtils]: 23: Hoare triple {556#true} ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; {556#true} is VALID [2020-07-29 03:19:14,061 INFO L280 TraceCheckUtils]: 24: Hoare triple {556#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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {556#true} is VALID [2020-07-29 03:19:14,062 INFO L280 TraceCheckUtils]: 25: Hoare triple {556#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; {558#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:19:14,065 INFO L280 TraceCheckUtils]: 26: Hoare triple {558#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {559#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:19:14,066 INFO L280 TraceCheckUtils]: 27: Hoare triple {559#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {560#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:19:14,067 INFO L280 TraceCheckUtils]: 28: Hoare triple {560#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {557#false} is VALID [2020-07-29 03:19:14,067 INFO L280 TraceCheckUtils]: 29: Hoare triple {557#false} main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; {557#false} is VALID [2020-07-29 03:19:14,069 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:19:14,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017678675] [2020-07-29 03:19:14,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:19:14,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:19:14,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87685042] [2020-07-29 03:19:14,070 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:19:14,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:19:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:19:14,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:19:14,071 INFO L87 Difference]: Start difference. First operand 104 states and 139 transitions. cyclomatic complexity: 36 Second operand 5 states. [2020-07-29 03:19:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:19:14,558 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2020-07-29 03:19:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:19:14,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:19:14,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:19:14,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 141 transitions. [2020-07-29 03:19:14,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2020-07-29 03:19:14,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 104 states and 136 transitions. [2020-07-29 03:19:14,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2020-07-29 03:19:14,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2020-07-29 03:19:14,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 136 transitions. [2020-07-29 03:19:14,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:19:14,624 INFO L688 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2020-07-29 03:19:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 136 transitions. [2020-07-29 03:19:14,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-07-29 03:19:14,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:19:14,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states and 136 transitions. Second operand 104 states. [2020-07-29 03:19:14,631 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states and 136 transitions. Second operand 104 states. [2020-07-29 03:19:14,631 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 104 states. [2020-07-29 03:19:14,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:19:14,636 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2020-07-29 03:19:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2020-07-29 03:19:14,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:19:14,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:19:14,637 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 104 states and 136 transitions. [2020-07-29 03:19:14,638 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 104 states and 136 transitions. [2020-07-29 03:19:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:19:14,642 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2020-07-29 03:19:14,642 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2020-07-29 03:19:14,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:19:14,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:19:14,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:19:14,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:19:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-29 03:19:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2020-07-29 03:19:14,648 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2020-07-29 03:19:14,648 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2020-07-29 03:19:14,648 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:19:14,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 136 transitions. [2020-07-29 03:19:14,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2020-07-29 03:19:14,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:19:14,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:19:14,652 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:19:14,652 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, 1, 1, 1, 1, 1] [2020-07-29 03:19:14,652 INFO L794 eck$LassoCheckResult]: Stem: 770#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 687#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 688#L277 assume 0 == ~r1~0; 692#L278 assume ~id1~0 >= 0; 733#L279 assume 0 == ~st1~0; 734#L280 assume ~send1~0 == ~id1~0; 763#L281 assume 0 == ~mode1~0 % 256; 704#L282 assume ~id2~0 >= 0; 705#L283 assume 0 == ~st2~0; 744#L284 assume ~send2~0 == ~id2~0; 677#L285 assume 0 == ~mode2~0 % 256; 678#L286 assume ~id3~0 >= 0; 747#L287 assume 0 == ~st3~0; 693#L288 assume ~send3~0 == ~id3~0; 694#L289 assume 0 == ~mode3~0 % 256; 735#L290 assume ~id4~0 >= 0; 736#L291 assume 0 == ~st4~0; 765#L292 assume ~send4~0 == ~id4~0; 706#L293 assume 0 == ~mode4~0 % 256; 707#L294 assume ~id5~0 >= 0; 745#L295 assume 0 == ~st5~0; 681#L296 assume ~send5~0 == ~id5~0; 682#L297 assume 0 == ~mode5~0 % 256; 748#L298 assume ~id6~0 >= 0; 697#L299 assume 0 == ~st6~0; 698#L300 assume ~send6~0 == ~id6~0; 737#L301 assume 0 == ~mode6~0 % 256; 738#L302 assume ~id1~0 != ~id2~0; 752#L303 assume ~id1~0 != ~id3~0; 721#L304 assume ~id1~0 != ~id4~0; 722#L305 assume ~id1~0 != ~id5~0; 749#L306 assume ~id1~0 != ~id6~0; 695#L307 assume ~id2~0 != ~id3~0; 696#L308 assume ~id2~0 != ~id4~0; 746#L309 assume ~id2~0 != ~id5~0; 679#L310 assume ~id2~0 != ~id6~0; 680#L311 assume ~id3~0 != ~id4~0; 724#L312 assume ~id3~0 != ~id5~0; 725#L313 assume ~id3~0 != ~id6~0; 764#L314 assume ~id4~0 != ~id5~0; 719#L315 assume ~id4~0 != ~id6~0; 720#L316 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 773#L277-1 init_#res := init_~tmp~0; 756#L438 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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; 739#L67 assume !(0 == assume_abort_if_not_~cond); 740#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 684#L516-2 [2020-07-29 03:19:14,653 INFO L796 eck$LassoCheckResult]: Loop: 684#L516-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 708#L123 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 761#L127 assume !(node1_~m1~0 != ~nomsg~0); 702#L127-1 ~mode1~0 := 0; 686#L123-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 774#L151 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 766#L154 assume !(node2_~m2~0 != ~nomsg~0); 712#L154-1 ~mode2~0 := 0; 700#L151-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 767#L176 assume !(0 != ~mode3~0 % 256); 768#L189 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 775#L189-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 755#L176-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 758#L201 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 759#L204 assume !(node4_~m4~0 != ~nomsg~0); 673#L204-1 ~mode4~0 := 0; 753#L201-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 754#L226 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 741#L229 assume !(node5_~m5~0 != ~nomsg~0); 675#L229-1 ~mode5~0 := 0; 751#L226-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 742#L251 assume !(0 != ~mode6~0 % 256); 743#L264 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 769#L264-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 727#L251-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 750#L446 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 729#L447 assume ~r1~0 >= 6; 710#L451 assume ~r1~0 < 6;check_~tmp~1 := 1; 732#L446-1 check_#res := check_~tmp~1; 730#L466 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 723#L549 assume !(0 == assert_~arg % 256); 683#L544 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 684#L516-2 [2020-07-29 03:19:14,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:19:14,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 2 times [2020-07-29 03:19:14,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:19:14,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077585450] [2020-07-29 03:19:14,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:19:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:19:14,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:19:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:19:14,728 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:19:14,746 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:19:14,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:19:14,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1109769157, now seen corresponding path program 1 times [2020-07-29 03:19:14,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:19:14,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167831596] [2020-07-29 03:19:14,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:19:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:14,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {989#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {989#true} is VALID [2020-07-29 03:19:14,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {989#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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {989#true} is VALID [2020-07-29 03:19:14,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {989#true} assume !(node1_~m1~0 != ~nomsg~0); {989#true} is VALID [2020-07-29 03:19:14,786 INFO L280 TraceCheckUtils]: 3: Hoare triple {989#true} ~mode1~0 := 0; {989#true} is VALID [2020-07-29 03:19:14,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {989#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {989#true} is VALID [2020-07-29 03:19:14,786 INFO L280 TraceCheckUtils]: 5: Hoare triple {989#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {989#true} is VALID [2020-07-29 03:19:14,786 INFO L280 TraceCheckUtils]: 6: Hoare triple {989#true} assume !(node2_~m2~0 != ~nomsg~0); {989#true} is VALID [2020-07-29 03:19:14,787 INFO L280 TraceCheckUtils]: 7: Hoare triple {989#true} ~mode2~0 := 0; {989#true} is VALID [2020-07-29 03:19:14,787 INFO L280 TraceCheckUtils]: 8: Hoare triple {989#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {989#true} is VALID [2020-07-29 03:19:14,787 INFO L280 TraceCheckUtils]: 9: Hoare triple {989#true} assume !(0 != ~mode3~0 % 256); {989#true} is VALID [2020-07-29 03:19:14,788 INFO L280 TraceCheckUtils]: 10: Hoare triple {989#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; {989#true} is VALID [2020-07-29 03:19:14,788 INFO L280 TraceCheckUtils]: 11: Hoare triple {989#true} ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; {989#true} is VALID [2020-07-29 03:19:14,788 INFO L280 TraceCheckUtils]: 12: Hoare triple {989#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {989#true} is VALID [2020-07-29 03:19:14,789 INFO L280 TraceCheckUtils]: 13: Hoare triple {989#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {989#true} is VALID [2020-07-29 03:19:14,789 INFO L280 TraceCheckUtils]: 14: Hoare triple {989#true} assume !(node4_~m4~0 != ~nomsg~0); {989#true} is VALID [2020-07-29 03:19:14,789 INFO L280 TraceCheckUtils]: 15: Hoare triple {989#true} ~mode4~0 := 0; {989#true} is VALID [2020-07-29 03:19:14,789 INFO L280 TraceCheckUtils]: 16: Hoare triple {989#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {989#true} is VALID [2020-07-29 03:19:14,790 INFO L280 TraceCheckUtils]: 17: Hoare triple {989#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {989#true} is VALID [2020-07-29 03:19:14,790 INFO L280 TraceCheckUtils]: 18: Hoare triple {989#true} assume !(node5_~m5~0 != ~nomsg~0); {989#true} is VALID [2020-07-29 03:19:14,790 INFO L280 TraceCheckUtils]: 19: Hoare triple {989#true} ~mode5~0 := 0; {989#true} is VALID [2020-07-29 03:19:14,790 INFO L280 TraceCheckUtils]: 20: Hoare triple {989#true} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {989#true} is VALID [2020-07-29 03:19:14,791 INFO L280 TraceCheckUtils]: 21: Hoare triple {989#true} assume !(0 != ~mode6~0 % 256); {989#true} is VALID [2020-07-29 03:19:14,791 INFO L280 TraceCheckUtils]: 22: Hoare triple {989#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; {989#true} is VALID [2020-07-29 03:19:14,791 INFO L280 TraceCheckUtils]: 23: Hoare triple {989#true} ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; {989#true} is VALID [2020-07-29 03:19:14,791 INFO L280 TraceCheckUtils]: 24: Hoare triple {989#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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {989#true} is VALID [2020-07-29 03:19:14,792 INFO L280 TraceCheckUtils]: 25: Hoare triple {989#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {989#true} is VALID [2020-07-29 03:19:14,793 INFO L280 TraceCheckUtils]: 26: Hoare triple {989#true} assume ~r1~0 >= 6; {991#(< 5 ~r1~0)} is VALID [2020-07-29 03:19:14,794 INFO L280 TraceCheckUtils]: 27: Hoare triple {991#(< 5 ~r1~0)} assume ~r1~0 < 6;check_~tmp~1 := 1; {990#false} is VALID [2020-07-29 03:19:14,794 INFO L280 TraceCheckUtils]: 28: Hoare triple {990#false} check_#res := check_~tmp~1; {990#false} is VALID [2020-07-29 03:19:14,794 INFO L280 TraceCheckUtils]: 29: Hoare triple {990#false} main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {990#false} is VALID [2020-07-29 03:19:14,794 INFO L280 TraceCheckUtils]: 30: Hoare triple {990#false} assume !(0 == assert_~arg % 256); {990#false} is VALID [2020-07-29 03:19:14,795 INFO L280 TraceCheckUtils]: 31: Hoare triple {990#false} main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; {990#false} is VALID [2020-07-29 03:19:14,797 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:19:14,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167831596] [2020-07-29 03:19:14,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:19:14,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:19:14,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276376727] [2020-07-29 03:19:14,798 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:19:14,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:19:14,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:19:14,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:19:14,799 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. cyclomatic complexity: 33 Second operand 3 states. [2020-07-29 03:19:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:19:15,078 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2020-07-29 03:19:15,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:19:15,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:19:15,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:19:15,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 215 transitions. [2020-07-29 03:19:15,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2020-07-29 03:19:15,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 215 transitions. [2020-07-29 03:19:15,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2020-07-29 03:19:15,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2020-07-29 03:19:15,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 215 transitions. [2020-07-29 03:19:15,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:19:15,131 INFO L688 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2020-07-29 03:19:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 215 transitions. [2020-07-29 03:19:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2020-07-29 03:19:15,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:19:15,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states and 215 transitions. Second operand 156 states. [2020-07-29 03:19:15,140 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states and 215 transitions. Second operand 156 states. [2020-07-29 03:19:15,140 INFO L87 Difference]: Start difference. First operand 156 states and 215 transitions. Second operand 156 states. [2020-07-29 03:19:15,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:19:15,150 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2020-07-29 03:19:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2020-07-29 03:19:15,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:19:15,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:19:15,152 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states and 215 transitions. [2020-07-29 03:19:15,152 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states and 215 transitions. [2020-07-29 03:19:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:19:15,162 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2020-07-29 03:19:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2020-07-29 03:19:15,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:19:15,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:19:15,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:19:15,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:19:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-07-29 03:19:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2020-07-29 03:19:15,174 INFO L711 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2020-07-29 03:19:15,174 INFO L591 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2020-07-29 03:19:15,174 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:19:15,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 215 transitions. [2020-07-29 03:19:15,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2020-07-29 03:19:15,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:19:15,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:19:15,178 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:19:15,178 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, 1, 1, 1, 1, 1, 1] [2020-07-29 03:19:15,178 INFO L794 eck$LassoCheckResult]: Stem: 1248#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 1166#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 1167#L277 assume 0 == ~r1~0; 1168#L278 assume ~id1~0 >= 0; 1210#L279 assume 0 == ~st1~0; 1211#L280 assume ~send1~0 == ~id1~0; 1242#L281 assume 0 == ~mode1~0 % 256; 1180#L282 assume ~id2~0 >= 0; 1181#L283 assume 0 == ~st2~0; 1221#L284 assume ~send2~0 == ~id2~0; 1155#L285 assume 0 == ~mode2~0 % 256; 1156#L286 assume ~id3~0 >= 0; 1225#L287 assume 0 == ~st3~0; 1171#L288 assume ~send3~0 == ~id3~0; 1172#L289 assume 0 == ~mode3~0 % 256; 1212#L290 assume ~id4~0 >= 0; 1213#L291 assume 0 == ~st4~0; 1243#L292 assume ~send4~0 == ~id4~0; 1182#L293 assume 0 == ~mode4~0 % 256; 1183#L294 assume ~id5~0 >= 0; 1222#L295 assume 0 == ~st5~0; 1157#L296 assume ~send5~0 == ~id5~0; 1158#L297 assume 0 == ~mode5~0 % 256; 1226#L298 assume ~id6~0 >= 0; 1173#L299 assume 0 == ~st6~0; 1174#L300 assume ~send6~0 == ~id6~0; 1214#L301 assume 0 == ~mode6~0 % 256; 1215#L302 assume ~id1~0 != ~id2~0; 1230#L303 assume ~id1~0 != ~id3~0; 1197#L304 assume ~id1~0 != ~id4~0; 1198#L305 assume ~id1~0 != ~id5~0; 1227#L306 assume ~id1~0 != ~id6~0; 1169#L307 assume ~id2~0 != ~id3~0; 1170#L308 assume ~id2~0 != ~id4~0; 1223#L309 assume ~id2~0 != ~id5~0; 1153#L310 assume ~id2~0 != ~id6~0; 1154#L311 assume ~id3~0 != ~id4~0; 1200#L312 assume ~id3~0 != ~id5~0; 1201#L313 assume ~id3~0 != ~id6~0; 1241#L314 assume ~id4~0 != ~id5~0; 1195#L315 assume ~id4~0 != ~id6~0; 1196#L316 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 1252#L277-1 init_#res := init_~tmp~0; 1234#L438 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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; 1216#L67 assume !(0 == assume_abort_if_not_~cond); 1217#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 1249#L516-2 [2020-07-29 03:19:15,179 INFO L796 eck$LassoCheckResult]: Loop: 1249#L516-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1299#L123 assume !(0 != ~mode1~0 % 256); 1298#L139 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; 1297#L139-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 1224#L123-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1296#L151 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1293#L154 assume !(node2_~m2~0 != ~nomsg~0); 1291#L154-1 ~mode2~0 := 0; 1289#L151-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1288#L176 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1286#L179 assume !(node3_~m3~0 != ~nomsg~0); 1283#L179-1 ~mode3~0 := 0; 1281#L176-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1280#L201 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1278#L204 assume !(node4_~m4~0 != ~nomsg~0); 1275#L204-1 ~mode4~0 := 0; 1273#L201-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 1272#L226 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1270#L229 assume !(node5_~m5~0 != ~nomsg~0); 1267#L229-1 ~mode5~0 := 0; 1265#L226-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 1264#L251 assume !(0 != ~mode6~0 % 256); 1260#L264 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 1258#L264-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 1257#L251-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1256#L446 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 1255#L447 assume !(~r1~0 >= 6); 1185#L450 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 1186#L451 assume ~r1~0 < 6;check_~tmp~1 := 1; 1303#L446-1 check_#res := check_~tmp~1; 1302#L466 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1301#L549 assume !(0 == assert_~arg % 256); 1300#L544 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 1249#L516-2 [2020-07-29 03:19:15,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:19:15,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 3 times [2020-07-29 03:19:15,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:19:15,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604574426] [2020-07-29 03:19:15,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:19:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:19:15,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:19:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:19:15,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:19:15,238 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:19:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:19:15,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1399528399, now seen corresponding path program 1 times [2020-07-29 03:19:15,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:19:15,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437051579] [2020-07-29 03:19:15,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:19:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:19:15,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:19:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:19:15,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:19:15,275 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:19:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:19:15,276 INFO L82 PathProgramCache]: Analyzing trace with hash -191649555, now seen corresponding path program 1 times [2020-07-29 03:19:15,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:19:15,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022612073] [2020-07-29 03:19:15,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:19:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:15,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {1623#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {1623#true} is VALID [2020-07-29 03:19:15,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {1623#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1623#true} is VALID [2020-07-29 03:19:15,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {1623#true} assume 0 == ~r1~0; {1623#true} is VALID [2020-07-29 03:19:15,398 INFO L280 TraceCheckUtils]: 3: Hoare triple {1623#true} assume ~id1~0 >= 0; {1623#true} is VALID [2020-07-29 03:19:15,398 INFO L280 TraceCheckUtils]: 4: Hoare triple {1623#true} assume 0 == ~st1~0; {1623#true} is VALID [2020-07-29 03:19:15,399 INFO L280 TraceCheckUtils]: 5: Hoare triple {1623#true} assume ~send1~0 == ~id1~0; {1623#true} is VALID [2020-07-29 03:19:15,399 INFO L280 TraceCheckUtils]: 6: Hoare triple {1623#true} assume 0 == ~mode1~0 % 256; {1623#true} is VALID [2020-07-29 03:19:15,399 INFO L280 TraceCheckUtils]: 7: Hoare triple {1623#true} assume ~id2~0 >= 0; {1623#true} is VALID [2020-07-29 03:19:15,400 INFO L280 TraceCheckUtils]: 8: Hoare triple {1623#true} assume 0 == ~st2~0; {1623#true} is VALID [2020-07-29 03:19:15,400 INFO L280 TraceCheckUtils]: 9: Hoare triple {1623#true} assume ~send2~0 == ~id2~0; {1623#true} is VALID [2020-07-29 03:19:15,401 INFO L280 TraceCheckUtils]: 10: Hoare triple {1623#true} assume 0 == ~mode2~0 % 256; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,402 INFO L280 TraceCheckUtils]: 11: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 >= 0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,402 INFO L280 TraceCheckUtils]: 12: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st3~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,403 INFO L280 TraceCheckUtils]: 13: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send3~0 == ~id3~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,403 INFO L280 TraceCheckUtils]: 14: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode3~0 % 256; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,404 INFO L280 TraceCheckUtils]: 15: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id4~0 >= 0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,404 INFO L280 TraceCheckUtils]: 16: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st4~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,405 INFO L280 TraceCheckUtils]: 17: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send4~0 == ~id4~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,405 INFO L280 TraceCheckUtils]: 18: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode4~0 % 256; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,406 INFO L280 TraceCheckUtils]: 19: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id5~0 >= 0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,407 INFO L280 TraceCheckUtils]: 20: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st5~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,407 INFO L280 TraceCheckUtils]: 21: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send5~0 == ~id5~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,408 INFO L280 TraceCheckUtils]: 22: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode5~0 % 256; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,408 INFO L280 TraceCheckUtils]: 23: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id6~0 >= 0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,409 INFO L280 TraceCheckUtils]: 24: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st6~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,410 INFO L280 TraceCheckUtils]: 25: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send6~0 == ~id6~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,410 INFO L280 TraceCheckUtils]: 26: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode6~0 % 256; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,411 INFO L280 TraceCheckUtils]: 27: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id2~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,411 INFO L280 TraceCheckUtils]: 28: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id3~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,412 INFO L280 TraceCheckUtils]: 29: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id4~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,413 INFO L280 TraceCheckUtils]: 30: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id5~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,413 INFO L280 TraceCheckUtils]: 31: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id6~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,414 INFO L280 TraceCheckUtils]: 32: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id3~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,414 INFO L280 TraceCheckUtils]: 33: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id4~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,415 INFO L280 TraceCheckUtils]: 34: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id5~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,416 INFO L280 TraceCheckUtils]: 35: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id6~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,416 INFO L280 TraceCheckUtils]: 36: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 != ~id4~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,417 INFO L280 TraceCheckUtils]: 37: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 != ~id5~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,417 INFO L280 TraceCheckUtils]: 38: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 != ~id6~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,418 INFO L280 TraceCheckUtils]: 39: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id4~0 != ~id5~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,418 INFO L280 TraceCheckUtils]: 40: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id4~0 != ~id6~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,419 INFO L280 TraceCheckUtils]: 41: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,420 INFO L280 TraceCheckUtils]: 42: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} init_#res := init_~tmp~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,420 INFO L280 TraceCheckUtils]: 43: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,421 INFO L280 TraceCheckUtils]: 44: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 == assume_abort_if_not_~cond); {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,421 INFO L280 TraceCheckUtils]: 45: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,422 INFO L280 TraceCheckUtils]: 46: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,422 INFO L280 TraceCheckUtils]: 47: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 != ~mode1~0 % 256); {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,423 INFO L280 TraceCheckUtils]: 48: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,423 INFO L280 TraceCheckUtils]: 49: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,424 INFO L280 TraceCheckUtils]: 50: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:19:15,425 INFO L280 TraceCheckUtils]: 51: Hoare triple {1625#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1624#false} is VALID [2020-07-29 03:19:15,425 INFO L280 TraceCheckUtils]: 52: Hoare triple {1624#false} assume !(node2_~m2~0 != ~nomsg~0); {1624#false} is VALID [2020-07-29 03:19:15,426 INFO L280 TraceCheckUtils]: 53: Hoare triple {1624#false} ~mode2~0 := 0; {1624#false} is VALID [2020-07-29 03:19:15,426 INFO L280 TraceCheckUtils]: 54: Hoare triple {1624#false} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1624#false} is VALID [2020-07-29 03:19:15,426 INFO L280 TraceCheckUtils]: 55: Hoare triple {1624#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1624#false} is VALID [2020-07-29 03:19:15,426 INFO L280 TraceCheckUtils]: 56: Hoare triple {1624#false} assume !(node3_~m3~0 != ~nomsg~0); {1624#false} is VALID [2020-07-29 03:19:15,426 INFO L280 TraceCheckUtils]: 57: Hoare triple {1624#false} ~mode3~0 := 0; {1624#false} is VALID [2020-07-29 03:19:15,427 INFO L280 TraceCheckUtils]: 58: Hoare triple {1624#false} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1624#false} is VALID [2020-07-29 03:19:15,427 INFO L280 TraceCheckUtils]: 59: Hoare triple {1624#false} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1624#false} is VALID [2020-07-29 03:19:15,427 INFO L280 TraceCheckUtils]: 60: Hoare triple {1624#false} assume !(node4_~m4~0 != ~nomsg~0); {1624#false} is VALID [2020-07-29 03:19:15,427 INFO L280 TraceCheckUtils]: 61: Hoare triple {1624#false} ~mode4~0 := 0; {1624#false} is VALID [2020-07-29 03:19:15,428 INFO L280 TraceCheckUtils]: 62: Hoare triple {1624#false} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1624#false} is VALID [2020-07-29 03:19:15,428 INFO L280 TraceCheckUtils]: 63: Hoare triple {1624#false} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1624#false} is VALID [2020-07-29 03:19:15,428 INFO L280 TraceCheckUtils]: 64: Hoare triple {1624#false} assume !(node5_~m5~0 != ~nomsg~0); {1624#false} is VALID [2020-07-29 03:19:15,428 INFO L280 TraceCheckUtils]: 65: Hoare triple {1624#false} ~mode5~0 := 0; {1624#false} is VALID [2020-07-29 03:19:15,429 INFO L280 TraceCheckUtils]: 66: Hoare triple {1624#false} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1624#false} is VALID [2020-07-29 03:19:15,429 INFO L280 TraceCheckUtils]: 67: Hoare triple {1624#false} assume !(0 != ~mode6~0 % 256); {1624#false} is VALID [2020-07-29 03:19:15,429 INFO L280 TraceCheckUtils]: 68: Hoare triple {1624#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; {1624#false} is VALID [2020-07-29 03:19:15,429 INFO L280 TraceCheckUtils]: 69: Hoare triple {1624#false} ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; {1624#false} is VALID [2020-07-29 03:19:15,430 INFO L280 TraceCheckUtils]: 70: Hoare triple {1624#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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1624#false} is VALID [2020-07-29 03:19:15,430 INFO L280 TraceCheckUtils]: 71: Hoare triple {1624#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1624#false} is VALID [2020-07-29 03:19:15,430 INFO L280 TraceCheckUtils]: 72: Hoare triple {1624#false} assume !(~r1~0 >= 6); {1624#false} is VALID [2020-07-29 03:19:15,430 INFO L280 TraceCheckUtils]: 73: Hoare triple {1624#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {1624#false} is VALID [2020-07-29 03:19:15,431 INFO L280 TraceCheckUtils]: 74: Hoare triple {1624#false} assume ~r1~0 < 6;check_~tmp~1 := 1; {1624#false} is VALID [2020-07-29 03:19:15,431 INFO L280 TraceCheckUtils]: 75: Hoare triple {1624#false} check_#res := check_~tmp~1; {1624#false} is VALID [2020-07-29 03:19:15,431 INFO L280 TraceCheckUtils]: 76: Hoare triple {1624#false} main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1624#false} is VALID [2020-07-29 03:19:15,431 INFO L280 TraceCheckUtils]: 77: Hoare triple {1624#false} assume !(0 == assert_~arg % 256); {1624#false} is VALID [2020-07-29 03:19:15,432 INFO L280 TraceCheckUtils]: 78: Hoare triple {1624#false} main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; {1624#false} is VALID [2020-07-29 03:19:15,445 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:19:15,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022612073] [2020-07-29 03:19:15,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:19:15,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:19:15,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096694374] [2020-07-29 03:19:15,972 WARN L193 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 161 [2020-07-29 03:19:16,623 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 143 [2020-07-29 03:19:16,643 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:19:16,644 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:19:16,644 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:19:16,644 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:19:16,644 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:19:16,644 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:16,644 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:19:16,644 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:19:16,645 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6.1.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2020-07-29 03:19:16,645 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:19:16,645 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:19:16,755 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:19:17,012 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2020-07-29 03:19:17,017 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:19:17,028 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:19:17,033 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:19:17,037 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:19:17,042 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:19:17,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:19:17,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:19:17,059 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:19:17,067 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:19:17,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:19:17,078 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:19:17,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:19:17,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:19:17,093 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:19:17,100 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:19:17,104 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:19:17,119 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:19:17,122 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:19:17,131 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:19:17,147 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:19:17,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:19:17,159 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:19:17,164 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:19:17,169 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:19:17,176 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:19:17,180 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:19:17,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:19:17,196 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:19:17,204 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:19:17,209 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:19:17,217 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:19:17,923 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-07-29 03:19:18,271 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 03:19:31,038 WARN L193 SmtUtils]: Spent 12.64 s on a formula simplification. DAG size of input: 214 DAG size of output: 142 [2020-07-29 03:19:31,451 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:19:31,453 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) [2020-07-29 03:19:31,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:19:31,467 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:32,392 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:19:32,392 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~p1_old~0=0, ~send6~0=-76, ~nomsg~0=0, ULTIMATE.start_node4_~m4~0=0, ~p6_new~0=0, ULTIMATE.start_node5_~m5~0=0, ~p3_old~0=0, ~p5_new~0=0, ~p2_old~0=0, ~p4_old~0=0, ~p5_old~0=0, ULTIMATE.start_node2_~m2~0=0, ~p1_new~0=0, ~p2_new~0=0, ~p3_new~0=0, ~p4_new~0=0, ~p6_old~0=-76, ULTIMATE.start_node1_~m1~0=0, ULTIMATE.start_node6_~m6~0=0, ULTIMATE.start_node3_~m3~0=0, ~send1~0=0} Honda state: {~p1_old~0=0, ~send6~0=-76, ~nomsg~0=0, ULTIMATE.start_node4_~m4~0=0, ~p6_new~0=0, ULTIMATE.start_node5_~m5~0=0, ~p3_old~0=0, ~p5_new~0=0, ~p2_old~0=0, ~p4_old~0=0, ~p5_old~0=0, ULTIMATE.start_node2_~m2~0=0, ~p1_new~0=0, ~p2_new~0=0, ~p3_new~0=0, ~p4_new~0=0, ~p6_old~0=-76, ULTIMATE.start_node1_~m1~0=0, ULTIMATE.start_node6_~m6~0=0, ULTIMATE.start_node3_~m3~0=0, ~send1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 03:19:32,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:19:32,442 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:19:32,511 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:19:32,511 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:32,612 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:19:32,614 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:19:32,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:19:32,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:19:32,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:19:32,614 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:19:32,614 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:32,614 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:19:32,615 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:19:32,615 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6.1.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2020-07-29 03:19:32,615 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:19:32,615 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:19:32,689 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:19:32,699 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:19:32,704 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:19:32,943 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2020-07-29 03:19:32,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:19:32,950 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:19:32,953 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:19:32,962 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:19:32,965 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:19:32,969 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:19:32,974 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:19:32,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:19:32,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:19:32,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:19:33,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:19:33,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:19:33,009 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:19:33,014 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:19:33,018 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:19:33,023 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:19:33,029 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:19:33,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:19:33,046 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:19:33,050 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:19:33,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:19:33,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:19:33,080 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:19:33,085 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:19:33,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:19:33,096 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:19:33,104 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:19:33,113 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:19:33,119 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:19:33,789 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-07-29 03:19:34,111 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 03:19:46,926 WARN L193 SmtUtils]: Spent 12.70 s on a formula simplification. DAG size of input: 214 DAG size of output: 142 [2020-07-29 03:19:47,272 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:19:47,278 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:19:47,290 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:19:47,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:47,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:47,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:47,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:47,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:47,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:47,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:47,303 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:19:47,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:19:47,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:47,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:47,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:47,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:47,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:19:47,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:19:47,371 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) [2020-07-29 03:19:47,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:47,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:47,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:47,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:47,421 INFO L204 nArgumentSynthesizer]: 24 loop disjuncts [2020-07-29 03:19:47,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:47,651 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2020-07-29 03:19:47,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:48,116 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) [2020-07-29 03:19:48,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:19:48,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:48,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:48,194 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) [2020-07-29 03:19:48,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:19:48,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:48,250 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:19:48,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:19:48,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:48,300 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) [2020-07-29 03:19:48,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:19:48,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:48,354 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:19:48,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:19:48,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:48,397 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:19:48,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:19:48,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:19:48,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:19:48,442 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:48,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:19:48,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:48,472 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:19:48,495 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:19:48,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:19:48,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:19:48,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:19:48,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:19:48,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:19:48,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:19:48,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:19:48,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:19:48,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:48,560 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:19:48,584 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:19:48,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:48,588 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:19:48,612 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:19:48,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:19:48,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:19:48,620 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:19:48,643 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:19:48,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:48,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 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:19:48,674 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:19:48,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:48,682 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:19:48,715 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:19:48,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:19:48,718 INFO L402 nArgumentSynthesizer]: A total of 2 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:19:48,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:48,745 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:19:48,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:48,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:48,772 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:19:48,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:48,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:48,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:19:48,812 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:19:48,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:48,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:48,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:48,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:48,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:48,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:48,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:48,817 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:19:48,822 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:19:48,823 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:19:48,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:19:48,832 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:19:48,833 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:19:48,833 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:48,872 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:19:48,880 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "assume !(0 != ~mode1~0 % 256);" "assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0;" "~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1;" "havoc node2_#t~ite1, 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~ite2, 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~ite3, 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~ite4, 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;" "havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0;" "assume !(0 != ~mode6~0 % 256);" "assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0;" "~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1;" "~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;~p6_old~0 := ~p6_new~0;~p6_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 + ~st6~0 <= 1;" "assume !(~r1~0 >= 6);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0;" "assume ~r1~0 < 6;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;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~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33;" [2020-07-29 03:19:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:48,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:19:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:49,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:19:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:49,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:19:49,092 INFO L280 TraceCheckUtils]: 0: Hoare triple {1626#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~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;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {1626#unseeded} is VALID [2020-07-29 03:19:49,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {1626#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,093 INFO L280 TraceCheckUtils]: 2: Hoare triple {1626#unseeded} assume 0 == ~r1~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,094 INFO L280 TraceCheckUtils]: 3: Hoare triple {1626#unseeded} assume ~id1~0 >= 0; {1626#unseeded} is VALID [2020-07-29 03:19:49,094 INFO L280 TraceCheckUtils]: 4: Hoare triple {1626#unseeded} assume 0 == ~st1~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,095 INFO L280 TraceCheckUtils]: 5: Hoare triple {1626#unseeded} assume ~send1~0 == ~id1~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,095 INFO L280 TraceCheckUtils]: 6: Hoare triple {1626#unseeded} assume 0 == ~mode1~0 % 256; {1626#unseeded} is VALID [2020-07-29 03:19:49,096 INFO L280 TraceCheckUtils]: 7: Hoare triple {1626#unseeded} assume ~id2~0 >= 0; {1626#unseeded} is VALID [2020-07-29 03:19:49,096 INFO L280 TraceCheckUtils]: 8: Hoare triple {1626#unseeded} assume 0 == ~st2~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,097 INFO L280 TraceCheckUtils]: 9: Hoare triple {1626#unseeded} assume ~send2~0 == ~id2~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,097 INFO L280 TraceCheckUtils]: 10: Hoare triple {1626#unseeded} assume 0 == ~mode2~0 % 256; {1626#unseeded} is VALID [2020-07-29 03:19:49,098 INFO L280 TraceCheckUtils]: 11: Hoare triple {1626#unseeded} assume ~id3~0 >= 0; {1626#unseeded} is VALID [2020-07-29 03:19:49,098 INFO L280 TraceCheckUtils]: 12: Hoare triple {1626#unseeded} assume 0 == ~st3~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,099 INFO L280 TraceCheckUtils]: 13: Hoare triple {1626#unseeded} assume ~send3~0 == ~id3~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,104 INFO L280 TraceCheckUtils]: 14: Hoare triple {1626#unseeded} assume 0 == ~mode3~0 % 256; {1626#unseeded} is VALID [2020-07-29 03:19:49,104 INFO L280 TraceCheckUtils]: 15: Hoare triple {1626#unseeded} assume ~id4~0 >= 0; {1626#unseeded} is VALID [2020-07-29 03:19:49,105 INFO L280 TraceCheckUtils]: 16: Hoare triple {1626#unseeded} assume 0 == ~st4~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,105 INFO L280 TraceCheckUtils]: 17: Hoare triple {1626#unseeded} assume ~send4~0 == ~id4~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,106 INFO L280 TraceCheckUtils]: 18: Hoare triple {1626#unseeded} assume 0 == ~mode4~0 % 256; {1626#unseeded} is VALID [2020-07-29 03:19:49,106 INFO L280 TraceCheckUtils]: 19: Hoare triple {1626#unseeded} assume ~id5~0 >= 0; {1626#unseeded} is VALID [2020-07-29 03:19:49,107 INFO L280 TraceCheckUtils]: 20: Hoare triple {1626#unseeded} assume 0 == ~st5~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,108 INFO L280 TraceCheckUtils]: 21: Hoare triple {1626#unseeded} assume ~send5~0 == ~id5~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,108 INFO L280 TraceCheckUtils]: 22: Hoare triple {1626#unseeded} assume 0 == ~mode5~0 % 256; {1626#unseeded} is VALID [2020-07-29 03:19:49,109 INFO L280 TraceCheckUtils]: 23: Hoare triple {1626#unseeded} assume ~id6~0 >= 0; {1626#unseeded} is VALID [2020-07-29 03:19:49,109 INFO L280 TraceCheckUtils]: 24: Hoare triple {1626#unseeded} assume 0 == ~st6~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,110 INFO L280 TraceCheckUtils]: 25: Hoare triple {1626#unseeded} assume ~send6~0 == ~id6~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,110 INFO L280 TraceCheckUtils]: 26: Hoare triple {1626#unseeded} assume 0 == ~mode6~0 % 256; {1626#unseeded} is VALID [2020-07-29 03:19:49,116 INFO L280 TraceCheckUtils]: 27: Hoare triple {1626#unseeded} assume ~id1~0 != ~id2~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,116 INFO L280 TraceCheckUtils]: 28: Hoare triple {1626#unseeded} assume ~id1~0 != ~id3~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,117 INFO L280 TraceCheckUtils]: 29: Hoare triple {1626#unseeded} assume ~id1~0 != ~id4~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,117 INFO L280 TraceCheckUtils]: 30: Hoare triple {1626#unseeded} assume ~id1~0 != ~id5~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,119 INFO L280 TraceCheckUtils]: 31: Hoare triple {1626#unseeded} assume ~id1~0 != ~id6~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,120 INFO L280 TraceCheckUtils]: 32: Hoare triple {1626#unseeded} assume ~id2~0 != ~id3~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,120 INFO L280 TraceCheckUtils]: 33: Hoare triple {1626#unseeded} assume ~id2~0 != ~id4~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,121 INFO L280 TraceCheckUtils]: 34: Hoare triple {1626#unseeded} assume ~id2~0 != ~id5~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,122 INFO L280 TraceCheckUtils]: 35: Hoare triple {1626#unseeded} assume ~id2~0 != ~id6~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,122 INFO L280 TraceCheckUtils]: 36: Hoare triple {1626#unseeded} assume ~id3~0 != ~id4~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,123 INFO L280 TraceCheckUtils]: 37: Hoare triple {1626#unseeded} assume ~id3~0 != ~id5~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,123 INFO L280 TraceCheckUtils]: 38: Hoare triple {1626#unseeded} assume ~id3~0 != ~id6~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,124 INFO L280 TraceCheckUtils]: 39: Hoare triple {1626#unseeded} assume ~id4~0 != ~id5~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,125 INFO L280 TraceCheckUtils]: 40: Hoare triple {1626#unseeded} assume ~id4~0 != ~id6~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,126 INFO L280 TraceCheckUtils]: 41: Hoare triple {1626#unseeded} assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; {1626#unseeded} is VALID [2020-07-29 03:19:49,126 INFO L280 TraceCheckUtils]: 42: Hoare triple {1626#unseeded} init_#res := init_~tmp~0; {1626#unseeded} is VALID [2020-07-29 03:19:49,127 INFO L280 TraceCheckUtils]: 43: Hoare triple {1626#unseeded} main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;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; {1626#unseeded} is VALID [2020-07-29 03:19:49,127 INFO L280 TraceCheckUtils]: 44: Hoare triple {1626#unseeded} assume !(0 == assume_abort_if_not_~cond); {1626#unseeded} is VALID [2020-07-29 03:19:49,128 INFO L280 TraceCheckUtils]: 45: Hoare triple {1626#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {1626#unseeded} is VALID [2020-07-29 03:19:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:49,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:19:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:49,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:19:49,265 INFO L280 TraceCheckUtils]: 0: Hoare triple {1629#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 23))} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode1~0 % 256); {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,268 INFO L280 TraceCheckUtils]: 3: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,269 INFO L280 TraceCheckUtils]: 4: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,269 INFO L280 TraceCheckUtils]: 5: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,270 INFO L280 TraceCheckUtils]: 6: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node2_~m2~0 != ~nomsg~0); {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,271 INFO L280 TraceCheckUtils]: 7: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,271 INFO L280 TraceCheckUtils]: 8: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,272 INFO L280 TraceCheckUtils]: 9: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,273 INFO L280 TraceCheckUtils]: 10: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node3_~m3~0 != ~nomsg~0); {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,274 INFO L280 TraceCheckUtils]: 11: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,274 INFO L280 TraceCheckUtils]: 12: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,275 INFO L280 TraceCheckUtils]: 13: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,276 INFO L280 TraceCheckUtils]: 14: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node4_~m4~0 != ~nomsg~0); {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,277 INFO L280 TraceCheckUtils]: 15: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,278 INFO L280 TraceCheckUtils]: 16: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,279 INFO L280 TraceCheckUtils]: 17: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,287 INFO L280 TraceCheckUtils]: 18: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node5_~m5~0 != ~nomsg~0); {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,288 INFO L280 TraceCheckUtils]: 19: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode5~0 := 0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,289 INFO L280 TraceCheckUtils]: 20: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,289 INFO L280 TraceCheckUtils]: 21: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode6~0 % 256); {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,290 INFO L280 TraceCheckUtils]: 22: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,291 INFO L280 TraceCheckUtils]: 23: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,292 INFO L280 TraceCheckUtils]: 24: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,293 INFO L280 TraceCheckUtils]: 25: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,294 INFO L280 TraceCheckUtils]: 26: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r1~0 >= 6); {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,296 INFO L280 TraceCheckUtils]: 27: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,296 INFO L280 TraceCheckUtils]: 28: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 6;check_~tmp~1 := 1; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,300 INFO L280 TraceCheckUtils]: 29: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,301 INFO L280 TraceCheckUtils]: 30: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,305 INFO L280 TraceCheckUtils]: 31: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:49,307 INFO L280 TraceCheckUtils]: 32: Hoare triple {1779#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; {1639#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 23)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:19:49,307 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:19:49,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:19:49,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:19:49,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 33 letters. [2020-07-29 03:19:49,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,356 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:19:49,356 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 156 states and 215 transitions. cyclomatic complexity: 60 Second operand 3 states. [2020-07-29 03:19:49,636 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 156 states and 215 transitions. cyclomatic complexity: 60. Second operand 3 states. Result 265 states and 384 transitions. Complement of second has 4 states. [2020-07-29 03:19:49,636 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:19:49,637 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:19:49,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 215 transitions. cyclomatic complexity: 60 [2020-07-29 03:19:49,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:19:49,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:19:49,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:19:49,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:19:49,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:19:49,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:19:49,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 384 transitions. [2020-07-29 03:19:49,647 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:19:49,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:19:49,650 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 156 states and 215 transitions. cyclomatic complexity: 60 [2020-07-29 03:19:49,754 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 110 examples of accepted words. [2020-07-29 03:19:49,755 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:19:49,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:19:49,758 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:19:49,758 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 265 states and 384 transitions. cyclomatic complexity: 120 [2020-07-29 03:19:49,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 384 transitions. cyclomatic complexity: 120 [2020-07-29 03:19:49,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:19:49,759 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:19:49,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 46 letters. Loop has 33 letters. [2020-07-29 03:19:49,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 33 letters. [2020-07-29 03:19:49,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 46 letters. Loop has 33 letters. [2020-07-29 03:19:49,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:49,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:49,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:49,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 265 letters. Loop has 265 letters. [2020-07-29 03:19:49,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 265 letters. Loop has 265 letters. [2020-07-29 03:19:49,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 265 letters. Loop has 265 letters. [2020-07-29 03:19:49,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 156 letters. Loop has 156 letters. [2020-07-29 03:19:49,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 156 letters. Loop has 156 letters. [2020-07-29 03:19:49,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 156 letters. Loop has 156 letters. [2020-07-29 03:19:49,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:19:49,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:19:49,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:19:49,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:19:49,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:19:49,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:19:49,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:19:49,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:19:49,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:19:49,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:19:49,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:19:49,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:19:49,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:19:49,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:19:49,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 57 letters. Loop has 33 letters. [2020-07-29 03:19:49,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 57 letters. Loop has 34 letters. [2020-07-29 03:19:49,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 34 letters. [2020-07-29 03:19:49,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 57 letters. Loop has 34 letters. [2020-07-29 03:19:49,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:19:49,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:19:49,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:19:49,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 56 letters. Loop has 33 letters. [2020-07-29 03:19:49,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 33 letters. [2020-07-29 03:19:49,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 56 letters. Loop has 33 letters. [2020-07-29 03:19:49,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 56 letters. Loop has 33 letters. [2020-07-29 03:19:49,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 33 letters. [2020-07-29 03:19:49,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 56 letters. Loop has 33 letters. [2020-07-29 03:19:49,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:19:49,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:19:49,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:19:49,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:19:49,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:19:49,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:19:49,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 53 letters. Loop has 33 letters. [2020-07-29 03:19:49,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 33 letters. [2020-07-29 03:19:49,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 33 letters. [2020-07-29 03:19:49,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 53 letters. Loop has 33 letters. [2020-07-29 03:19:49,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 33 letters. [2020-07-29 03:19:49,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 33 letters. [2020-07-29 03:19:49,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 54 letters. Loop has 35 letters. [2020-07-29 03:19:49,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 35 letters. [2020-07-29 03:19:49,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 54 letters. Loop has 35 letters. [2020-07-29 03:19:49,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 52 letters. Loop has 33 letters. [2020-07-29 03:19:49,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 33 letters. [2020-07-29 03:19:49,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 52 letters. Loop has 33 letters. [2020-07-29 03:19:49,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 53 letters. Loop has 34 letters. [2020-07-29 03:19:49,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 34 letters. [2020-07-29 03:19:49,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 34 letters. [2020-07-29 03:19:49,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 52 letters. Loop has 33 letters. [2020-07-29 03:19:49,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 33 letters. [2020-07-29 03:19:49,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 52 letters. Loop has 33 letters. [2020-07-29 03:19:49,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:19:49,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:19:49,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:19:49,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 49 letters. Loop has 33 letters. [2020-07-29 03:19:49,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 33 letters. [2020-07-29 03:19:49,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 49 letters. Loop has 33 letters. [2020-07-29 03:19:49,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 48 letters. Loop has 33 letters. [2020-07-29 03:19:49,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 33 letters. [2020-07-29 03:19:49,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 48 letters. Loop has 33 letters. [2020-07-29 03:19:49,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 47 letters. Loop has 33 letters. [2020-07-29 03:19:49,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 33 letters. [2020-07-29 03:19:49,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 47 letters. Loop has 33 letters. [2020-07-29 03:19:49,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 78 letters. Loop has 33 letters. [2020-07-29 03:19:49,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 33 letters. [2020-07-29 03:19:49,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 78 letters. Loop has 33 letters. [2020-07-29 03:19:49,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 77 letters. Loop has 33 letters. [2020-07-29 03:19:49,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 33 letters. [2020-07-29 03:19:49,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 77 letters. Loop has 33 letters. [2020-07-29 03:19:49,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 76 letters. Loop has 33 letters. [2020-07-29 03:19:49,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 33 letters. [2020-07-29 03:19:49,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 76 letters. Loop has 33 letters. [2020-07-29 03:19:49,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 75 letters. Loop has 33 letters. [2020-07-29 03:19:49,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 33 letters. [2020-07-29 03:19:49,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 75 letters. Loop has 33 letters. [2020-07-29 03:19:49,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 95 letters. Loop has 35 letters. [2020-07-29 03:19:49,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 95 letters. Loop has 35 letters. [2020-07-29 03:19:49,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 95 letters. Loop has 35 letters. [2020-07-29 03:19:49,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 94 letters. Loop has 33 letters. [2020-07-29 03:19:49,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 94 letters. Loop has 33 letters. [2020-07-29 03:19:49,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 94 letters. Loop has 33 letters. [2020-07-29 03:19:49,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 98 letters. Loop has 34 letters. [2020-07-29 03:19:49,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 98 letters. Loop has 34 letters. [2020-07-29 03:19:49,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 98 letters. Loop has 34 letters. [2020-07-29 03:19:49,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 98 letters. Loop has 33 letters. [2020-07-29 03:19:49,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 98 letters. Loop has 33 letters. [2020-07-29 03:19:49,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 98 letters. Loop has 33 letters. [2020-07-29 03:19:49,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 99 letters. Loop has 35 letters. [2020-07-29 03:19:49,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 99 letters. Loop has 35 letters. [2020-07-29 03:19:49,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 99 letters. Loop has 35 letters. [2020-07-29 03:19:49,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 78 letters. Loop has 33 letters. [2020-07-29 03:19:49,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 33 letters. [2020-07-29 03:19:49,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 78 letters. Loop has 33 letters. [2020-07-29 03:19:49,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 79 letters. Loop has 33 letters. [2020-07-29 03:19:49,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 79 letters. Loop has 33 letters. [2020-07-29 03:19:49,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 79 letters. Loop has 33 letters. [2020-07-29 03:19:49,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 82 letters. Loop has 33 letters. [2020-07-29 03:19:49,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 33 letters. [2020-07-29 03:19:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 82 letters. Loop has 33 letters. [2020-07-29 03:19:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 83 letters. Loop has 33 letters. [2020-07-29 03:19:49,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 83 letters. Loop has 33 letters. [2020-07-29 03:19:49,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 83 letters. Loop has 33 letters. [2020-07-29 03:19:49,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 102 letters. Loop has 34 letters. [2020-07-29 03:19:49,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 102 letters. Loop has 34 letters. [2020-07-29 03:19:49,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 102 letters. Loop has 34 letters. [2020-07-29 03:19:49,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 102 letters. Loop has 33 letters. [2020-07-29 03:19:49,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 102 letters. Loop has 33 letters. [2020-07-29 03:19:49,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 102 letters. Loop has 33 letters. [2020-07-29 03:19:49,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 103 letters. Loop has 35 letters. [2020-07-29 03:19:49,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 103 letters. Loop has 35 letters. [2020-07-29 03:19:49,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 103 letters. Loop has 35 letters. [2020-07-29 03:19:49,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 86 letters. Loop has 33 letters. [2020-07-29 03:19:49,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 33 letters. [2020-07-29 03:19:49,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 86 letters. Loop has 33 letters. [2020-07-29 03:19:49,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 87 letters. Loop has 33 letters. [2020-07-29 03:19:49,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 87 letters. Loop has 33 letters. [2020-07-29 03:19:49,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 87 letters. Loop has 33 letters. [2020-07-29 03:19:49,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 50 letters. Loop has 35 letters. [2020-07-29 03:19:49,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 35 letters. [2020-07-29 03:19:49,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 50 letters. Loop has 35 letters. [2020-07-29 03:19:49,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 49 letters. Loop has 33 letters. [2020-07-29 03:19:49,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 33 letters. [2020-07-29 03:19:49,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 49 letters. Loop has 33 letters. [2020-07-29 03:19:49,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 85 letters. Loop has 33 letters. [2020-07-29 03:19:49,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 33 letters. [2020-07-29 03:19:49,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 85 letters. Loop has 33 letters. [2020-07-29 03:19:49,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 80 letters. Loop has 33 letters. [2020-07-29 03:19:49,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 80 letters. Loop has 33 letters. [2020-07-29 03:19:49,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 80 letters. Loop has 33 letters. [2020-07-29 03:19:49,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 73 letters. Loop has 33 letters. [2020-07-29 03:19:49,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 33 letters. [2020-07-29 03:19:49,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 73 letters. Loop has 33 letters. [2020-07-29 03:19:49,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 74 letters. Loop has 33 letters. [2020-07-29 03:19:49,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 33 letters. [2020-07-29 03:19:49,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 74 letters. Loop has 33 letters. [2020-07-29 03:19:49,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 87 letters. Loop has 35 letters. [2020-07-29 03:19:49,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 87 letters. Loop has 35 letters. [2020-07-29 03:19:49,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 87 letters. Loop has 35 letters. [2020-07-29 03:19:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 86 letters. Loop has 33 letters. [2020-07-29 03:19:49,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 33 letters. [2020-07-29 03:19:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 86 letters. Loop has 33 letters. [2020-07-29 03:19:49,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 90 letters. Loop has 34 letters. [2020-07-29 03:19:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 90 letters. Loop has 34 letters. [2020-07-29 03:19:49,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 90 letters. Loop has 34 letters. [2020-07-29 03:19:49,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 90 letters. Loop has 33 letters. [2020-07-29 03:19:49,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 90 letters. Loop has 33 letters. [2020-07-29 03:19:49,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 90 letters. Loop has 33 letters. [2020-07-29 03:19:49,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 91 letters. Loop has 35 letters. [2020-07-29 03:19:49,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 91 letters. Loop has 35 letters. [2020-07-29 03:19:49,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 91 letters. Loop has 35 letters. [2020-07-29 03:19:49,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 49 letters. Loop has 34 letters. [2020-07-29 03:19:49,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 34 letters. [2020-07-29 03:19:49,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 49 letters. Loop has 34 letters. [2020-07-29 03:19:49,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 81 letters. Loop has 33 letters. [2020-07-29 03:19:49,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 81 letters. Loop has 33 letters. [2020-07-29 03:19:49,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 81 letters. Loop has 33 letters. [2020-07-29 03:19:49,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 94 letters. Loop has 34 letters. [2020-07-29 03:19:49,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 94 letters. Loop has 34 letters. [2020-07-29 03:19:49,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 94 letters. Loop has 34 letters. [2020-07-29 03:19:49,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 77 letters. Loop has 33 letters. [2020-07-29 03:19:49,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 33 letters. [2020-07-29 03:19:49,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 77 letters. Loop has 33 letters. [2020-07-29 03:19:49,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 86 letters. Loop has 34 letters. [2020-07-29 03:19:49,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 34 letters. [2020-07-29 03:19:49,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 86 letters. Loop has 34 letters. [2020-07-29 03:19:49,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 103 letters. Loop has 33 letters. [2020-07-29 03:19:49,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 103 letters. Loop has 33 letters. [2020-07-29 03:19:49,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 103 letters. Loop has 33 letters. [2020-07-29 03:19:49,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 101 letters. Loop has 33 letters. [2020-07-29 03:19:49,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 101 letters. Loop has 33 letters. [2020-07-29 03:19:49,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 101 letters. Loop has 33 letters. [2020-07-29 03:19:49,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 105 letters. Loop has 33 letters. [2020-07-29 03:19:49,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 105 letters. Loop has 33 letters. [2020-07-29 03:19:49,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 105 letters. Loop has 33 letters. [2020-07-29 03:19:49,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 73 letters. Loop has 33 letters. [2020-07-29 03:19:49,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 33 letters. [2020-07-29 03:19:49,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 73 letters. Loop has 33 letters. [2020-07-29 03:19:49,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 76 letters. Loop has 33 letters. [2020-07-29 03:19:49,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 33 letters. [2020-07-29 03:19:49,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 76 letters. Loop has 33 letters. [2020-07-29 03:19:49,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 74 letters. Loop has 33 letters. [2020-07-29 03:19:49,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 33 letters. [2020-07-29 03:19:49,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 74 letters. Loop has 33 letters. [2020-07-29 03:19:49,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 75 letters. Loop has 33 letters. [2020-07-29 03:19:49,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 33 letters. [2020-07-29 03:19:49,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 75 letters. Loop has 33 letters. [2020-07-29 03:19:49,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 97 letters. Loop has 33 letters. [2020-07-29 03:19:49,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 97 letters. Loop has 33 letters. [2020-07-29 03:19:49,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 97 letters. Loop has 33 letters. [2020-07-29 03:19:49,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 100 letters. Loop has 33 letters. [2020-07-29 03:19:49,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 100 letters. Loop has 33 letters. [2020-07-29 03:19:49,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 100 letters. Loop has 33 letters. [2020-07-29 03:19:49,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 101 letters. Loop has 33 letters. [2020-07-29 03:19:49,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 101 letters. Loop has 33 letters. [2020-07-29 03:19:49,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 101 letters. Loop has 33 letters. [2020-07-29 03:19:49,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:19:49,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:19:49,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:19:49,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 104 letters. Loop has 33 letters. [2020-07-29 03:19:49,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 104 letters. Loop has 33 letters. [2020-07-29 03:19:49,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 104 letters. Loop has 33 letters. [2020-07-29 03:19:49,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 99 letters. Loop has 33 letters. [2020-07-29 03:19:49,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 99 letters. Loop has 33 letters. [2020-07-29 03:19:49,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 99 letters. Loop has 33 letters. [2020-07-29 03:19:49,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 95 letters. Loop has 33 letters. [2020-07-29 03:19:49,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 95 letters. Loop has 33 letters. [2020-07-29 03:19:49,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 95 letters. Loop has 33 letters. [2020-07-29 03:19:49,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 96 letters. Loop has 33 letters. [2020-07-29 03:19:49,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 96 letters. Loop has 33 letters. [2020-07-29 03:19:49,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 96 letters. Loop has 33 letters. [2020-07-29 03:19:49,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 91 letters. Loop has 33 letters. [2020-07-29 03:19:49,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 91 letters. Loop has 33 letters. [2020-07-29 03:19:49,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 91 letters. Loop has 33 letters. [2020-07-29 03:19:49,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 89 letters. Loop has 33 letters. [2020-07-29 03:19:49,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 89 letters. Loop has 33 letters. [2020-07-29 03:19:49,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 89 letters. Loop has 33 letters. [2020-07-29 03:19:49,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 92 letters. Loop has 33 letters. [2020-07-29 03:19:49,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 92 letters. Loop has 33 letters. [2020-07-29 03:19:49,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 92 letters. Loop has 33 letters. [2020-07-29 03:19:49,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 93 letters. Loop has 33 letters. [2020-07-29 03:19:49,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 93 letters. Loop has 33 letters. [2020-07-29 03:19:49,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 93 letters. Loop has 33 letters. [2020-07-29 03:19:49,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 93 letters. Loop has 33 letters. [2020-07-29 03:19:49,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 93 letters. Loop has 33 letters. [2020-07-29 03:19:49,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 93 letters. Loop has 33 letters. [2020-07-29 03:19:49,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 48 letters. Loop has 33 letters. [2020-07-29 03:19:49,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 33 letters. [2020-07-29 03:19:49,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 48 letters. Loop has 33 letters. [2020-07-29 03:19:49,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 97 letters. Loop has 33 letters. [2020-07-29 03:19:49,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 97 letters. Loop has 33 letters. [2020-07-29 03:19:49,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 97 letters. Loop has 33 letters. [2020-07-29 03:19:49,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 85 letters. Loop has 33 letters. [2020-07-29 03:19:49,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 33 letters. [2020-07-29 03:19:49,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 85 letters. Loop has 33 letters. [2020-07-29 03:19:49,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 88 letters. Loop has 33 letters. [2020-07-29 03:19:49,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 88 letters. Loop has 33 letters. [2020-07-29 03:19:49,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 88 letters. Loop has 33 letters. [2020-07-29 03:19:49,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 89 letters. Loop has 33 letters. [2020-07-29 03:19:49,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 89 letters. Loop has 33 letters. [2020-07-29 03:19:49,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 89 letters. Loop has 33 letters. [2020-07-29 03:19:49,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 102 letters. Loop has 33 letters. [2020-07-29 03:19:49,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 102 letters. Loop has 33 letters. [2020-07-29 03:19:49,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 102 letters. Loop has 33 letters. [2020-07-29 03:19:49,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 46 letters. Loop has 33 letters. [2020-07-29 03:19:49,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 33 letters. [2020-07-29 03:19:49,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 46 letters. Loop has 33 letters. [2020-07-29 03:19:49,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 98 letters. Loop has 33 letters. [2020-07-29 03:19:49,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 98 letters. Loop has 33 letters. [2020-07-29 03:19:49,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 98 letters. Loop has 33 letters. [2020-07-29 03:19:49,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 94 letters. Loop has 33 letters. [2020-07-29 03:19:49,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 94 letters. Loop has 33 letters. [2020-07-29 03:19:49,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 94 letters. Loop has 33 letters. [2020-07-29 03:19:49,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 84 letters. Loop has 33 letters. [2020-07-29 03:19:49,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 33 letters. [2020-07-29 03:19:49,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 84 letters. Loop has 33 letters. [2020-07-29 03:19:49,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 90 letters. Loop has 33 letters. [2020-07-29 03:19:49,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 90 letters. Loop has 33 letters. [2020-07-29 03:19:49,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 90 letters. Loop has 33 letters. [2020-07-29 03:19:49,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 72 letters. Loop has 33 letters. [2020-07-29 03:19:49,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 33 letters. [2020-07-29 03:19:49,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 72 letters. Loop has 33 letters. [2020-07-29 03:19:49,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:19:49,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:19:49,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:19:49,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:19:49,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:19:49,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:19:49,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 69 letters. Loop has 33 letters. [2020-07-29 03:19:49,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 33 letters. [2020-07-29 03:19:49,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 69 letters. Loop has 33 letters. [2020-07-29 03:19:49,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 69 letters. Loop has 33 letters. [2020-07-29 03:19:49,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 33 letters. [2020-07-29 03:19:49,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 69 letters. Loop has 33 letters. [2020-07-29 03:19:49,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 68 letters. Loop has 33 letters. [2020-07-29 03:19:49,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 33 letters. [2020-07-29 03:19:49,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 68 letters. Loop has 33 letters. [2020-07-29 03:19:49,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 69 letters. Loop has 34 letters. [2020-07-29 03:19:49,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 34 letters. [2020-07-29 03:19:49,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 69 letters. Loop has 34 letters. [2020-07-29 03:19:49,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:19:49,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:19:49,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:19:49,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 68 letters. Loop has 33 letters. [2020-07-29 03:19:49,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 33 letters. [2020-07-29 03:19:49,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 68 letters. Loop has 33 letters. [2020-07-29 03:19:49,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:19:49,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:19:49,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:19:49,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:19:49,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:19:49,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:19:49,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 65 letters. Loop has 33 letters. [2020-07-29 03:19:49,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 33 letters. [2020-07-29 03:19:49,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 65 letters. Loop has 33 letters. [2020-07-29 03:19:49,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 65 letters. Loop has 33 letters. [2020-07-29 03:19:49,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 33 letters. [2020-07-29 03:19:49,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 65 letters. Loop has 33 letters. [2020-07-29 03:19:49,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 65 letters. Loop has 34 letters. [2020-07-29 03:19:49,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 34 letters. [2020-07-29 03:19:49,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 65 letters. Loop has 34 letters. [2020-07-29 03:19:49,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:19:49,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:19:49,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:19:49,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:19:49,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:19:49,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:19:49,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:19:49,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:19:49,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 64 letters. Loop has 33 letters. [2020-07-29 03:19:49,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:19:49,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:19:49,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:19:49,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:19:49,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:19:49,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:19:49,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:19:49,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:19:49,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:19:49,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:19:49,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:19:49,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 33 letters. [2020-07-29 03:19:49,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 61 letters. Loop has 34 letters. [2020-07-29 03:19:49,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 34 letters. [2020-07-29 03:19:49,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 34 letters. [2020-07-29 03:19:49,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:19:49,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:19:49,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:19:49,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:19:49,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:19:49,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:19:49,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:19:49,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:19:49,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 60 letters. Loop has 33 letters. [2020-07-29 03:19:49,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:49,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:49,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:49,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:49,998 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:19:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:19:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2020-07-29 03:19:50,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 136 transitions. Stem has 46 letters. Loop has 33 letters. [2020-07-29 03:19:50,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:50,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 136 transitions. Stem has 79 letters. Loop has 33 letters. [2020-07-29 03:19:50,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:50,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 136 transitions. Stem has 46 letters. Loop has 66 letters. [2020-07-29 03:19:50,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:50,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 384 transitions. cyclomatic complexity: 120 [2020-07-29 03:19:50,015 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:19:50,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 0 states and 0 transitions. [2020-07-29 03:19:50,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:19:50,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:19:50,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:19:50,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:19:50,016 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:19:50,016 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:19:50,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:19:50,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:19:50,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:19:50,017 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:19:50,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:19:50,017 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:19:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:19:50,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:19:50,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:19:50,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:19:50,130 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:19:50,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:19:50,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:19:50,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:19:50,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:19:50,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:19:50,131 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:19:50,131 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:19:50,131 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:19:50,131 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:19:50,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:19:50,131 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:19:50,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:19:50,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:19:50 BoogieIcfgContainer [2020-07-29 03:19:50,139 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:19:50,140 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:19:50,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:19:50,140 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:19:50,141 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:19:12" (3/4) ... [2020-07-29 03:19:50,144 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:19:50,144 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:19:50,148 INFO L168 Benchmark]: Toolchain (without parser) took 39896.27 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 693.6 MB). Free memory was 962.9 MB in the beginning and 1.0 GB in the end (delta: -54.9 MB). Peak memory consumption was 638.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:19:50,149 INFO L168 Benchmark]: CDTParser took 0.37 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:19:50,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 962.9 MB in the beginning and 1.1 GB in the end (delta: -129.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:19:50,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.34 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:19:50,158 INFO L168 Benchmark]: Boogie Preprocessor took 66.63 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:19:50,159 INFO L168 Benchmark]: RCFGBuilder took 1060.71 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: 80.4 MB). Peak memory consumption was 80.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:19:50,160 INFO L168 Benchmark]: BuchiAutomizer took 38014.86 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 588.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -12.7 MB). Peak memory consumption was 576.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:19:50,162 INFO L168 Benchmark]: Witness Printer took 5.00 ms. Allocated memory is still 1.7 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2020-07-29 03:19:50,169 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.37 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 661.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 962.9 MB in the beginning and 1.1 GB in the end (delta: -129.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.34 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.63 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 1060.71 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: 80.4 MB). Peak memory consumption was 80.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 38014.86 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 588.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -12.7 MB). Peak memory consumption was 576.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.00 ms. Allocated memory is still 1.7 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 34.8s. Construction of modules took 0.1s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 156 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 660 SDtfs, 218 SDslu, 1122 SDs, 0 SdLazy, 36 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital216 mio100 ax133 hnf107 lsp55 ukn72 mio100 lsp100 div149 bol100 ite100 ukn100 eq179 hnf72 smp100 dnf7777 smp24 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 711ms VariablesStem: 0 VariablesLoop: 35 DisjunctsStem: 1 DisjunctsLoop: 24 SupportingInvariants: 0 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...