./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 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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 b4e7977192ae56aeb09dc050b873d7b40c1e47d710f31b358c00a46d3bffe743 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:29:56,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:29:56,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:29:56,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:29:56,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:29:56,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:29:56,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:29:56,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:29:56,875 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:29:56,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:29:56,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:29:56,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:29:56,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:29:56,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:29:56,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:29:56,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:29:56,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:29:56,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:29:56,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:29:56,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:29:56,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:29:56,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:29:56,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:29:56,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:29:56,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:29:56,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:29:56,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:29:56,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:29:56,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:29:56,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:29:56,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:29:56,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:29:56,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:29:56,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:29:56,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:29:56,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:29:56,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:29:56,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:29:56,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:29:56,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:29:56,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:29:56,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:29:56,936 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:29:56,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:29:56,937 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:29:56,937 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:29:56,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:29:56,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:29:56,939 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:29:56,939 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:29:56,939 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:29:56,939 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:29:56,940 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:29:56,940 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:29:56,940 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:29:56,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:29:56,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:29:56,941 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:29:56,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:29:56,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:29:56,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:29:56,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:29:56,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:29:56,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:29:56,942 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:29:56,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:29:56,942 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:29:56,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:29:56,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:29:56,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:29:56,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:29:56,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:29:56,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:29:56,944 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:29:56,945 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> b4e7977192ae56aeb09dc050b873d7b40c1e47d710f31b358c00a46d3bffe743 [2022-02-21 04:29:57,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:29:57,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:29:57,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:29:57,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:29:57,166 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:29:57,167 INFO L432 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 [2022-02-21 04:29:57,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c74f133/8ad86ea30ac94d6489d565362c4fa887/FLAG942f10205 [2022-02-21 04:29:57,542 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:29:57,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2022-02-21 04:29:57,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c74f133/8ad86ea30ac94d6489d565362c4fa887/FLAG942f10205 [2022-02-21 04:29:57,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c74f133/8ad86ea30ac94d6489d565362c4fa887 [2022-02-21 04:29:57,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:29:57,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:29:57,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:29:57,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:29:57,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:29:57,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:29:57" (1/1) ... [2022-02-21 04:29:57,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e2eee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:57, skipping insertion in model container [2022-02-21 04:29:57,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:29:57" (1/1) ... [2022-02-21 04:29:57,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:29:58,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:29:58,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c[15112,15125] [2022-02-21 04:29:58,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:29:58,209 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:29:58,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c[15112,15125] [2022-02-21 04:29:58,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:29:58,272 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:29:58,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58 WrapperNode [2022-02-21 04:29:58,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:29:58,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:29:58,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:29:58,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:29:58,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58" (1/1) ... [2022-02-21 04:29:58,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58" (1/1) ... [2022-02-21 04:29:58,335 INFO L137 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 372 [2022-02-21 04:29:58,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:29:58,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:29:58,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:29:58,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:29:58,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58" (1/1) ... [2022-02-21 04:29:58,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58" (1/1) ... [2022-02-21 04:29:58,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58" (1/1) ... [2022-02-21 04:29:58,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58" (1/1) ... [2022-02-21 04:29:58,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58" (1/1) ... [2022-02-21 04:29:58,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58" (1/1) ... [2022-02-21 04:29:58,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58" (1/1) ... [2022-02-21 04:29:58,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:29:58,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:29:58,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:29:58,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:29:58,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58" (1/1) ... [2022-02-21 04:29:58,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:58,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:58,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:29:58,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:29:58,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:29:58,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:29:58,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:29:58,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:29:58,495 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:29:58,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:29:58,878 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:29:58,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:29:58,886 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:29:58,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:29:58 BoogieIcfgContainer [2022-02-21 04:29:58,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:29:58,891 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:29:58,891 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:29:58,893 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:29:58,894 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:58,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:29:57" (1/3) ... [2022-02-21 04:29:58,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58e9d512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:29:58, skipping insertion in model container [2022-02-21 04:29:58,895 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:58,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:58" (2/3) ... [2022-02-21 04:29:58,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58e9d512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:29:58, skipping insertion in model container [2022-02-21 04:29:58,896 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:58,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:29:58" (3/3) ... [2022-02-21 04:29:58,900 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2022-02-21 04:29:58,930 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:29:58,930 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:29:58,930 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:29:58,930 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:29:58,930 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:29:58,930 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:29:58,930 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:29:58,930 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:29:58,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:58,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2022-02-21 04:29:58,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:58,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:59,003 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:29:59,003 INFO L843 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] [2022-02-21 04:29:59,003 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:29:59,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:59,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2022-02-21 04:29:59,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:59,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:59,019 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:29:59,019 INFO L843 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] [2022-02-21 04:29:59,026 INFO L791 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3);~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; 29#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 60#L230true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 104#L230-1true init_#res#1 := init_~tmp~0#1; 68#L391true main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 31#L22true assume !(0 == assume_abort_if_not_~cond#1); 76#L21true assume { :end_inline_assume_abort_if_not } true;~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#1 := 0; 27#L469-2true [2022-02-21 04:29:59,030 INFO L793 eck$LassoCheckResult]: Loop: 27#L469-2true assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 16#L78true 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#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 72#L82true assume !(node1_~m1~0#1 != ~nomsg~0); 10#L82-1true ~mode1~0 := 0; 33#L78-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 90#L106true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 85#L109true assume !(node2_~m2~0#1 != ~nomsg~0); 94#L109-1true ~mode2~0 := 0; 37#L106-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 32#L131true assume !(0 != ~mode3~0 % 256); 7#L144true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 59#L144-2true ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 74#L131-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 102#L156true assume !(0 != ~mode4~0 % 256); 44#L169true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 88#L169-2true ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 28#L156-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 73#L181true assume !(0 != ~mode5~0 % 256); 75#L194true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 101#L194-2true ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 35#L181-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 26#L206true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 84#L209true assume !(node6_~m6~0#1 != ~nomsg~0); 108#L209-1true ~mode6~0 := 0; 56#L206-2true assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 53#L399true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 97#L399-1true check_#res#1 := check_~tmp~1#1; 5#L419true main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 30#L502true assume !(0 == assert_~arg#1 % 256); 98#L497true assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 27#L469-2true [2022-02-21 04:29:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:59,047 INFO L85 PathProgramCache]: Analyzing trace with hash 2030119858, now seen corresponding path program 1 times [2022-02-21 04:29:59,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:59,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117969006] [2022-02-21 04:29:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:59,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:59,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {113#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3);~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; {113#true} is VALID [2022-02-21 04:29:59,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {113#true} is VALID [2022-02-21 04:29:59,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {113#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {115#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:29:59,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {115#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {116#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:29:59,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {116#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {117#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:29:59,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {114#false} is VALID [2022-02-21 04:29:59,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {114#false} assume { :end_inline_assume_abort_if_not } true;~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#1 := 0; {114#false} is VALID [2022-02-21 04:29:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:59,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:59,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117969006] [2022-02-21 04:29:59,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117969006] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:59,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:59,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:29:59,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678674748] [2022-02-21 04:29:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:59,244 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:29:59,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash 810754081, now seen corresponding path program 1 times [2022-02-21 04:29:59,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:59,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270706819] [2022-02-21 04:29:59,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:59,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:59,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#true} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:29:59,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#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#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:29:59,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume !(node1_~m1~0#1 != ~nomsg~0); {118#true} is VALID [2022-02-21 04:29:59,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#true} ~mode1~0 := 0; {118#true} is VALID [2022-02-21 04:29:59,411 INFO L290 TraceCheckUtils]: 4: Hoare triple {118#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:29:59,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:29:59,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} assume !(node2_~m2~0#1 != ~nomsg~0); {118#true} is VALID [2022-02-21 04:29:59,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {118#true} ~mode2~0 := 0; {118#true} is VALID [2022-02-21 04:29:59,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {118#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:29:59,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {118#true} assume !(0 != ~mode3~0 % 256); {118#true} is VALID [2022-02-21 04:29:59,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {118#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {118#true} is VALID [2022-02-21 04:29:59,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {118#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {118#true} is VALID [2022-02-21 04:29:59,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {118#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:29:59,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {118#true} assume !(0 != ~mode4~0 % 256); {118#true} is VALID [2022-02-21 04:29:59,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {118#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {118#true} is VALID [2022-02-21 04:29:59,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {118#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {118#true} is VALID [2022-02-21 04:29:59,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {118#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:29:59,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {118#true} assume !(0 != ~mode5~0 % 256); {118#true} is VALID [2022-02-21 04:29:59,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {118#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {118#true} is VALID [2022-02-21 04:29:59,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {118#true} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {118#true} is VALID [2022-02-21 04:29:59,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {118#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:29:59,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {118#true} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {118#true} is VALID [2022-02-21 04:29:59,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {118#true} assume !(node6_~m6~0#1 != ~nomsg~0); {118#true} is VALID [2022-02-21 04:29:59,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {118#true} ~mode6~0 := 0; {118#true} is VALID [2022-02-21 04:29:59,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {118#true} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {118#true} is VALID [2022-02-21 04:29:59,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {118#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {120#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:29:59,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {120#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {121#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:29:59,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {121#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {122#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:29:59,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {122#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {119#false} is VALID [2022-02-21 04:29:59,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {119#false} assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; {119#false} is VALID [2022-02-21 04:29:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:29:59,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:59,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270706819] [2022-02-21 04:29:59,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270706819] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:59,422 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:59,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:29:59,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561814148] [2022-02-21 04:29:59,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:59,423 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:29:59,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:59,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:29:59,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:29:59,446 INFO L87 Difference]: Start difference. First operand has 109 states, 108 states have (on average 1.7314814814814814) internal successors, (187), 108 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:59,796 INFO L93 Difference]: Finished difference Result 112 states and 186 transitions. [2022-02-21 04:29:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:29:59,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:59,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:59,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 186 transitions. [2022-02-21 04:29:59,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-02-21 04:29:59,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 104 states and 139 transitions. [2022-02-21 04:29:59,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2022-02-21 04:29:59,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2022-02-21 04:29:59,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 139 transitions. [2022-02-21 04:29:59,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:59,856 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2022-02-21 04:29:59,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 139 transitions. [2022-02-21 04:29:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-21 04:29:59,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:29:59,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states and 139 transitions. Second operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:59,886 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states and 139 transitions. Second operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:59,888 INFO L87 Difference]: Start difference. First operand 104 states and 139 transitions. Second operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:59,894 INFO L93 Difference]: Finished difference Result 104 states and 139 transitions. [2022-02-21 04:29:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 139 transitions. [2022-02-21 04:29:59,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:59,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:59,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states and 139 transitions. [2022-02-21 04:29:59,896 INFO L87 Difference]: Start difference. First operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states and 139 transitions. [2022-02-21 04:29:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:59,900 INFO L93 Difference]: Finished difference Result 104 states and 139 transitions. [2022-02-21 04:29:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 139 transitions. [2022-02-21 04:29:59,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:59,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:59,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:29:59,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:29:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 103 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:29:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 139 transitions. [2022-02-21 04:29:59,907 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2022-02-21 04:29:59,907 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 139 transitions. [2022-02-21 04:29:59,907 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:29:59,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 139 transitions. [2022-02-21 04:29:59,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-02-21 04:29:59,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:59,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:59,914 INFO L842 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] [2022-02-21 04:29:59,914 INFO L843 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] [2022-02-21 04:29:59,916 INFO L791 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3);~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; 279#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 280#L230 assume 0 == ~r1~0; 323#L231 assume ~id1~0 >= 0; 327#L232 assume 0 == ~st1~0; 312#L233 assume ~send1~0 == ~id1~0; 313#L234 assume 0 == ~mode1~0 % 256; 322#L235 assume ~id2~0 >= 0; 305#L236 assume 0 == ~st2~0; 306#L237 assume ~send2~0 == ~id2~0; 267#L238 assume 0 == ~mode2~0 % 256; 268#L239 assume ~id3~0 >= 0; 265#L240 assume 0 == ~st3~0; 266#L241 assume ~send3~0 == ~id3~0; 270#L242 assume 0 == ~mode3~0 % 256; 326#L243 assume ~id4~0 >= 0; 247#L244 assume 0 == ~st4~0; 248#L245 assume ~send4~0 == ~id4~0; 269#L246 assume 0 == ~mode4~0 % 256; 311#L247 assume ~id5~0 >= 0; 337#L248 assume 0 == ~st5~0; 243#L249 assume ~send5~0 == ~id5~0; 244#L250 assume 0 == ~mode5~0 % 256; 328#L251 assume ~id6~0 >= 0; 292#L252 assume 0 == ~st6~0; 293#L253 assume ~send6~0 == ~id6~0; 300#L254 assume 0 == ~mode6~0 % 256; 257#L255 assume ~id1~0 != ~id2~0; 258#L256 assume ~id1~0 != ~id3~0; 294#L257 assume ~id1~0 != ~id4~0; 271#L258 assume ~id1~0 != ~id5~0; 272#L259 assume ~id1~0 != ~id6~0; 314#L260 assume ~id2~0 != ~id3~0; 315#L261 assume ~id2~0 != ~id4~0; 301#L262 assume ~id2~0 != ~id5~0; 302#L263 assume ~id2~0 != ~id6~0; 307#L264 assume ~id3~0 != ~id4~0; 308#L265 assume ~id3~0 != ~id5~0; 253#L266 assume ~id3~0 != ~id6~0; 254#L267 assume ~id4~0 != ~id5~0; 259#L268 assume ~id4~0 != ~id6~0; 260#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 309#L230-1 init_#res#1 := init_~tmp~0#1; 331#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 282#L22 assume !(0 == assume_abort_if_not_~cond#1); 283#L21 assume { :end_inline_assume_abort_if_not } true;~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#1 := 0; 276#L469-2 [2022-02-21 04:29:59,917 INFO L793 eck$LassoCheckResult]: Loop: 276#L469-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 261#L78 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#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 262#L82 assume !(node1_~m1~0#1 != ~nomsg~0); 240#L82-1 ~mode1~0 := 0; 252#L78-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 286#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 339#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 320#L109-1 ~mode2~0 := 0; 288#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 284#L131 assume !(0 != ~mode3~0 % 256); 245#L144 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 246#L144-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 291#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 333#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 324#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 296#L159-1 ~mode4~0 := 0; 277#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 278#L181 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 329#L184 assume !(node5_~m5~0#1 != ~nomsg~0); 256#L184-1 ~mode5~0 := 0; 289#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 273#L206 assume !(0 != ~mode6~0 % 256); 274#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 342#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 321#L206-2 assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 316#L399 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 298#L399-1 check_#res#1 := check_~tmp~1#1; 241#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 242#L502 assume !(0 == assert_~arg#1 % 256); 281#L497 assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 276#L469-2 [2022-02-21 04:29:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 1 times [2022-02-21 04:29:59,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:59,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589739631] [2022-02-21 04:29:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:59,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:59,963 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:00,016 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:00,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1009736277, now seen corresponding path program 1 times [2022-02-21 04:30:00,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:00,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835450208] [2022-02-21 04:30:00,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:00,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:00,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#true} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {556#true} is VALID [2022-02-21 04:30:00,092 INFO L290 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#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {556#true} is VALID [2022-02-21 04:30:00,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} assume !(node1_~m1~0#1 != ~nomsg~0); {556#true} is VALID [2022-02-21 04:30:00,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {556#true} ~mode1~0 := 0; {556#true} is VALID [2022-02-21 04:30:00,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {556#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {556#true} is VALID [2022-02-21 04:30:00,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {556#true} is VALID [2022-02-21 04:30:00,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {556#true} assume !(node2_~m2~0#1 != ~nomsg~0); {556#true} is VALID [2022-02-21 04:30:00,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {556#true} ~mode2~0 := 0; {556#true} is VALID [2022-02-21 04:30:00,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {556#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {556#true} is VALID [2022-02-21 04:30:00,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#true} assume !(0 != ~mode3~0 % 256); {556#true} is VALID [2022-02-21 04:30:00,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {556#true} is VALID [2022-02-21 04:30:00,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {556#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {556#true} is VALID [2022-02-21 04:30:00,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {556#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {556#true} is VALID [2022-02-21 04:30:00,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {556#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {556#true} is VALID [2022-02-21 04:30:00,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#true} assume !(node4_~m4~0#1 != ~nomsg~0); {556#true} is VALID [2022-02-21 04:30:00,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {556#true} ~mode4~0 := 0; {556#true} is VALID [2022-02-21 04:30:00,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {556#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {556#true} is VALID [2022-02-21 04:30:00,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {556#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {556#true} is VALID [2022-02-21 04:30:00,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {556#true} assume !(node5_~m5~0#1 != ~nomsg~0); {556#true} is VALID [2022-02-21 04:30:00,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {556#true} ~mode5~0 := 0; {556#true} is VALID [2022-02-21 04:30:00,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {556#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {556#true} is VALID [2022-02-21 04:30:00,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {556#true} assume !(0 != ~mode6~0 % 256); {556#true} is VALID [2022-02-21 04:30:00,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {556#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {556#true} is VALID [2022-02-21 04:30:00,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {556#true} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {556#true} is VALID [2022-02-21 04:30:00,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {556#true} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {556#true} is VALID [2022-02-21 04:30:00,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {556#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {558#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:30:00,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {558#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {559#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:30:00,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {559#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {560#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:30:00,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {560#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {557#false} is VALID [2022-02-21 04:30:00,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {557#false} assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; {557#false} is VALID [2022-02-21 04:30:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:00,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:00,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835450208] [2022-02-21 04:30:00,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835450208] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:00,098 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:00,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:30:00,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898867270] [2022-02-21 04:30:00,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:00,099 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:00,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:00,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:30:00,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:30:00,099 INFO L87 Difference]: Start difference. First operand 104 states and 139 transitions. cyclomatic complexity: 36 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:00,379 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2022-02-21 04:30:00,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:30:00,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:00,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 141 transitions. [2022-02-21 04:30:00,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-02-21 04:30:00,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 104 states and 136 transitions. [2022-02-21 04:30:00,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2022-02-21 04:30:00,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2022-02-21 04:30:00,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 136 transitions. [2022-02-21 04:30:00,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:00,409 INFO L681 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2022-02-21 04:30:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 136 transitions. [2022-02-21 04:30:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-21 04:30:00,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:00,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states and 136 transitions. Second operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,413 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states and 136 transitions. Second operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,413 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:00,415 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2022-02-21 04:30:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2022-02-21 04:30:00,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:00,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:00,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states and 136 transitions. [2022-02-21 04:30:00,417 INFO L87 Difference]: Start difference. First operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states and 136 transitions. [2022-02-21 04:30:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:00,419 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2022-02-21 04:30:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2022-02-21 04:30:00,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:00,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:00,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:00,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2022-02-21 04:30:00,422 INFO L704 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2022-02-21 04:30:00,422 INFO L587 BuchiCegarLoop]: Abstraction has 104 states and 136 transitions. [2022-02-21 04:30:00,422 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:30:00,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 136 transitions. [2022-02-21 04:30:00,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2022-02-21 04:30:00,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:00,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:00,424 INFO L842 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] [2022-02-21 04:30:00,424 INFO L843 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] [2022-02-21 04:30:00,424 INFO L791 eck$LassoCheckResult]: Stem: 774#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3);~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; 712#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 713#L230 assume 0 == ~r1~0; 755#L231 assume ~id1~0 >= 0; 759#L232 assume 0 == ~st1~0; 744#L233 assume ~send1~0 == ~id1~0; 745#L234 assume 0 == ~mode1~0 % 256; 754#L235 assume ~id2~0 >= 0; 737#L236 assume 0 == ~st2~0; 738#L237 assume ~send2~0 == ~id2~0; 700#L238 assume 0 == ~mode2~0 % 256; 701#L239 assume ~id3~0 >= 0; 698#L240 assume 0 == ~st3~0; 699#L241 assume ~send3~0 == ~id3~0; 703#L242 assume 0 == ~mode3~0 % 256; 758#L243 assume ~id4~0 >= 0; 680#L244 assume 0 == ~st4~0; 681#L245 assume ~send4~0 == ~id4~0; 702#L246 assume 0 == ~mode4~0 % 256; 743#L247 assume ~id5~0 >= 0; 769#L248 assume 0 == ~st5~0; 676#L249 assume ~send5~0 == ~id5~0; 677#L250 assume 0 == ~mode5~0 % 256; 760#L251 assume ~id6~0 >= 0; 725#L252 assume 0 == ~st6~0; 726#L253 assume ~send6~0 == ~id6~0; 732#L254 assume 0 == ~mode6~0 % 256; 690#L255 assume ~id1~0 != ~id2~0; 691#L256 assume ~id1~0 != ~id3~0; 727#L257 assume ~id1~0 != ~id4~0; 704#L258 assume ~id1~0 != ~id5~0; 705#L259 assume ~id1~0 != ~id6~0; 746#L260 assume ~id2~0 != ~id3~0; 747#L261 assume ~id2~0 != ~id4~0; 733#L262 assume ~id2~0 != ~id5~0; 734#L263 assume ~id2~0 != ~id6~0; 739#L264 assume ~id3~0 != ~id4~0; 740#L265 assume ~id3~0 != ~id5~0; 686#L266 assume ~id3~0 != ~id6~0; 687#L267 assume ~id4~0 != ~id5~0; 692#L268 assume ~id4~0 != ~id6~0; 693#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 741#L230-1 init_#res#1 := init_~tmp~0#1; 763#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 715#L22 assume !(0 == assume_abort_if_not_~cond#1); 716#L21 assume { :end_inline_assume_abort_if_not } true;~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#1 := 0; 709#L469-2 [2022-02-21 04:30:00,424 INFO L793 eck$LassoCheckResult]: Loop: 709#L469-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 694#L78 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#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 695#L82 assume !(node1_~m1~0#1 != ~nomsg~0); 673#L82-1 ~mode1~0 := 0; 685#L78-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 719#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 772#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 752#L109-1 ~mode2~0 := 0; 721#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 717#L131 assume !(0 != ~mode3~0 % 256); 678#L144 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 679#L144-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 724#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 765#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 756#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 729#L159-1 ~mode4~0 := 0; 710#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 711#L181 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 761#L184 assume !(node5_~m5~0#1 != ~nomsg~0); 689#L184-1 ~mode5~0 := 0; 722#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 706#L206 assume !(0 != ~mode6~0 % 256); 707#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 775#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 753#L206-2 assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 748#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 749#L400 assume ~r1~0 >= 6; 731#L404 assume ~r1~0 < 6;check_~tmp~1#1 := 1; 771#L399-1 check_#res#1 := check_~tmp~1#1; 674#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 675#L502 assume !(0 == assert_~arg#1 % 256); 714#L497 assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 709#L469-2 [2022-02-21 04:30:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:00,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 2 times [2022-02-21 04:30:00,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:00,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814390168] [2022-02-21 04:30:00,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:00,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:00,443 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:00,461 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1109769157, now seen corresponding path program 1 times [2022-02-21 04:30:00,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:00,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479523531] [2022-02-21 04:30:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:00,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#true} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {989#true} is VALID [2022-02-21 04:30:00,493 INFO L290 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#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {989#true} is VALID [2022-02-21 04:30:00,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {989#true} assume !(node1_~m1~0#1 != ~nomsg~0); {989#true} is VALID [2022-02-21 04:30:00,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {989#true} ~mode1~0 := 0; {989#true} is VALID [2022-02-21 04:30:00,493 INFO L290 TraceCheckUtils]: 4: Hoare triple {989#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {989#true} is VALID [2022-02-21 04:30:00,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {989#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {989#true} is VALID [2022-02-21 04:30:00,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {989#true} assume !(node2_~m2~0#1 != ~nomsg~0); {989#true} is VALID [2022-02-21 04:30:00,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {989#true} ~mode2~0 := 0; {989#true} is VALID [2022-02-21 04:30:00,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {989#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {989#true} is VALID [2022-02-21 04:30:00,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {989#true} assume !(0 != ~mode3~0 % 256); {989#true} is VALID [2022-02-21 04:30:00,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {989#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {989#true} is VALID [2022-02-21 04:30:00,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {989#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {989#true} is VALID [2022-02-21 04:30:00,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {989#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {989#true} is VALID [2022-02-21 04:30:00,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {989#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {989#true} is VALID [2022-02-21 04:30:00,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {989#true} assume !(node4_~m4~0#1 != ~nomsg~0); {989#true} is VALID [2022-02-21 04:30:00,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {989#true} ~mode4~0 := 0; {989#true} is VALID [2022-02-21 04:30:00,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {989#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {989#true} is VALID [2022-02-21 04:30:00,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {989#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {989#true} is VALID [2022-02-21 04:30:00,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {989#true} assume !(node5_~m5~0#1 != ~nomsg~0); {989#true} is VALID [2022-02-21 04:30:00,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {989#true} ~mode5~0 := 0; {989#true} is VALID [2022-02-21 04:30:00,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {989#true} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {989#true} is VALID [2022-02-21 04:30:00,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {989#true} assume !(0 != ~mode6~0 % 256); {989#true} is VALID [2022-02-21 04:30:00,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {989#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {989#true} is VALID [2022-02-21 04:30:00,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {989#true} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {989#true} is VALID [2022-02-21 04:30:00,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {989#true} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {989#true} is VALID [2022-02-21 04:30:00,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {989#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {989#true} is VALID [2022-02-21 04:30:00,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {989#true} assume ~r1~0 >= 6; {991#(not (<= ~r1~0 5))} is VALID [2022-02-21 04:30:00,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {991#(not (<= ~r1~0 5))} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {990#false} is VALID [2022-02-21 04:30:00,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {990#false} check_#res#1 := check_~tmp~1#1; {990#false} is VALID [2022-02-21 04:30:00,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {990#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {990#false} is VALID [2022-02-21 04:30:00,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {990#false} assume !(0 == assert_~arg#1 % 256); {990#false} is VALID [2022-02-21 04:30:00,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {990#false} assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; {990#false} is VALID [2022-02-21 04:30:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:00,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:00,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479523531] [2022-02-21 04:30:00,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479523531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:00,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:00,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:00,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010222105] [2022-02-21 04:30:00,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:00,500 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:30:00,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:00,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:00,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:00,501 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:00,635 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2022-02-21 04:30:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:30:00,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:00,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 215 transitions. [2022-02-21 04:30:00,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2022-02-21 04:30:00,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 215 transitions. [2022-02-21 04:30:00,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2022-02-21 04:30:00,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2022-02-21 04:30:00,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 215 transitions. [2022-02-21 04:30:00,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:00,664 INFO L681 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2022-02-21 04:30:00,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 215 transitions. [2022-02-21 04:30:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-02-21 04:30:00,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:30:00,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states and 215 transitions. Second operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,668 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states and 215 transitions. Second operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,668 INFO L87 Difference]: Start difference. First operand 156 states and 215 transitions. Second operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:00,671 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2022-02-21 04:30:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2022-02-21 04:30:00,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:00,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:00,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 156 states and 215 transitions. [2022-02-21 04:30:00,672 INFO L87 Difference]: Start difference. First operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 156 states and 215 transitions. [2022-02-21 04:30:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:00,675 INFO L93 Difference]: Finished difference Result 156 states and 215 transitions. [2022-02-21 04:30:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2022-02-21 04:30:00,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:30:00,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:30:00,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:30:00,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:30:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2022-02-21 04:30:00,678 INFO L704 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2022-02-21 04:30:00,678 INFO L587 BuchiCegarLoop]: Abstraction has 156 states and 215 transitions. [2022-02-21 04:30:00,678 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:30:00,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 215 transitions. [2022-02-21 04:30:00,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2022-02-21 04:30:00,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:00,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:00,680 INFO L842 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] [2022-02-21 04:30:00,680 INFO L843 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] [2022-02-21 04:30:00,680 INFO L791 eck$LassoCheckResult]: Stem: 1253#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3);~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; 1189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 1190#L230 assume 0 == ~r1~0; 1235#L231 assume ~id1~0 >= 0; 1237#L232 assume 0 == ~st1~0; 1221#L233 assume ~send1~0 == ~id1~0; 1222#L234 assume 0 == ~mode1~0 % 256; 1231#L235 assume ~id2~0 >= 0; 1214#L236 assume 0 == ~st2~0; 1215#L237 assume ~send2~0 == ~id2~0; 1176#L238 assume 0 == ~mode2~0 % 256; 1177#L239 assume ~id3~0 >= 0; 1174#L240 assume 0 == ~st3~0; 1175#L241 assume ~send3~0 == ~id3~0; 1179#L242 assume 0 == ~mode3~0 % 256; 1236#L243 assume ~id4~0 >= 0; 1156#L244 assume 0 == ~st4~0; 1157#L245 assume ~send4~0 == ~id4~0; 1178#L246 assume 0 == ~mode4~0 % 256; 1220#L247 assume ~id5~0 >= 0; 1250#L248 assume 0 == ~st5~0; 1152#L249 assume ~send5~0 == ~id5~0; 1153#L250 assume 0 == ~mode5~0 % 256; 1238#L251 assume ~id6~0 >= 0; 1202#L252 assume 0 == ~st6~0; 1203#L253 assume ~send6~0 == ~id6~0; 1209#L254 assume 0 == ~mode6~0 % 256; 1166#L255 assume ~id1~0 != ~id2~0; 1167#L256 assume ~id1~0 != ~id3~0; 1204#L257 assume ~id1~0 != ~id4~0; 1180#L258 assume ~id1~0 != ~id5~0; 1181#L259 assume ~id1~0 != ~id6~0; 1223#L260 assume ~id2~0 != ~id3~0; 1224#L261 assume ~id2~0 != ~id4~0; 1210#L262 assume ~id2~0 != ~id5~0; 1211#L263 assume ~id2~0 != ~id6~0; 1216#L264 assume ~id3~0 != ~id4~0; 1217#L265 assume ~id3~0 != ~id5~0; 1162#L266 assume ~id3~0 != ~id6~0; 1163#L267 assume ~id4~0 != ~id5~0; 1168#L268 assume ~id4~0 != ~id6~0; 1169#L269 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 1218#L230-1 init_#res#1 := init_~tmp~0#1; 1241#L391 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 1191#L22 assume !(0 == assume_abort_if_not_~cond#1); 1192#L21 assume { :end_inline_assume_abort_if_not } true;~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#1 := 0; 1245#L469-2 [2022-02-21 04:30:00,680 INFO L793 eck$LassoCheckResult]: Loop: 1245#L469-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1299#L78 assume !(0 != ~mode1~0 % 256); 1298#L94 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; 1297#L94-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 1161#L78-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 1296#L106 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1293#L109 assume !(node2_~m2~0#1 != ~nomsg~0); 1291#L109-1 ~mode2~0 := 0; 1289#L106-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1288#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1286#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 1283#L134-1 ~mode3~0 := 0; 1281#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1280#L156 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1278#L159 assume !(node4_~m4~0#1 != ~nomsg~0); 1275#L159-1 ~mode4~0 := 0; 1273#L156-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1272#L181 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1270#L184 assume !(node5_~m5~0#1 != ~nomsg~0); 1267#L184-1 ~mode5~0 := 0; 1265#L181-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 1264#L206 assume !(0 != ~mode6~0 % 256); 1254#L219 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 1255#L219-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 1259#L206-2 assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1258#L399 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 1257#L400 assume !(~r1~0 >= 6); 1207#L403 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 1208#L404 assume ~r1~0 < 6;check_~tmp~1#1 := 1; 1303#L399-1 check_#res#1 := check_~tmp~1#1; 1302#L419 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 1301#L502 assume !(0 == assert_~arg#1 % 256); 1300#L497 assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 1245#L469-2 [2022-02-21 04:30:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:00,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1716035805, now seen corresponding path program 3 times [2022-02-21 04:30:00,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:00,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658196412] [2022-02-21 04:30:00,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:00,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:00,696 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:00,725 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:00,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:00,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1399528399, now seen corresponding path program 1 times [2022-02-21 04:30:00,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:00,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096573044] [2022-02-21 04:30:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:00,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:00,762 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:30:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:30:00,774 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:30:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:00,776 INFO L85 PathProgramCache]: Analyzing trace with hash -191649555, now seen corresponding path program 1 times [2022-02-21 04:30:00,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:30:00,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443837504] [2022-02-21 04:30:00,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:30:00,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:30:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:00,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {1623#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3);~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; {1623#true} is VALID [2022-02-21 04:30:00,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1623#true} is VALID [2022-02-21 04:30:00,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume 0 == ~r1~0; {1623#true} is VALID [2022-02-21 04:30:00,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {1623#true} assume ~id1~0 >= 0; {1623#true} is VALID [2022-02-21 04:30:00,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {1623#true} assume 0 == ~st1~0; {1623#true} is VALID [2022-02-21 04:30:00,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {1623#true} assume ~send1~0 == ~id1~0; {1623#true} is VALID [2022-02-21 04:30:00,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {1623#true} assume 0 == ~mode1~0 % 256; {1623#true} is VALID [2022-02-21 04:30:00,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {1623#true} assume ~id2~0 >= 0; {1623#true} is VALID [2022-02-21 04:30:00,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {1623#true} assume 0 == ~st2~0; {1623#true} is VALID [2022-02-21 04:30:00,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {1623#true} assume ~send2~0 == ~id2~0; {1623#true} is VALID [2022-02-21 04:30:00,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {1623#true} assume 0 == ~mode2~0 % 256; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,840 INFO L290 TraceCheckUtils]: 39: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,841 INFO L290 TraceCheckUtils]: 41: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,842 INFO L290 TraceCheckUtils]: 43: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,842 INFO L290 TraceCheckUtils]: 44: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~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#1 := 0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,844 INFO L290 TraceCheckUtils]: 48: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:30:00,846 INFO L290 TraceCheckUtils]: 51: Hoare triple {1625#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1624#false} is VALID [2022-02-21 04:30:00,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {1624#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1624#false} is VALID [2022-02-21 04:30:00,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {1624#false} ~mode2~0 := 0; {1624#false} is VALID [2022-02-21 04:30:00,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {1624#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1624#false} is VALID [2022-02-21 04:30:00,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {1624#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1624#false} is VALID [2022-02-21 04:30:00,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {1624#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1624#false} is VALID [2022-02-21 04:30:00,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {1624#false} ~mode3~0 := 0; {1624#false} is VALID [2022-02-21 04:30:00,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {1624#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1624#false} is VALID [2022-02-21 04:30:00,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {1624#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1624#false} is VALID [2022-02-21 04:30:00,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {1624#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1624#false} is VALID [2022-02-21 04:30:00,847 INFO L290 TraceCheckUtils]: 61: Hoare triple {1624#false} ~mode4~0 := 0; {1624#false} is VALID [2022-02-21 04:30:00,847 INFO L290 TraceCheckUtils]: 62: Hoare triple {1624#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1624#false} is VALID [2022-02-21 04:30:00,847 INFO L290 TraceCheckUtils]: 63: Hoare triple {1624#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1624#false} is VALID [2022-02-21 04:30:00,847 INFO L290 TraceCheckUtils]: 64: Hoare triple {1624#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1624#false} is VALID [2022-02-21 04:30:00,848 INFO L290 TraceCheckUtils]: 65: Hoare triple {1624#false} ~mode5~0 := 0; {1624#false} is VALID [2022-02-21 04:30:00,848 INFO L290 TraceCheckUtils]: 66: Hoare triple {1624#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1624#false} is VALID [2022-02-21 04:30:00,848 INFO L290 TraceCheckUtils]: 67: Hoare triple {1624#false} assume !(0 != ~mode6~0 % 256); {1624#false} is VALID [2022-02-21 04:30:00,848 INFO L290 TraceCheckUtils]: 68: Hoare triple {1624#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {1624#false} is VALID [2022-02-21 04:30:00,848 INFO L290 TraceCheckUtils]: 69: Hoare triple {1624#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {1624#false} is VALID [2022-02-21 04:30:00,848 INFO L290 TraceCheckUtils]: 70: Hoare triple {1624#false} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1624#false} is VALID [2022-02-21 04:30:00,848 INFO L290 TraceCheckUtils]: 71: Hoare triple {1624#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1624#false} is VALID [2022-02-21 04:30:00,848 INFO L290 TraceCheckUtils]: 72: Hoare triple {1624#false} assume !(~r1~0 >= 6); {1624#false} is VALID [2022-02-21 04:30:00,848 INFO L290 TraceCheckUtils]: 73: Hoare triple {1624#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {1624#false} is VALID [2022-02-21 04:30:00,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {1624#false} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {1624#false} is VALID [2022-02-21 04:30:00,855 INFO L290 TraceCheckUtils]: 75: Hoare triple {1624#false} check_#res#1 := check_~tmp~1#1; {1624#false} is VALID [2022-02-21 04:30:00,855 INFO L290 TraceCheckUtils]: 76: Hoare triple {1624#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1624#false} is VALID [2022-02-21 04:30:00,855 INFO L290 TraceCheckUtils]: 77: Hoare triple {1624#false} assume !(0 == assert_~arg#1 % 256); {1624#false} is VALID [2022-02-21 04:30:00,855 INFO L290 TraceCheckUtils]: 78: Hoare triple {1624#false} assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; {1624#false} is VALID [2022-02-21 04:30:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:00,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:30:00,856 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443837504] [2022-02-21 04:30:00,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443837504] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:30:00,856 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:30:00,856 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:30:00,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971423732] [2022-02-21 04:30:00,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:30:01,815 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:30:01,816 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:30:01,816 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:30:01,816 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:30:01,816 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:30:01,816 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:01,816 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:30:01,816 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:30:01,816 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6.1.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2022-02-21 04:30:01,816 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:30:01,816 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:30:01,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:01,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:02,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:02,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:02,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:02,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:02,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:02,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:02,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:02,719 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-02-21 04:30:10,198 WARN L228 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 172 DAG size of output: 142 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-02-21 04:30:10,366 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:30:10,366 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:30:10,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:10,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:10,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:10,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:30:10,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:30:10,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:30:10,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:10,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:10,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:10,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:10,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:30:10,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:30:10,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:30:10,531 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:30:10,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:10,536 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:30:10,536 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:30:10,536 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:30:10,536 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:30:10,536 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:30:10,536 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:10,536 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:30:10,536 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:30:10,536 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6.1.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2022-02-21 04:30:10,536 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:30:10,536 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:30:10,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:10,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:30:11,470 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-02-21 04:30:18,543 WARN L228 SmtUtils]: Spent 7.02s on a formula simplification. DAG size of input: 172 DAG size of output: 142 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-02-21 04:30:18,689 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:30:18,693 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:30:18,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:18,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:18,695 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:18,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:30:18,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:18,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:18,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:18,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:18,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:18,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:18,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:18,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:18,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:18,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:18,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:18,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:18,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:18,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:30:18,728 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:18,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:18,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:18,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:18,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:18,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:18,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:18,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:18,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:18,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:18,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:18,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:18,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:18,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:30:18,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:18,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:18,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:18,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:18,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:18,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:18,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:18,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:18,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:18,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:18,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:18,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:18,781 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:18,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:30:18,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:18,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:18,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:18,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:18,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:18,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:18,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:18,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:18,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:18,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:18,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:18,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:18,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:18,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:30:18,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:18,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:18,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:18,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:18,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:18,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:18,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:18,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:18,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:18,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 04:30:18,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:18,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:18,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:18,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:30:18,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:18,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:18,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:18,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:18,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:18,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:18,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:18,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:18,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:18,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:18,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:18,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:18,860 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:18,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:30:18,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:18,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:18,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:18,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:18,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:18,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:18,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:18,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:18,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:18,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:18,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:18,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:18,891 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:18,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:30:18,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:18,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:18,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:18,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:18,899 INFO L204 nArgumentSynthesizer]: 24 loop disjuncts [2022-02-21 04:30:18,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:19,046 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2022-02-21 04:30:19,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:19,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:19,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:19,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:19,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:19,229 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:19,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:30:19,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:19,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:19,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:19,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:19,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:19,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:19,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:19,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:19,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:19,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:19,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:19,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:19,272 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:19,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:30:19,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:19,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:19,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:19,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:19,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:19,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:19,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:19,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:19,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:19,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:19,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:19,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:19,318 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:19,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:30:19,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:19,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:19,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:19,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:19,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:19,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:19,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:19,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:19,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:30:19,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:19,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:19,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:19,362 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:19,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:30:19,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:30:19,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:30:19,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:30:19,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:30:19,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:30:19,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:30:19,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:30:19,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:30:19,393 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:30:19,397 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:30:19,397 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:30:19,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:30:19,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:30:19,406 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:30:19,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:30:19,427 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:30:19,427 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:30:19,427 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:30:19,428 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 23 Supporting invariants [] [2022-02-21 04:30:19,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:19,458 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:30:19,463 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "assume !(0 != ~mode1~0 % 256);" "assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0;" "~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0#1 != ~nomsg~0);" "~mode2~0 := 0;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0#1 != ~nomsg~0);" "~mode3~0 := 0;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0#1 != ~nomsg~0);" "~mode4~0 := 0;" "assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0#1 != ~nomsg~0);" "~mode5~0 := 0;" "assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0;" "assume !(0 != ~mode6~0 % 256);" "assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0;" "~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1;" "assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#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 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1;" [2022-02-21 04:30:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:19,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:30:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:19,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:30:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:19,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:30:19,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {1626#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);call #Ultimate.allocInit(12, 3);~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; {1626#unseeded} is VALID [2022-02-21 04:30:19,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {1626#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1626#unseeded} is VALID [2022-02-21 04:30:19,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {1626#unseeded} assume 0 == ~r1~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {1626#unseeded} assume ~id1~0 >= 0; {1626#unseeded} is VALID [2022-02-21 04:30:19,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {1626#unseeded} assume 0 == ~st1~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {1626#unseeded} assume ~send1~0 == ~id1~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {1626#unseeded} assume 0 == ~mode1~0 % 256; {1626#unseeded} is VALID [2022-02-21 04:30:19,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {1626#unseeded} assume ~id2~0 >= 0; {1626#unseeded} is VALID [2022-02-21 04:30:19,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {1626#unseeded} assume 0 == ~st2~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {1626#unseeded} assume ~send2~0 == ~id2~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {1626#unseeded} assume 0 == ~mode2~0 % 256; {1626#unseeded} is VALID [2022-02-21 04:30:19,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {1626#unseeded} assume ~id3~0 >= 0; {1626#unseeded} is VALID [2022-02-21 04:30:19,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#unseeded} assume 0 == ~st3~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {1626#unseeded} assume ~send3~0 == ~id3~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {1626#unseeded} assume 0 == ~mode3~0 % 256; {1626#unseeded} is VALID [2022-02-21 04:30:19,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {1626#unseeded} assume ~id4~0 >= 0; {1626#unseeded} is VALID [2022-02-21 04:30:19,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {1626#unseeded} assume 0 == ~st4~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {1626#unseeded} assume ~send4~0 == ~id4~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {1626#unseeded} assume 0 == ~mode4~0 % 256; {1626#unseeded} is VALID [2022-02-21 04:30:19,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {1626#unseeded} assume ~id5~0 >= 0; {1626#unseeded} is VALID [2022-02-21 04:30:19,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {1626#unseeded} assume 0 == ~st5~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {1626#unseeded} assume ~send5~0 == ~id5~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {1626#unseeded} assume 0 == ~mode5~0 % 256; {1626#unseeded} is VALID [2022-02-21 04:30:19,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {1626#unseeded} assume ~id6~0 >= 0; {1626#unseeded} is VALID [2022-02-21 04:30:19,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {1626#unseeded} assume 0 == ~st6~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {1626#unseeded} assume ~send6~0 == ~id6~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {1626#unseeded} assume 0 == ~mode6~0 % 256; {1626#unseeded} is VALID [2022-02-21 04:30:19,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {1626#unseeded} assume ~id1~0 != ~id2~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {1626#unseeded} assume ~id1~0 != ~id3~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {1626#unseeded} assume ~id1~0 != ~id4~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {1626#unseeded} assume ~id1~0 != ~id5~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {1626#unseeded} assume ~id1~0 != ~id6~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {1626#unseeded} assume ~id2~0 != ~id3~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {1626#unseeded} assume ~id2~0 != ~id4~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {1626#unseeded} assume ~id2~0 != ~id5~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {1626#unseeded} assume ~id2~0 != ~id6~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {1626#unseeded} assume ~id3~0 != ~id4~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {1626#unseeded} assume ~id3~0 != ~id5~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {1626#unseeded} assume ~id3~0 != ~id6~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {1626#unseeded} assume ~id4~0 != ~id5~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {1626#unseeded} assume ~id4~0 != ~id6~0; {1626#unseeded} is VALID [2022-02-21 04:30:19,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {1626#unseeded} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1626#unseeded} is VALID [2022-02-21 04:30:19,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {1626#unseeded} init_#res#1 := init_~tmp~0#1; {1626#unseeded} is VALID [2022-02-21 04:30:19,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {1626#unseeded} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1626#unseeded} is VALID [2022-02-21 04:30:19,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {1626#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {1626#unseeded} is VALID [2022-02-21 04:30:19,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {1626#unseeded} assume { :end_inline_assume_abort_if_not } true;~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#1 := 0; {1626#unseeded} is VALID [2022-02-21 04:30:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:19,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:30:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:30:19,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:30:19,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#(>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(0 != ~mode1~0 % 256); {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node2_~m2~0#1 != ~nomsg~0); {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode2~0 := 0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node3_~m3~0#1 != ~nomsg~0); {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode3~0 := 0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node4_~m4~0#1 != ~nomsg~0); {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode4~0 := 0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(node5_~m5~0#1 != ~nomsg~0); {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~mode5~0 := 0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(0 != ~mode6~0 % 256); {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_node6 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(~r1~0 >= 6); {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} check_#res#1 := check_~tmp~1#1; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume !(0 == assert_~arg#1 % 256); {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} is VALID [2022-02-21 04:30:19,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {1779#(and (< |ULTIMATE.start_main_~i2~0#1| 12) (>= oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))))} assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; {1639#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 23 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:30:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:30:19,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:19,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:19,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 33 letters. [2022-02-21 04:30:19,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:19,928 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 [2022-02-21 04:30:19,928 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 156 states and 215 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:20,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 156 states and 215 transitions. cyclomatic complexity: 60. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 265 states and 384 transitions. Complement of second has 4 states. [2022-02-21 04:30:20,060 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 [2022-02-21 04:30:20,060 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:30:20,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 215 transitions. cyclomatic complexity: 60 [2022-02-21 04:30:20,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:20,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:20,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:20,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:30:20,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:30:20,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:30:20,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 384 transitions. [2022-02-21 04:30:20,064 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:30:20,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:30:20,066 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 156 states and 215 transitions. cyclomatic complexity: 60 [2022-02-21 04:30:20,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:30:20,139 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 110 examples of accepted words. [2022-02-21 04:30:20,140 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:20,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:30:20,141 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:30:20,142 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 265 states and 384 transitions. cyclomatic complexity: 120 [2022-02-21 04:30:20,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 265 states and 384 transitions. cyclomatic complexity: 120 [2022-02-21 04:30:20,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:30:20,142 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:30:20,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 46 letters. Loop has 33 letters. [2022-02-21 04:30:20,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 33 letters. [2022-02-21 04:30:20,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 46 letters. Loop has 33 letters. [2022-02-21 04:30:20,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:30:20,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:30:20,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:30:20,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 265 letters. Loop has 265 letters. [2022-02-21 04:30:20,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 265 letters. Loop has 265 letters. [2022-02-21 04:30:20,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 265 letters. Loop has 265 letters. [2022-02-21 04:30:20,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 156 letters. Loop has 156 letters. [2022-02-21 04:30:20,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 156 letters. Loop has 156 letters. [2022-02-21 04:30:20,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 156 letters. Loop has 156 letters. [2022-02-21 04:30:20,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:30:20,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:30:20,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:30:20,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:30:20,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:30:20,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 59 letters. Loop has 33 letters. [2022-02-21 04:30:20,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:30:20,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:30:20,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:30:20,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:30:20,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:30:20,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:30:20,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:30:20,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:30:20,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:30:20,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 57 letters. Loop has 34 letters. [2022-02-21 04:30:20,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 34 letters. [2022-02-21 04:30:20,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 57 letters. Loop has 34 letters. [2022-02-21 04:30:20,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:30:20,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:30:20,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:30:20,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:30:20,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:30:20,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:30:20,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:30:20,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:30:20,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:30:20,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:30:20,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:30:20,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:30:20,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:30:20,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:30:20,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:30:20,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 53 letters. Loop has 33 letters. [2022-02-21 04:30:20,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 33 letters. [2022-02-21 04:30:20,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 33 letters. [2022-02-21 04:30:20,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 53 letters. Loop has 33 letters. [2022-02-21 04:30:20,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 33 letters. [2022-02-21 04:30:20,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 33 letters. [2022-02-21 04:30:20,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 54 letters. Loop has 35 letters. [2022-02-21 04:30:20,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 35 letters. [2022-02-21 04:30:20,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 54 letters. Loop has 35 letters. [2022-02-21 04:30:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:30:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:30:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:30:20,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 53 letters. Loop has 34 letters. [2022-02-21 04:30:20,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 34 letters. [2022-02-21 04:30:20,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 53 letters. Loop has 34 letters. [2022-02-21 04:30:20,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:30:20,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:30:20,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:30:20,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:30:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:30:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:30:20,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 49 letters. Loop has 33 letters. [2022-02-21 04:30:20,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 33 letters. [2022-02-21 04:30:20,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 49 letters. Loop has 33 letters. [2022-02-21 04:30:20,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 48 letters. Loop has 33 letters. [2022-02-21 04:30:20,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 33 letters. [2022-02-21 04:30:20,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 48 letters. Loop has 33 letters. [2022-02-21 04:30:20,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 47 letters. Loop has 33 letters. [2022-02-21 04:30:20,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 33 letters. [2022-02-21 04:30:20,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 47 letters. Loop has 33 letters. [2022-02-21 04:30:20,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:30:20,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:30:20,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:30:20,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:30:20,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:30:20,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:30:20,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 76 letters. Loop has 33 letters. [2022-02-21 04:30:20,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 33 letters. [2022-02-21 04:30:20,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 76 letters. Loop has 33 letters. [2022-02-21 04:30:20,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:30:20,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:30:20,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:30:20,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 50 letters. Loop has 35 letters. [2022-02-21 04:30:20,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 35 letters. [2022-02-21 04:30:20,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 50 letters. Loop has 35 letters. [2022-02-21 04:30:20,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 49 letters. Loop has 33 letters. [2022-02-21 04:30:20,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 33 letters. [2022-02-21 04:30:20,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 49 letters. Loop has 33 letters. [2022-02-21 04:30:20,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 76 letters. Loop has 33 letters. [2022-02-21 04:30:20,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 33 letters. [2022-02-21 04:30:20,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 76 letters. Loop has 33 letters. [2022-02-21 04:30:20,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:30:20,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:30:20,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 77 letters. Loop has 33 letters. [2022-02-21 04:30:20,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 89 letters. Loop has 33 letters. [2022-02-21 04:30:20,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 33 letters. [2022-02-21 04:30:20,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 89 letters. Loop has 33 letters. [2022-02-21 04:30:20,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 90 letters. Loop has 33 letters. [2022-02-21 04:30:20,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 33 letters. [2022-02-21 04:30:20,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 90 letters. Loop has 33 letters. [2022-02-21 04:30:20,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 102 letters. Loop has 34 letters. [2022-02-21 04:30:20,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 102 letters. Loop has 34 letters. [2022-02-21 04:30:20,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 102 letters. Loop has 34 letters. [2022-02-21 04:30:20,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:30:20,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:30:20,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:30:20,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 103 letters. Loop has 35 letters. [2022-02-21 04:30:20,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 103 letters. Loop has 35 letters. [2022-02-21 04:30:20,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 103 letters. Loop has 35 letters. [2022-02-21 04:30:20,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 50 letters. Loop has 33 letters. [2022-02-21 04:30:20,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 33 letters. [2022-02-21 04:30:20,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 50 letters. Loop has 33 letters. [2022-02-21 04:30:20,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 99 letters. Loop has 35 letters. [2022-02-21 04:30:20,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 99 letters. Loop has 35 letters. [2022-02-21 04:30:20,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 99 letters. Loop has 35 letters. [2022-02-21 04:30:20,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 98 letters. Loop has 33 letters. [2022-02-21 04:30:20,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 98 letters. Loop has 33 letters. [2022-02-21 04:30:20,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 98 letters. Loop has 33 letters. [2022-02-21 04:30:20,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:30:20,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:30:20,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 80 letters. Loop has 33 letters. [2022-02-21 04:30:20,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 48 letters. Loop has 33 letters. [2022-02-21 04:30:20,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 33 letters. [2022-02-21 04:30:20,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 48 letters. Loop has 33 letters. [2022-02-21 04:30:20,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:30:20,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:30:20,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 81 letters. Loop has 33 letters. [2022-02-21 04:30:20,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 49 letters. Loop has 34 letters. [2022-02-21 04:30:20,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 34 letters. [2022-02-21 04:30:20,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 49 letters. Loop has 34 letters. [2022-02-21 04:30:20,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 100 letters. Loop has 33 letters. [2022-02-21 04:30:20,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 100 letters. Loop has 33 letters. [2022-02-21 04:30:20,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 100 letters. Loop has 33 letters. [2022-02-21 04:30:20,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:30:20,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:30:20,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:30:20,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:30:20,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:30:20,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 101 letters. Loop has 33 letters. [2022-02-21 04:30:20,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:30:20,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:30:20,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:30:20,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 95 letters. Loop has 33 letters. [2022-02-21 04:30:20,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 33 letters. [2022-02-21 04:30:20,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 95 letters. Loop has 33 letters. [2022-02-21 04:30:20,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 96 letters. Loop has 33 letters. [2022-02-21 04:30:20,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 33 letters. [2022-02-21 04:30:20,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 96 letters. Loop has 33 letters. [2022-02-21 04:30:20,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:30:20,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:30:20,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 78 letters. Loop has 33 letters. [2022-02-21 04:30:20,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 88 letters. Loop has 33 letters. [2022-02-21 04:30:20,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 33 letters. [2022-02-21 04:30:20,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 88 letters. Loop has 33 letters. [2022-02-21 04:30:20,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 89 letters. Loop has 33 letters. [2022-02-21 04:30:20,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 33 letters. [2022-02-21 04:30:20,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 89 letters. Loop has 33 letters. [2022-02-21 04:30:20,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 83 letters. Loop has 33 letters. [2022-02-21 04:30:20,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 33 letters. [2022-02-21 04:30:20,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 83 letters. Loop has 33 letters. [2022-02-21 04:30:20,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 84 letters. Loop has 33 letters. [2022-02-21 04:30:20,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 33 letters. [2022-02-21 04:30:20,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 84 letters. Loop has 33 letters. [2022-02-21 04:30:20,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 86 letters. Loop has 33 letters. [2022-02-21 04:30:20,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 33 letters. [2022-02-21 04:30:20,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 86 letters. Loop has 33 letters. [2022-02-21 04:30:20,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 87 letters. Loop has 33 letters. [2022-02-21 04:30:20,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 33 letters. [2022-02-21 04:30:20,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 87 letters. Loop has 33 letters. [2022-02-21 04:30:20,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 99 letters. Loop has 33 letters. [2022-02-21 04:30:20,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 99 letters. Loop has 33 letters. [2022-02-21 04:30:20,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 99 letters. Loop has 33 letters. [2022-02-21 04:30:20,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 90 letters. Loop has 33 letters. [2022-02-21 04:30:20,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 33 letters. [2022-02-21 04:30:20,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 90 letters. Loop has 33 letters. [2022-02-21 04:30:20,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 91 letters. Loop has 33 letters. [2022-02-21 04:30:20,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 33 letters. [2022-02-21 04:30:20,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 91 letters. Loop has 33 letters. [2022-02-21 04:30:20,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 95 letters. Loop has 35 letters. [2022-02-21 04:30:20,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 35 letters. [2022-02-21 04:30:20,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 95 letters. Loop has 35 letters. [2022-02-21 04:30:20,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 94 letters. Loop has 33 letters. [2022-02-21 04:30:20,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 33 letters. [2022-02-21 04:30:20,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 94 letters. Loop has 33 letters. [2022-02-21 04:30:20,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:30:20,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:30:20,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:30:20,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:30:20,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:30:20,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:30:20,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 93 letters. Loop has 33 letters. [2022-02-21 04:30:20,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 33 letters. [2022-02-21 04:30:20,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 93 letters. Loop has 33 letters. [2022-02-21 04:30:20,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 94 letters. Loop has 33 letters. [2022-02-21 04:30:20,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 33 letters. [2022-02-21 04:30:20,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 94 letters. Loop has 33 letters. [2022-02-21 04:30:20,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 91 letters. Loop has 35 letters. [2022-02-21 04:30:20,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 35 letters. [2022-02-21 04:30:20,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 91 letters. Loop has 35 letters. [2022-02-21 04:30:20,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 104 letters. Loop has 33 letters. [2022-02-21 04:30:20,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 104 letters. Loop has 33 letters. [2022-02-21 04:30:20,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 104 letters. Loop has 33 letters. [2022-02-21 04:30:20,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 105 letters. Loop has 33 letters. [2022-02-21 04:30:20,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 105 letters. Loop has 33 letters. [2022-02-21 04:30:20,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 105 letters. Loop has 33 letters. [2022-02-21 04:30:20,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 86 letters. Loop has 34 letters. [2022-02-21 04:30:20,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 34 letters. [2022-02-21 04:30:20,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 86 letters. Loop has 34 letters. [2022-02-21 04:30:20,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:30:20,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:30:20,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:30:20,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 86 letters. Loop has 33 letters. [2022-02-21 04:30:20,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 33 letters. [2022-02-21 04:30:20,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 86 letters. Loop has 33 letters. [2022-02-21 04:30:20,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 103 letters. Loop has 33 letters. [2022-02-21 04:30:20,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 103 letters. Loop has 33 letters. [2022-02-21 04:30:20,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 103 letters. Loop has 33 letters. [2022-02-21 04:30:20,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 93 letters. Loop has 33 letters. [2022-02-21 04:30:20,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 33 letters. [2022-02-21 04:30:20,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 93 letters. Loop has 33 letters. [2022-02-21 04:30:20,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 94 letters. Loop has 34 letters. [2022-02-21 04:30:20,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 34 letters. [2022-02-21 04:30:20,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 94 letters. Loop has 34 letters. [2022-02-21 04:30:20,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:30:20,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:30:20,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 73 letters. Loop has 33 letters. [2022-02-21 04:30:20,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 97 letters. Loop has 33 letters. [2022-02-21 04:30:20,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 33 letters. [2022-02-21 04:30:20,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 97 letters. Loop has 33 letters. [2022-02-21 04:30:20,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 98 letters. Loop has 34 letters. [2022-02-21 04:30:20,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 98 letters. Loop has 34 letters. [2022-02-21 04:30:20,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 98 letters. Loop has 34 letters. [2022-02-21 04:30:20,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 97 letters. Loop has 33 letters. [2022-02-21 04:30:20,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 33 letters. [2022-02-21 04:30:20,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 97 letters. Loop has 33 letters. [2022-02-21 04:30:20,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 92 letters. Loop has 33 letters. [2022-02-21 04:30:20,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 33 letters. [2022-02-21 04:30:20,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 92 letters. Loop has 33 letters. [2022-02-21 04:30:20,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 98 letters. Loop has 33 letters. [2022-02-21 04:30:20,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 98 letters. Loop has 33 letters. [2022-02-21 04:30:20,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 98 letters. Loop has 33 letters. [2022-02-21 04:30:20,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 46 letters. Loop has 33 letters. [2022-02-21 04:30:20,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 33 letters. [2022-02-21 04:30:20,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 46 letters. Loop has 33 letters. [2022-02-21 04:30:20,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 90 letters. Loop has 34 letters. [2022-02-21 04:30:20,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 34 letters. [2022-02-21 04:30:20,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 90 letters. Loop has 34 letters. [2022-02-21 04:30:20,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:30:20,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:30:20,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 82 letters. Loop has 33 letters. [2022-02-21 04:30:20,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:30:20,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:30:20,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 74 letters. Loop has 33 letters. [2022-02-21 04:30:20,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:30:20,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:30:20,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 75 letters. Loop has 33 letters. [2022-02-21 04:30:20,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 85 letters. Loop has 33 letters. [2022-02-21 04:30:20,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 33 letters. [2022-02-21 04:30:20,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 85 letters. Loop has 33 letters. [2022-02-21 04:30:20,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 85 letters. Loop has 33 letters. [2022-02-21 04:30:20,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 33 letters. [2022-02-21 04:30:20,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 85 letters. Loop has 33 letters. [2022-02-21 04:30:20,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 68 letters. Loop has 33 letters. [2022-02-21 04:30:20,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 33 letters. [2022-02-21 04:30:20,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 68 letters. Loop has 33 letters. [2022-02-21 04:30:20,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 69 letters. Loop has 33 letters. [2022-02-21 04:30:20,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 33 letters. [2022-02-21 04:30:20,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 69 letters. Loop has 33 letters. [2022-02-21 04:30:20,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:30:20,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:30:20,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 102 letters. Loop has 33 letters. [2022-02-21 04:30:20,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:30:20,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:30:20,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 72 letters. Loop has 33 letters. [2022-02-21 04:30:20,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:30:20,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:30:20,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 71 letters. Loop has 33 letters. [2022-02-21 04:30:20,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:30:20,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:30:20,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 70 letters. Loop has 33 letters. [2022-02-21 04:30:20,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 69 letters. Loop has 33 letters. [2022-02-21 04:30:20,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 33 letters. [2022-02-21 04:30:20,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 69 letters. Loop has 33 letters. [2022-02-21 04:30:20,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 69 letters. Loop has 34 letters. [2022-02-21 04:30:20,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 34 letters. [2022-02-21 04:30:20,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 69 letters. Loop has 34 letters. [2022-02-21 04:30:20,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:30:20,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:30:20,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:30:20,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 68 letters. Loop has 33 letters. [2022-02-21 04:30:20,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 33 letters. [2022-02-21 04:30:20,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 68 letters. Loop has 33 letters. [2022-02-21 04:30:20,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:30:20,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:30:20,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 67 letters. Loop has 33 letters. [2022-02-21 04:30:20,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 66 letters. Loop has 33 letters. [2022-02-21 04:30:20,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 33 letters. [2022-02-21 04:30:20,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 66 letters. Loop has 33 letters. [2022-02-21 04:30:20,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 65 letters. Loop has 33 letters. [2022-02-21 04:30:20,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 33 letters. [2022-02-21 04:30:20,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 65 letters. Loop has 33 letters. [2022-02-21 04:30:20,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 65 letters. Loop has 33 letters. [2022-02-21 04:30:20,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 33 letters. [2022-02-21 04:30:20,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 65 letters. Loop has 33 letters. [2022-02-21 04:30:20,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 65 letters. Loop has 34 letters. [2022-02-21 04:30:20,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 34 letters. [2022-02-21 04:30:20,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 65 letters. Loop has 34 letters. [2022-02-21 04:30:20,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:30:20,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:30:20,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:30:20,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 64 letters. Loop has 33 letters. [2022-02-21 04:30:20,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 33 letters. [2022-02-21 04:30:20,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 64 letters. Loop has 33 letters. [2022-02-21 04:30:20,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 64 letters. Loop has 33 letters. [2022-02-21 04:30:20,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 33 letters. [2022-02-21 04:30:20,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 64 letters. Loop has 33 letters. [2022-02-21 04:30:20,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:30:20,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:30:20,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 63 letters. Loop has 33 letters. [2022-02-21 04:30:20,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:30:20,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:30:20,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:30:20,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:30:20,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:30:20,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:30:20,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:30:20,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:30:20,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:30:20,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 61 letters. Loop has 34 letters. [2022-02-21 04:30:20,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 34 letters. [2022-02-21 04:30:20,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 61 letters. Loop has 34 letters. [2022-02-21 04:30:20,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:30:20,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:30:20,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:30:20,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:30:20,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:30:20,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:30:20,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:30:20,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:30:20,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:30:20,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 215 transitions. cyclomatic complexity: 60 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:30:20,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:30:20,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 265 states and 384 transitions. cyclomatic complexity: 120 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:30:20,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,273 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:30:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-02-21 04:30:20,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 136 transitions. Stem has 46 letters. Loop has 33 letters. [2022-02-21 04:30:20,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 136 transitions. Stem has 79 letters. Loop has 33 letters. [2022-02-21 04:30:20,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 136 transitions. Stem has 46 letters. Loop has 66 letters. [2022-02-21 04:30:20,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:30:20,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 384 transitions. cyclomatic complexity: 120 [2022-02-21 04:30:20,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:30:20,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 0 states and 0 transitions. [2022-02-21 04:30:20,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:30:20,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:30:20,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:30:20,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:20,282 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:30:20,282 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:30:20,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:30:20,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:30:20,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:30:20,282 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:30:20,282 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:30:20,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:30:20,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:30:20,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:30:20,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:30:20,336 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:30:20,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:30:20,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:30:20,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:30:20,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:30:20,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:30:20,337 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:30:20,337 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:30:20,337 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:30:20,337 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:30:20,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:30:20,337 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:30:20,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:30:20,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:30:20 BoogieIcfgContainer [2022-02-21 04:30:20,342 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:30:20,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:30:20,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:30:20,343 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:30:20,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:29:58" (3/4) ... [2022-02-21 04:30:20,344 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:30:20,345 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:30:20,345 INFO L158 Benchmark]: Toolchain (without parser) took 22385.45ms. Allocated memory was 90.2MB in the beginning and 234.9MB in the end (delta: 144.7MB). Free memory was 55.8MB in the beginning and 110.5MB in the end (delta: -54.7MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2022-02-21 04:30:20,346 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 90.2MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:30:20,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.47ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.6MB in the beginning and 78.3MB in the end (delta: -22.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-02-21 04:30:20,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.61ms. Allocated memory is still 109.1MB. Free memory was 77.9MB in the beginning and 74.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:30:20,352 INFO L158 Benchmark]: Boogie Preprocessor took 26.80ms. Allocated memory is still 109.1MB. Free memory was 74.6MB in the beginning and 72.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:30:20,352 INFO L158 Benchmark]: RCFGBuilder took 527.11ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 75.5MB in the end (delta: -3.0MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2022-02-21 04:30:20,352 INFO L158 Benchmark]: BuchiAutomizer took 21450.90ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 75.5MB in the beginning and 111.6MB in the end (delta: -36.1MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. [2022-02-21 04:30:20,353 INFO L158 Benchmark]: Witness Printer took 2.33ms. Allocated memory is still 234.9MB. Free memory was 111.6MB in the beginning and 110.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:30:20,354 INFO L339 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.23ms. Allocated memory is still 90.2MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.47ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.6MB in the beginning and 78.3MB in the end (delta: -22.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.61ms. Allocated memory is still 109.1MB. Free memory was 77.9MB in the beginning and 74.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.80ms. Allocated memory is still 109.1MB. Free memory was 74.6MB in the beginning and 72.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.11ms. Allocated memory is still 109.1MB. Free memory was 72.5MB in the beginning and 75.5MB in the end (delta: -3.0MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 21450.90ms. Allocated memory was 109.1MB in the beginning and 234.9MB in the end (delta: 125.8MB). Free memory was 75.5MB in the beginning and 111.6MB in the end (delta: -36.1MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. * Witness Printer took 2.33ms. Allocated memory is still 234.9MB. Free memory was 111.6MB in the beginning and 110.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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 23 + -2 * i2 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 21.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 19.4s. Construction of modules took 0.0s. Büchi inclusion checks took 1.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: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 218 mSDsluCounter, 1782 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1122 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 660 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital216 mio100 ax100 hnf100 lsp70 ukn83 mio100 lsp100 div148 bol100 ite100 ukn100 eq178 hnf92 smp78 dnf4427 smp42 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 315ms VariablesStem: 0 VariablesLoop: 35 DisjunctsStem: 1 DisjunctsLoop: 24 SupportingInvariants: 0 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:30:20,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE