./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.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-var-start-time.5.2.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cea4cc3548129351800c62333a8b3afa818cc0cede5b8fec1c7e8b8079e480c6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:28:35,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:28:35,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:28:35,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:28:35,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:28:35,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:28:35,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:28:35,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:28:35,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:28:35,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:28:35,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:28:35,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:28:35,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:28:35,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:28:35,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:28:35,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:28:35,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:28:35,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:28:35,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:28:35,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:28:35,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:28:35,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:28:35,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:28:35,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:28:35,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:28:35,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:28:35,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:28:35,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:28:35,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:28:35,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:28:35,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:28:35,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:28:35,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:28:35,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:28:35,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:28:35,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:28:35,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:28:35,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:28:35,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:28:35,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:28:35,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:28:35,151 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:28:35,171 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:28:35,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:28:35,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:28:35,174 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:28:35,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:28:35,175 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:28:35,176 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:28:35,176 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:28:35,176 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:28:35,176 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:28:35,177 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:28:35,177 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:28:35,177 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:28:35,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:28:35,178 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:28:35,178 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:28:35,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:28:35,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:28:35,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:28:35,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:28:35,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:28:35,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:28:35,180 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:28:35,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:28:35,180 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:28:35,180 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:28:35,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:28:35,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:28:35,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:28:35,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:28:35,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:28:35,182 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:28:35,182 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 -> cea4cc3548129351800c62333a8b3afa818cc0cede5b8fec1c7e8b8079e480c6 [2022-02-21 04:28:35,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:28:35,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:28:35,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:28:35,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:28:35,446 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:28:35,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2022-02-21 04:28:35,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4033a4f5/248b47dc111e4c62a2c3e8baeadaf9af/FLAG3c0c3e47d [2022-02-21 04:28:35,902 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:28:35,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2022-02-21 04:28:35,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4033a4f5/248b47dc111e4c62a2c3e8baeadaf9af/FLAG3c0c3e47d [2022-02-21 04:28:36,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4033a4f5/248b47dc111e4c62a2c3e8baeadaf9af [2022-02-21 04:28:36,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:28:36,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:28:36,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:36,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:28:36,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:28:36,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:36" (1/1) ... [2022-02-21 04:28:36,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531b1e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:36, skipping insertion in model container [2022-02-21 04:28:36,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:36" (1/1) ... [2022-02-21 04:28:36,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:28:36,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:28:36,554 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c[12639,12652] [2022-02-21 04:28:36,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:36,563 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:28:36,636 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-var-start-time.5.2.ufo.BOUNDED-10.pals.c[12639,12652] [2022-02-21 04:28:36,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:36,663 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:28:36,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:36 WrapperNode [2022-02-21 04:28:36,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:36,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:36,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:28:36,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:28:36,673 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:28:36" (1/1) ... [2022-02-21 04:28:36,699 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:28:36" (1/1) ... [2022-02-21 04:28:36,742 INFO L137 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 366 [2022-02-21 04:28:36,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:36,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:28:36,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:28:36,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:28:36,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:36" (1/1) ... [2022-02-21 04:28:36,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:36" (1/1) ... [2022-02-21 04:28:36,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:36" (1/1) ... [2022-02-21 04:28:36,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:36" (1/1) ... [2022-02-21 04:28:36,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:36" (1/1) ... [2022-02-21 04:28:36,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:36" (1/1) ... [2022-02-21 04:28:36,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:36" (1/1) ... [2022-02-21 04:28:36,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:28:36,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:28:36,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:28:36,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:28:36,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:36" (1/1) ... [2022-02-21 04:28:36,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:36,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:36,871 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:28:36,897 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:28:36,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:28:36,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:28:36,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:28:36,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:28:37,007 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:28:37,016 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:28:37,516 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:28:37,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:28:37,527 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:28:37,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:37 BoogieIcfgContainer [2022-02-21 04:28:37,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:28:37,532 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:28:37,532 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:28:37,535 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:28:37,535 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:37,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:28:36" (1/3) ... [2022-02-21 04:28:37,536 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@795689b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:37, skipping insertion in model container [2022-02-21 04:28:37,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:37,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:36" (2/3) ... [2022-02-21 04:28:37,537 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@795689b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:37, skipping insertion in model container [2022-02-21 04:28:37,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:37,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:37" (3/3) ... [2022-02-21 04:28:37,539 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2022-02-21 04:28:37,588 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:28:37,588 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:28:37,588 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:28:37,589 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:28:37,589 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:28:37,589 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:28:37,589 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:28:37,590 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:28:37,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 118 states, 117 states have (on average 1.7008547008547008) internal successors, (199), 117 states have internal predecessors, (199), 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:28:37,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2022-02-21 04:28:37,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:37,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:37,669 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:37,669 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] [2022-02-21 04:28:37,669 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:28:37,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 118 states, 117 states have (on average 1.7008547008547008) internal successors, (199), 117 states have internal predecessors, (199), 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:28:37,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2022-02-21 04:28:37,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:37,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:37,698 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:37,699 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] [2022-02-21 04:28:37,706 INFO L791 eck$LassoCheckResult]: Stem: 100#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(50, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; 28#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1;havoc main_#t~nondet13#1;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 63#L243true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 105#L243-1true init_#res#1 := init_~tmp~0#1; 25#L372true main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#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; 30#L22true assume !(0 == assume_abort_if_not_~cond#1); 84#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;main_~i2~0#1 := 0; 79#L441-2true [2022-02-21 04:28:37,712 INFO L793 eck$LassoCheckResult]: Loop: 79#L441-2true assume !!(main_~i2~0#1 < 10);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; 51#L76true 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 11#L80true assume !(node1_~m1~0#1 != ~nomsg~0); 95#L80-1true ~mode1~0 := 0; 101#L76-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 18#L108true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 16#L111true assume !(node2_~m2~0#1 != ~nomsg~0); 92#L111-1true ~mode2~0 := 0; 78#L108-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 87#L142true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 44#L145true assume !(node3_~m3~0#1 != ~nomsg~0); 52#L145-1true ~mode3~0 := 0; 81#L142-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 32#L176true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 107#L179true assume !(node4_~m4~0#1 != ~nomsg~0); 62#L179-1true ~mode4~0 := 0; 113#L176-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 9#L210true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 110#L213true assume !(node5_~m5~0#1 != ~nomsg~0); 98#L213-1true ~mode5~0 := 0; 102#L210-2true assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 58#L380true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 7#L380-1true check_#res#1 := check_~tmp~1#1; 33#L392true main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 20#L471true assume !(0 == assert_~arg#1 % 256); 114#L466true assume { :end_inline_assert } true;main_#t~post41#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post41#1;havoc main_#t~post41#1; 79#L441-2true [2022-02-21 04:28:37,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:37,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1984313218, now seen corresponding path program 1 times [2022-02-21 04:28:37,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:37,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529654085] [2022-02-21 04:28:37,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:37,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {122#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(50, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {122#true} is VALID [2022-02-21 04:28:37,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {122#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1;havoc main_#t~nondet13#1;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {122#true} is VALID [2022-02-21 04:28:37,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {122#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {124#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:28:37,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {124#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {125#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:28:37,955 INFO L290 TraceCheckUtils]: 4: Hoare triple {125#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#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; {126#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:28:37,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {126#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {123#false} is VALID [2022-02-21 04:28:37,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#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;main_~i2~0#1 := 0; {123#false} is VALID [2022-02-21 04:28:37,957 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:28:37,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:37,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529654085] [2022-02-21 04:28:37,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529654085] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:37,959 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:37,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:37,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222089773] [2022-02-21 04:28:37,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:37,964 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:37,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash 240307598, now seen corresponding path program 1 times [2022-02-21 04:28:37,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:37,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116600849] [2022-02-21 04:28:37,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:38,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {127#true} assume !!(main_~i2~0#1 < 10);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; {127#true} is VALID [2022-02-21 04:28:38,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {127#true} is VALID [2022-02-21 04:28:38,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume !(node1_~m1~0#1 != ~nomsg~0); {127#true} is VALID [2022-02-21 04:28:38,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {127#true} ~mode1~0 := 0; {127#true} is VALID [2022-02-21 04:28:38,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {127#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {127#true} is VALID [2022-02-21 04:28:38,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {127#true} is VALID [2022-02-21 04:28:38,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !(node2_~m2~0#1 != ~nomsg~0); {127#true} is VALID [2022-02-21 04:28:38,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {127#true} ~mode2~0 := 0; {127#true} is VALID [2022-02-21 04:28:38,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {127#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {127#true} is VALID [2022-02-21 04:28:38,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {127#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {127#true} is VALID [2022-02-21 04:28:38,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {127#true} assume !(node3_~m3~0#1 != ~nomsg~0); {127#true} is VALID [2022-02-21 04:28:38,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {127#true} ~mode3~0 := 0; {127#true} is VALID [2022-02-21 04:28:38,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {127#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {127#true} is VALID [2022-02-21 04:28:38,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {127#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {127#true} is VALID [2022-02-21 04:28:38,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {127#true} assume !(node4_~m4~0#1 != ~nomsg~0); {127#true} is VALID [2022-02-21 04:28:38,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {127#true} ~mode4~0 := 0; {127#true} is VALID [2022-02-21 04:28:38,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {127#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {127#true} is VALID [2022-02-21 04:28:38,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {127#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {127#true} is VALID [2022-02-21 04:28:38,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {127#true} assume !(node5_~m5~0#1 != ~nomsg~0); {127#true} is VALID [2022-02-21 04:28:38,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {127#true} ~mode5~0 := 0; {127#true} is VALID [2022-02-21 04:28:38,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {127#true} assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {127#true} is VALID [2022-02-21 04:28:38,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {127#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {129#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:38,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {129#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {130#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:38,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {130#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {131#(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:28:38,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {131#(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); {128#false} is VALID [2022-02-21 04:28:38,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {128#false} assume { :end_inline_assert } true;main_#t~post41#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post41#1;havoc main_#t~post41#1; {128#false} is VALID [2022-02-21 04:28:38,174 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:28:38,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:38,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116600849] [2022-02-21 04:28:38,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116600849] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:38,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:38,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:38,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061704708] [2022-02-21 04:28:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:38,177 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:38,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:38,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:38,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:38,213 INFO L87 Difference]: Start difference. First operand has 118 states, 117 states have (on average 1.7008547008547008) internal successors, (199), 117 states have internal predecessors, (199), 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:28:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:38,660 INFO L93 Difference]: Finished difference Result 121 states and 198 transitions. [2022-02-21 04:28:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:38,662 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:28:38,670 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:28:38,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 198 transitions. [2022-02-21 04:28:38,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-02-21 04:28:38,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 113 states and 159 transitions. [2022-02-21 04:28:38,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2022-02-21 04:28:38,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-02-21 04:28:38,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 159 transitions. [2022-02-21 04:28:38,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:38,704 INFO L681 BuchiCegarLoop]: Abstraction has 113 states and 159 transitions. [2022-02-21 04:28:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 159 transitions. [2022-02-21 04:28:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-02-21 04:28:38,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:38,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states and 159 transitions. Second operand has 113 states, 113 states have (on average 1.407079646017699) internal successors, (159), 112 states have internal predecessors, (159), 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:28:38,737 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states and 159 transitions. Second operand has 113 states, 113 states have (on average 1.407079646017699) internal successors, (159), 112 states have internal predecessors, (159), 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:28:38,738 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 113 states, 113 states have (on average 1.407079646017699) internal successors, (159), 112 states have internal predecessors, (159), 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:28:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:38,760 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2022-02-21 04:28:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2022-02-21 04:28:38,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:38,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:38,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 113 states have (on average 1.407079646017699) internal successors, (159), 112 states have internal predecessors, (159), 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 113 states and 159 transitions. [2022-02-21 04:28:38,763 INFO L87 Difference]: Start difference. First operand has 113 states, 113 states have (on average 1.407079646017699) internal successors, (159), 112 states have internal predecessors, (159), 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 113 states and 159 transitions. [2022-02-21 04:28:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:38,769 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2022-02-21 04:28:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2022-02-21 04:28:38,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:38,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:38,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:38,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.407079646017699) internal successors, (159), 112 states have internal predecessors, (159), 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:28:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2022-02-21 04:28:38,779 INFO L704 BuchiCegarLoop]: Abstraction has 113 states and 159 transitions. [2022-02-21 04:28:38,779 INFO L587 BuchiCegarLoop]: Abstraction has 113 states and 159 transitions. [2022-02-21 04:28:38,779 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:28:38,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 159 transitions. [2022-02-21 04:28:38,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-02-21 04:28:38,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:38,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:38,787 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] [2022-02-21 04:28:38,787 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] [2022-02-21 04:28:38,789 INFO L791 eck$LassoCheckResult]: Stem: 367#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(50, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; 302#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1;havoc main_#t~nondet13#1;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 303#L243 assume 0 == ~r1~0; 266#L244 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 267#L245 assume ~id1~0 >= 0; 291#L246 assume 0 == ~st1~0; 330#L247 assume ~send1~0 == ~id1~0; 365#L248 assume 0 == ~mode1~0 % 256; 262#L249 assume ~id2~0 >= 0; 263#L250 assume 0 == ~st2~0; 350#L251 assume ~send2~0 == ~id2~0; 312#L252 assume 0 == ~mode2~0 % 256; 313#L253 assume ~id3~0 >= 0; 316#L254 assume 0 == ~st3~0; 280#L255 assume ~send3~0 == ~id3~0; 281#L256 assume 0 == ~mode3~0 % 256; 314#L257 assume ~id4~0 >= 0; 293#L258 assume 0 == ~st4~0; 294#L259 assume ~send4~0 == ~id4~0; 333#L260 assume 0 == ~mode4~0 % 256; 334#L261 assume ~id5~0 >= 0; 322#L262 assume 0 == ~st5~0; 323#L263 assume ~send5~0 == ~id5~0; 328#L264 assume 0 == ~mode5~0 % 256; 329#L265 assume ~id1~0 != ~id2~0; 276#L266 assume ~id1~0 != ~id3~0; 277#L267 assume ~id1~0 != ~id4~0; 285#L268 assume ~id1~0 != ~id5~0; 286#L269 assume ~id2~0 != ~id3~0; 268#L270 assume ~id2~0 != ~id4~0; 269#L271 assume ~id2~0 != ~id5~0; 295#L272 assume ~id3~0 != ~id4~0; 307#L273 assume ~id3~0 != ~id5~0; 327#L274 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 354#L243-1 init_#res#1 := init_~tmp~0#1; 296#L372 main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#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; 297#L22 assume !(0 == assume_abort_if_not_~cond#1); 306#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;main_~i2~0#1 := 0; 360#L441-2 [2022-02-21 04:28:38,790 INFO L793 eck$LassoCheckResult]: Loop: 360#L441-2 assume !!(main_~i2~0#1 < 10);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; 335#L76 assume !(0 != ~mode1~0 % 256); 336#L94 assume !(0 != ~alive1~0 % 256); 363#L94-2 ~mode1~0 := 1; 364#L76-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 287#L108 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 282#L111 assume !(node2_~m2~0#1 != ~nomsg~0); 284#L111-1 ~mode2~0 := 0; 358#L108-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 359#L142 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 324#L145 assume !(node3_~m3~0#1 != ~nomsg~0); 326#L145-1 ~mode3~0 := 0; 321#L142-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 308#L176 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 310#L179 assume !(node4_~m4~0#1 != ~nomsg~0); 259#L179-1 ~mode4~0 := 0; 347#L176-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 270#L210 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 271#L213 assume !(node5_~m5~0#1 != ~nomsg~0); 305#L213-1 ~mode5~0 := 0; 366#L210-2 assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 341#L380 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 264#L380-1 check_#res#1 := check_~tmp~1#1; 265#L392 main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 289#L471 assume !(0 == assert_~arg#1 % 256); 290#L466 assume { :end_inline_assert } true;main_#t~post41#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post41#1;havoc main_#t~post41#1; 360#L441-2 [2022-02-21 04:28:38,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 1 times [2022-02-21 04:28:38,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:38,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121670234] [2022-02-21 04:28:38,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:38,836 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:38,897 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash -563273304, now seen corresponding path program 1 times [2022-02-21 04:28:38,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:38,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041716195] [2022-02-21 04:28:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:38,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:38,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#true} assume !!(main_~i2~0#1 < 10);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; {601#true} is VALID [2022-02-21 04:28:38,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} assume !(0 != ~mode1~0 % 256); {601#true} is VALID [2022-02-21 04:28:38,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} assume !(0 != ~alive1~0 % 256); {601#true} is VALID [2022-02-21 04:28:38,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {601#true} ~mode1~0 := 1; {601#true} is VALID [2022-02-21 04:28:38,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {601#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {601#true} is VALID [2022-02-21 04:28:38,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {601#true} is VALID [2022-02-21 04:28:38,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {601#true} assume !(node2_~m2~0#1 != ~nomsg~0); {601#true} is VALID [2022-02-21 04:28:38,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#true} ~mode2~0 := 0; {601#true} is VALID [2022-02-21 04:28:38,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {601#true} is VALID [2022-02-21 04:28:38,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {601#true} is VALID [2022-02-21 04:28:38,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {601#true} assume !(node3_~m3~0#1 != ~nomsg~0); {601#true} is VALID [2022-02-21 04:28:38,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#true} ~mode3~0 := 0; {601#true} is VALID [2022-02-21 04:28:38,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {601#true} is VALID [2022-02-21 04:28:38,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {601#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {601#true} is VALID [2022-02-21 04:28:38,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {601#true} assume !(node4_~m4~0#1 != ~nomsg~0); {601#true} is VALID [2022-02-21 04:28:38,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {601#true} ~mode4~0 := 0; {601#true} is VALID [2022-02-21 04:28:38,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {601#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {601#true} is VALID [2022-02-21 04:28:38,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {601#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {601#true} is VALID [2022-02-21 04:28:38,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {601#true} assume !(node5_~m5~0#1 != ~nomsg~0); {601#true} is VALID [2022-02-21 04:28:38,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {601#true} ~mode5~0 := 0; {601#true} is VALID [2022-02-21 04:28:38,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {601#true} assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {601#true} is VALID [2022-02-21 04:28:38,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {601#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {603#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:38,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {603#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {604#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:38,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {604#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {605#(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:28:38,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {605#(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); {602#false} is VALID [2022-02-21 04:28:38,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {602#false} assume { :end_inline_assert } true;main_#t~post41#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post41#1;havoc main_#t~post41#1; {602#false} is VALID [2022-02-21 04:28:38,988 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:28:38,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:38,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041716195] [2022-02-21 04:28:38,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041716195] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:38,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:38,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:38,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512468387] [2022-02-21 04:28:38,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:38,990 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:38,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:38,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:38,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:38,992 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. cyclomatic complexity: 47 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:28:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:39,330 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2022-02-21 04:28:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:39,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:28:39,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:39,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 161 transitions. [2022-02-21 04:28:39,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-02-21 04:28:39,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 113 states and 157 transitions. [2022-02-21 04:28:39,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2022-02-21 04:28:39,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-02-21 04:28:39,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 157 transitions. [2022-02-21 04:28:39,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:39,362 INFO L681 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2022-02-21 04:28:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 157 transitions. [2022-02-21 04:28:39,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-02-21 04:28:39,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:39,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states and 157 transitions. Second operand has 113 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 112 states have internal predecessors, (157), 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:28:39,367 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states and 157 transitions. Second operand has 113 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 112 states have internal predecessors, (157), 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:28:39,367 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 113 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 112 states have internal predecessors, (157), 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:28:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:39,370 INFO L93 Difference]: Finished difference Result 113 states and 157 transitions. [2022-02-21 04:28:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2022-02-21 04:28:39,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:39,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:39,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 112 states have internal predecessors, (157), 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 113 states and 157 transitions. [2022-02-21 04:28:39,372 INFO L87 Difference]: Start difference. First operand has 113 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 112 states have internal predecessors, (157), 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 113 states and 157 transitions. [2022-02-21 04:28:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:39,375 INFO L93 Difference]: Finished difference Result 113 states and 157 transitions. [2022-02-21 04:28:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2022-02-21 04:28:39,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:39,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:39,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:39,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 112 states have internal predecessors, (157), 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:28:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2022-02-21 04:28:39,380 INFO L704 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2022-02-21 04:28:39,380 INFO L587 BuchiCegarLoop]: Abstraction has 113 states and 157 transitions. [2022-02-21 04:28:39,380 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:28:39,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 157 transitions. [2022-02-21 04:28:39,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-02-21 04:28:39,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:39,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:39,382 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] [2022-02-21 04:28:39,382 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] [2022-02-21 04:28:39,383 INFO L791 eck$LassoCheckResult]: Stem: 836#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(50, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; 771#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1;havoc main_#t~nondet13#1;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 772#L243 assume 0 == ~r1~0; 735#L244 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 736#L245 assume ~id1~0 >= 0; 760#L246 assume 0 == ~st1~0; 799#L247 assume ~send1~0 == ~id1~0; 834#L248 assume 0 == ~mode1~0 % 256; 731#L249 assume ~id2~0 >= 0; 732#L250 assume 0 == ~st2~0; 819#L251 assume ~send2~0 == ~id2~0; 781#L252 assume 0 == ~mode2~0 % 256; 782#L253 assume ~id3~0 >= 0; 785#L254 assume 0 == ~st3~0; 749#L255 assume ~send3~0 == ~id3~0; 750#L256 assume 0 == ~mode3~0 % 256; 783#L257 assume ~id4~0 >= 0; 762#L258 assume 0 == ~st4~0; 763#L259 assume ~send4~0 == ~id4~0; 802#L260 assume 0 == ~mode4~0 % 256; 803#L261 assume ~id5~0 >= 0; 791#L262 assume 0 == ~st5~0; 792#L263 assume ~send5~0 == ~id5~0; 797#L264 assume 0 == ~mode5~0 % 256; 798#L265 assume ~id1~0 != ~id2~0; 745#L266 assume ~id1~0 != ~id3~0; 746#L267 assume ~id1~0 != ~id4~0; 754#L268 assume ~id1~0 != ~id5~0; 755#L269 assume ~id2~0 != ~id3~0; 737#L270 assume ~id2~0 != ~id4~0; 738#L271 assume ~id2~0 != ~id5~0; 764#L272 assume ~id3~0 != ~id4~0; 776#L273 assume ~id3~0 != ~id5~0; 796#L274 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 823#L243-1 init_#res#1 := init_~tmp~0#1; 765#L372 main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#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; 766#L22 assume !(0 == assume_abort_if_not_~cond#1); 775#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;main_~i2~0#1 := 0; 829#L441-2 [2022-02-21 04:28:39,383 INFO L793 eck$LassoCheckResult]: Loop: 829#L441-2 assume !!(main_~i2~0#1 < 10);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; 804#L76 assume !(0 != ~mode1~0 % 256); 805#L94 assume !(0 != ~alive1~0 % 256); 832#L94-2 ~mode1~0 := 1; 833#L76-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 756#L108 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 751#L111 assume !(node2_~m2~0#1 != ~nomsg~0); 753#L111-1 ~mode2~0 := 0; 827#L108-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 828#L142 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 793#L145 assume !(node3_~m3~0#1 != ~nomsg~0); 795#L145-1 ~mode3~0 := 0; 790#L142-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 777#L176 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 779#L179 assume !(node4_~m4~0#1 != ~nomsg~0); 728#L179-1 ~mode4~0 := 0; 816#L176-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 739#L210 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 740#L213 assume !(node5_~m5~0#1 != ~nomsg~0); 774#L213-1 ~mode5~0 := 0; 835#L210-2 assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 810#L380 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 806#L381 assume ~r1~0 < 5;check_~tmp~1#1 := 1; 733#L380-1 check_#res#1 := check_~tmp~1#1; 734#L392 main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 758#L471 assume !(0 == assert_~arg#1 % 256); 759#L466 assume { :end_inline_assert } true;main_#t~post41#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post41#1;havoc main_#t~post41#1; 829#L441-2 [2022-02-21 04:28:39,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:39,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 2 times [2022-02-21 04:28:39,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:39,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163950185] [2022-02-21 04:28:39,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:39,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:39,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:39,474 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:39,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:39,476 INFO L85 PathProgramCache]: Analyzing trace with hash -664930306, now seen corresponding path program 1 times [2022-02-21 04:28:39,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:39,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303531774] [2022-02-21 04:28:39,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:39,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:39,503 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:39,527 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:39,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:39,533 INFO L85 PathProgramCache]: Analyzing trace with hash 696981672, now seen corresponding path program 1 times [2022-02-21 04:28:39,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:39,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949486068] [2022-02-21 04:28:39,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:39,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:39,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {1072#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(50, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {1072#true} is VALID [2022-02-21 04:28:39,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1;havoc main_#t~nondet13#1;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1072#true} is VALID [2022-02-21 04:28:39,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume 0 == ~r1~0; {1072#true} is VALID [2022-02-21 04:28:39,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {1072#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1072#true} is VALID [2022-02-21 04:28:39,602 INFO L290 TraceCheckUtils]: 4: Hoare triple {1072#true} assume ~id1~0 >= 0; {1072#true} is VALID [2022-02-21 04:28:39,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#true} assume 0 == ~st1~0; {1072#true} is VALID [2022-02-21 04:28:39,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {1072#true} assume ~send1~0 == ~id1~0; {1072#true} is VALID [2022-02-21 04:28:39,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} assume 0 == ~mode1~0 % 256; {1072#true} is VALID [2022-02-21 04:28:39,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume ~id2~0 >= 0; {1072#true} is VALID [2022-02-21 04:28:39,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume 0 == ~st2~0; {1072#true} is VALID [2022-02-21 04:28:39,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {1072#true} assume ~send2~0 == ~id2~0; {1072#true} is VALID [2022-02-21 04:28:39,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} assume 0 == ~mode2~0 % 256; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#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; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {1074#(= (+ (* (- 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;main_~i2~0#1 := 0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 10);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; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,619 INFO L290 TraceCheckUtils]: 40: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~alive1~0 % 256); {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1074#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-21 04:28:39,621 INFO L290 TraceCheckUtils]: 43: Hoare triple {1074#(= (+ (* (- 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; {1073#false} is VALID [2022-02-21 04:28:39,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {1073#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1073#false} is VALID [2022-02-21 04:28:39,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {1073#false} ~mode2~0 := 0; {1073#false} is VALID [2022-02-21 04:28:39,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {1073#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1073#false} is VALID [2022-02-21 04:28:39,621 INFO L290 TraceCheckUtils]: 47: Hoare triple {1073#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1073#false} is VALID [2022-02-21 04:28:39,622 INFO L290 TraceCheckUtils]: 48: Hoare triple {1073#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1073#false} is VALID [2022-02-21 04:28:39,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {1073#false} ~mode3~0 := 0; {1073#false} is VALID [2022-02-21 04:28:39,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {1073#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1073#false} is VALID [2022-02-21 04:28:39,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {1073#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1073#false} is VALID [2022-02-21 04:28:39,622 INFO L290 TraceCheckUtils]: 52: Hoare triple {1073#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1073#false} is VALID [2022-02-21 04:28:39,623 INFO L290 TraceCheckUtils]: 53: Hoare triple {1073#false} ~mode4~0 := 0; {1073#false} is VALID [2022-02-21 04:28:39,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {1073#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1073#false} is VALID [2022-02-21 04:28:39,623 INFO L290 TraceCheckUtils]: 55: Hoare triple {1073#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1073#false} is VALID [2022-02-21 04:28:39,623 INFO L290 TraceCheckUtils]: 56: Hoare triple {1073#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1073#false} is VALID [2022-02-21 04:28:39,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {1073#false} ~mode5~0 := 0; {1073#false} is VALID [2022-02-21 04:28:39,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {1073#false} assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1073#false} is VALID [2022-02-21 04:28:39,624 INFO L290 TraceCheckUtils]: 59: Hoare triple {1073#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1073#false} is VALID [2022-02-21 04:28:39,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {1073#false} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {1073#false} is VALID [2022-02-21 04:28:39,624 INFO L290 TraceCheckUtils]: 61: Hoare triple {1073#false} check_#res#1 := check_~tmp~1#1; {1073#false} is VALID [2022-02-21 04:28:39,625 INFO L290 TraceCheckUtils]: 62: Hoare triple {1073#false} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {1073#false} is VALID [2022-02-21 04:28:39,625 INFO L290 TraceCheckUtils]: 63: Hoare triple {1073#false} assume !(0 == assert_~arg#1 % 256); {1073#false} is VALID [2022-02-21 04:28:39,625 INFO L290 TraceCheckUtils]: 64: Hoare triple {1073#false} assume { :end_inline_assert } true;main_#t~post41#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post41#1;havoc main_#t~post41#1; {1073#false} is VALID [2022-02-21 04:28:39,626 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:28:39,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:39,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949486068] [2022-02-21 04:28:39,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949486068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:39,626 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:39,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:28:39,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634186664] [2022-02-21 04:28:39,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:40,364 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:40,364 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:40,365 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:40,365 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:40,365 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:28:40,365 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:40,365 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:40,365 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:40,365 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-02-21 04:28:40,366 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:40,366 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:40,382 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:28:40,390 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:28:40,392 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:28:40,395 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:28:40,397 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:28:40,401 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:28:40,405 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:28:40,408 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:28:40,410 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:28:40,412 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:28:40,415 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:28:40,417 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:28:40,421 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:28:40,423 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:28:40,425 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:28:40,427 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:28:40,431 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:28:40,460 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:28:40,462 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:28:40,467 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:28:40,472 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:28:40,476 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:28:40,479 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:28:41,160 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:41,161 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:28:41,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:41,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:41,164 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:28:41,177 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:28:41,177 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:41,187 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:28:41,212 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:28:41,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:41,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:41,214 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:28:41,218 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:28:41,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:28:41,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:41,386 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:28:41,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 04:28:41,394 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:41,394 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:41,394 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:41,394 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:41,395 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:28:41,395 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:41,395 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:41,395 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:41,395 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-02-21 04:28:41,395 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:41,395 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:41,397 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:28:41,411 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:28:41,414 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:28:41,416 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:28:41,421 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:28:41,425 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:28:41,428 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:28:41,430 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:28:41,433 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:28:41,436 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:28:41,438 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:28:41,443 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:28:41,445 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:28:41,448 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:28:41,450 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:28:41,455 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:28:41,457 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:28:41,489 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:28:41,494 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:28:41,499 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:28:41,502 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:28:41,504 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:28:41,506 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:28:42,178 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:42,182 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:28:42,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,185 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:28:42,186 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:28:42,188 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:28:42,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,198 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,241 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:28:42,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,242 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:28:42,243 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:28:42,245 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:28:42,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,268 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:28:42,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,269 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:28:42,270 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:28:42,271 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:28:42,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,325 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:28:42,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,327 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:28:42,341 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:28:42,342 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:28:42,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,391 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:28:42,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,393 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:28:42,397 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:28:42,398 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:28:42,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:42,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,442 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:28:42,443 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:28:42,445 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:28:42,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,469 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:28:42,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,471 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:28:42,472 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:28:42,473 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:28:42,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,504 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:28:42,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,505 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:28:42,508 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:28:42,509 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:28:42,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,532 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:28:42,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,534 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:28:42,534 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:28:42,536 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:28:42,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,562 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:28:42,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,564 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:28:42,564 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:28:42,569 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:28:42,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,619 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:28:42,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,620 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:28:42,623 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:28:42,624 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:28:42,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 04:28:42,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,681 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:28:42,686 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:28:42,687 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:28:42,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,710 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:28:42,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,712 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:28:42,713 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:28:42,714 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:28:42,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,742 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:28:42,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,744 INFO L229 MonitoredProcess]: Starting monitored process 17 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:28:42,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:28:42,748 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:28:42,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:42,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:42,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,777 INFO L229 MonitoredProcess]: Starting monitored process 18 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:28:42,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:28:42,779 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:28:42,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:42,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:42,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:42,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:42,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:42,787 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:42,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:42,789 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:28:42,812 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:28:42,812 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:28:42,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:42,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:42,814 INFO L229 MonitoredProcess]: Starting monitored process 19 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:28:42,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:28:42,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:28:42,817 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:28:42,817 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:28:42,817 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 19 Supporting invariants [] [2022-02-21 04:28:42,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:42,866 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:28:42,872 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 10);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 !(0 != ~alive1~0 % 256);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#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~ite7#1, node3_#t~ite8#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~ite9#1, node4_#t~ite10#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~ite11#1, node5_#t~ite12#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;~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;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 <= 1;" "assume ~r1~0 < 5;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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~post41#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post41#1;havoc main_#t~post41#1;" [2022-02-21 04:28:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:42,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:42,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:42,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:28:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:43,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:43,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {1075#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(50, 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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0; {1075#unseeded} is VALID [2022-02-21 04:28:43,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {1075#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1, main_#t~post41#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~nondet13#1;havoc main_#t~nondet13#1;~id1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~alive1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~id2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~send2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~alive2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~alive3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~id4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~send4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~alive4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~id5~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~st5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~send5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~mode5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~alive5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1075#unseeded} is VALID [2022-02-21 04:28:43,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {1075#unseeded} assume 0 == ~r1~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {1075#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1075#unseeded} is VALID [2022-02-21 04:28:43,123 INFO L290 TraceCheckUtils]: 4: Hoare triple {1075#unseeded} assume ~id1~0 >= 0; {1075#unseeded} is VALID [2022-02-21 04:28:43,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {1075#unseeded} assume 0 == ~st1~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#unseeded} assume ~send1~0 == ~id1~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {1075#unseeded} assume 0 == ~mode1~0 % 256; {1075#unseeded} is VALID [2022-02-21 04:28:43,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {1075#unseeded} assume ~id2~0 >= 0; {1075#unseeded} is VALID [2022-02-21 04:28:43,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {1075#unseeded} assume 0 == ~st2~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {1075#unseeded} assume ~send2~0 == ~id2~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {1075#unseeded} assume 0 == ~mode2~0 % 256; {1075#unseeded} is VALID [2022-02-21 04:28:43,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {1075#unseeded} assume ~id3~0 >= 0; {1075#unseeded} is VALID [2022-02-21 04:28:43,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {1075#unseeded} assume 0 == ~st3~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {1075#unseeded} assume ~send3~0 == ~id3~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#unseeded} assume 0 == ~mode3~0 % 256; {1075#unseeded} is VALID [2022-02-21 04:28:43,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {1075#unseeded} assume ~id4~0 >= 0; {1075#unseeded} is VALID [2022-02-21 04:28:43,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {1075#unseeded} assume 0 == ~st4~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {1075#unseeded} assume ~send4~0 == ~id4~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {1075#unseeded} assume 0 == ~mode4~0 % 256; {1075#unseeded} is VALID [2022-02-21 04:28:43,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {1075#unseeded} assume ~id5~0 >= 0; {1075#unseeded} is VALID [2022-02-21 04:28:43,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {1075#unseeded} assume 0 == ~st5~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {1075#unseeded} assume ~send5~0 == ~id5~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {1075#unseeded} assume 0 == ~mode5~0 % 256; {1075#unseeded} is VALID [2022-02-21 04:28:43,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {1075#unseeded} assume ~id1~0 != ~id2~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {1075#unseeded} assume ~id1~0 != ~id3~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {1075#unseeded} assume ~id1~0 != ~id4~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {1075#unseeded} assume ~id1~0 != ~id5~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {1075#unseeded} assume ~id2~0 != ~id3~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {1075#unseeded} assume ~id2~0 != ~id4~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {1075#unseeded} assume ~id2~0 != ~id5~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {1075#unseeded} assume ~id3~0 != ~id4~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {1075#unseeded} assume ~id3~0 != ~id5~0; {1075#unseeded} is VALID [2022-02-21 04:28:43,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {1075#unseeded} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1075#unseeded} is VALID [2022-02-21 04:28:43,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {1075#unseeded} init_#res#1 := init_~tmp~0#1; {1075#unseeded} is VALID [2022-02-21 04:28:43,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {1075#unseeded} main_#t~ret39#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret39#1;havoc main_#t~ret39#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; {1075#unseeded} is VALID [2022-02-21 04:28:43,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {1075#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {1075#unseeded} is VALID [2022-02-21 04:28:43,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {1075#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;main_~i2~0#1 := 0; {1075#unseeded} is VALID [2022-02-21 04:28:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:43,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:28:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:43,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:43,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {1078#(>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 10);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; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~mode1~0 % 256); {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~alive1~0 % 256); {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode1~0 := 1; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node2_~m2~0#1 != ~nomsg~0); {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode2~0 := 0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node3_~m3~0#1 != ~nomsg~0); {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode3~0 := 0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node4_~m4~0#1 != ~nomsg~0); {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode4~0 := 0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite11#1, node5_#t~ite12#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node5_~m5~0#1 != ~nomsg~0); {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode5~0 := 0; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} check_#res#1 := check_~tmp~1#1; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} main_#t~ret40#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 == assert_~arg#1 % 256); {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:43,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {1204#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_assert } true;main_#t~post41#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post41#1;havoc main_#t~post41#1; {1088#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:28:43,451 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:28:43,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:28:43,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:43,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 38 letters. Loop has 27 letters. [2022-02-21 04:28:43,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,477 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:28:43,478 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 157 transitions. cyclomatic complexity: 45 Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:28:43,701 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 157 transitions. cyclomatic complexity: 45. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 188 states and 277 transitions. Complement of second has 4 states. [2022-02-21 04:28:43,701 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:28:43,701 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:43,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 157 transitions. cyclomatic complexity: 45 [2022-02-21 04:28:43,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:43,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:43,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:28:43,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:43,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:43,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:43,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 277 transitions. [2022-02-21 04:28:43,711 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:43,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:43,714 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 113 states and 157 transitions. cyclomatic complexity: 45 [2022-02-21 04:28:43,773 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 75 examples of accepted words. [2022-02-21 04:28:43,774 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:28:43,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:43,777 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:28:43,777 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 188 states and 277 transitions. cyclomatic complexity: 90 [2022-02-21 04:28:43,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 277 transitions. cyclomatic complexity: 90 [2022-02-21 04:28:43,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:43,778 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:28:43,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:43,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 38 letters. Loop has 27 letters. [2022-02-21 04:28:43,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:43,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:43,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:28:43,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:43,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 188 letters. Loop has 188 letters. [2022-02-21 04:28:43,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 188 letters. Loop has 188 letters. [2022-02-21 04:28:43,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 188 letters. Loop has 188 letters. [2022-02-21 04:28:43,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 113 letters. Loop has 113 letters. [2022-02-21 04:28:43,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 113 letters. Loop has 113 letters. [2022-02-21 04:28:43,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 113 letters. Loop has 113 letters. [2022-02-21 04:28:43,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:43,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:28:43,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:43,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 50 letters. Loop has 28 letters. [2022-02-21 04:28:43,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 50 letters. Loop has 28 letters. [2022-02-21 04:28:43,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:28:43,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:28:43,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:43,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 43 letters. Loop has 30 letters. [2022-02-21 04:28:43,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:43,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:43,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:43,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:28:43,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:28:43,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:28:43,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:28:43,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 52 letters. Loop has 28 letters. [2022-02-21 04:28:43,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 52 letters. Loop has 28 letters. [2022-02-21 04:28:43,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:28:43,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:28:43,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:43,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:43,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:43,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 29 letters. [2022-02-21 04:28:43,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:43,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:43,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 45 letters. Loop has 28 letters. [2022-02-21 04:28:43,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:43,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:28:43,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:28:43,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:43,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:43,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:28:43,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 29 letters. [2022-02-21 04:28:43,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:28:43,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:28:43,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:28:43,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:28:43,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:28:43,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:43,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:43,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:28:43,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:28:43,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:28:43,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:28:43,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 54 letters. Loop has 28 letters. [2022-02-21 04:28:43,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 54 letters. Loop has 28 letters. [2022-02-21 04:28:43,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 39 letters. Loop has 27 letters. [2022-02-21 04:28:43,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 39 letters. Loop has 27 letters. [2022-02-21 04:28:43,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 39 letters. Loop has 27 letters. [2022-02-21 04:28:43,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 40 letters. Loop has 27 letters. [2022-02-21 04:28:43,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 40 letters. Loop has 27 letters. [2022-02-21 04:28:43,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 40 letters. Loop has 27 letters. [2022-02-21 04:28:43,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:28:43,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:28:43,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 61 letters. Loop has 28 letters. [2022-02-21 04:28:43,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 61 letters. Loop has 28 letters. [2022-02-21 04:28:43,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:28:43,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 45 letters. Loop has 29 letters. [2022-02-21 04:28:43,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:28:43,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:43,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 29 letters. [2022-02-21 04:28:43,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:43,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:28:43,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:28:43,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 48 letters. Loop has 28 letters. [2022-02-21 04:28:43,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 48 letters. Loop has 28 letters. [2022-02-21 04:28:43,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:28:43,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 29 letters. [2022-02-21 04:28:43,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:28:43,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:43,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:43,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:43,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:43,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:28:43,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:28:43,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:28:43,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:28:43,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:43,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 29 letters. [2022-02-21 04:28:43,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:43,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:43,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 29 letters. [2022-02-21 04:28:43,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:43,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:43,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:43,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:28:43,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 29 letters. [2022-02-21 04:28:43,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:28:43,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:43,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 29 letters. [2022-02-21 04:28:43,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:43,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 41 letters. Loop has 29 letters. [2022-02-21 04:28:43,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 41 letters. Loop has 29 letters. [2022-02-21 04:28:43,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 41 letters. Loop has 29 letters. [2022-02-21 04:28:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 42 letters. Loop has 29 letters. [2022-02-21 04:28:43,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:43,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:43,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 42 letters. Loop has 29 letters. [2022-02-21 04:28:43,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:43,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 46 letters. Loop has 27 letters. [2022-02-21 04:28:43,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 46 letters. Loop has 27 letters. [2022-02-21 04:28:43,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 47 letters. Loop has 27 letters. [2022-02-21 04:28:43,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 47 letters. Loop has 27 letters. [2022-02-21 04:28:43,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:43,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 38 letters. Loop has 27 letters. [2022-02-21 04:28:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:43,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 29 letters. [2022-02-21 04:28:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:43,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:43,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:43,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 41 letters. Loop has 27 letters. [2022-02-21 04:28:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 41 letters. Loop has 27 letters. [2022-02-21 04:28:43,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 41 letters. Loop has 27 letters. [2022-02-21 04:28:43,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 42 letters. Loop has 27 letters. [2022-02-21 04:28:43,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 42 letters. Loop has 27 letters. [2022-02-21 04:28:43,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 42 letters. Loop has 27 letters. [2022-02-21 04:28:43,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:28:43,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:28:43,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:43,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 29 letters. [2022-02-21 04:28:43,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:43,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:43,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 29 letters. [2022-02-21 04:28:43,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:43,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:28:43,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:28:43,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:43,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:43,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 58 letters. Loop has 28 letters. [2022-02-21 04:28:43,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 58 letters. Loop has 28 letters. [2022-02-21 04:28:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:28:43,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:28:43,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:28:43,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:28:43,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:28:43,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:28:43,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:28:43,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:28:43,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 56 letters. Loop has 28 letters. [2022-02-21 04:28:43,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 56 letters. Loop has 28 letters. [2022-02-21 04:28:43,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 40 letters. Loop has 27 letters. [2022-02-21 04:28:43,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 40 letters. Loop has 27 letters. [2022-02-21 04:28:43,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 40 letters. Loop has 27 letters. [2022-02-21 04:28:43,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:43,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 41 letters. Loop has 28 letters. [2022-02-21 04:28:43,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:43,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 41 letters. Loop has 27 letters. [2022-02-21 04:28:43,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 41 letters. Loop has 27 letters. [2022-02-21 04:28:43,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 41 letters. Loop has 27 letters. [2022-02-21 04:28:43,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:43,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:43,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:28:43,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:28:43,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 44 letters. Loop has 27 letters. [2022-02-21 04:28:43,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 44 letters. Loop has 27 letters. [2022-02-21 04:28:43,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 44 letters. Loop has 27 letters. [2022-02-21 04:28:43,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:43,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 45 letters. Loop has 28 letters. [2022-02-21 04:28:43,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:43,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:28:43,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 45 letters. Loop has 27 letters. [2022-02-21 04:28:43,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:28:43,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 43 letters. Loop has 27 letters. [2022-02-21 04:28:43,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 43 letters. Loop has 27 letters. [2022-02-21 04:28:43,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 43 letters. Loop has 27 letters. [2022-02-21 04:28:43,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 44 letters. Loop has 28 letters. [2022-02-21 04:28:43,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 44 letters. Loop has 28 letters. [2022-02-21 04:28:43,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 44 letters. Loop has 28 letters. [2022-02-21 04:28:43,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:28:43,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:28:43,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:28:43,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 27 letters. [2022-02-21 04:28:43,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:28:43,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:43,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 30 letters. [2022-02-21 04:28:43,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:43,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:43,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 28 letters. [2022-02-21 04:28:43,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:43,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 113 states and 157 transitions. cyclomatic complexity: 45 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:43,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:28:43,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 188 states and 277 transitions. cyclomatic complexity: 90 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:43,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,888 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:28:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-02-21 04:28:43,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 157 transitions. Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:43,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 157 transitions. Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:28:43,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 157 transitions. Stem has 38 letters. Loop has 54 letters. [2022-02-21 04:28:43,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:43,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 277 transitions. cyclomatic complexity: 90 [2022-02-21 04:28:43,906 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:43,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 0 states and 0 transitions. [2022-02-21 04:28:43,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:43,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:43,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:43,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:43,907 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:43,907 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:43,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:43,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:28:43,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:28:43,909 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:28:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:43,909 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:28:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:43,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:28:43,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:43,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:28:43,961 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:43,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:28:43,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:43,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:43,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:43,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:43,961 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:43,961 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:43,961 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:43,962 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:28:43,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:28:43,962 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:43,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:43,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:28:43 BoogieIcfgContainer [2022-02-21 04:28:43,969 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:28:43,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:28:43,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:28:43,970 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:28:43,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:37" (3/4) ... [2022-02-21 04:28:43,972 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:28:43,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:28:43,973 INFO L158 Benchmark]: Toolchain (without parser) took 7670.61ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 61.2MB in the beginning and 71.7MB in the end (delta: -10.5MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2022-02-21 04:28:43,973 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:43,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.98ms. Allocated memory is still 100.7MB. Free memory was 61.0MB in the beginning and 69.4MB in the end (delta: -8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:28:43,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.80ms. Allocated memory is still 100.7MB. Free memory was 69.4MB in the beginning and 66.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:43,974 INFO L158 Benchmark]: Boogie Preprocessor took 60.77ms. Allocated memory is still 100.7MB. Free memory was 66.0MB in the beginning and 63.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:43,975 INFO L158 Benchmark]: RCFGBuilder took 723.03ms. Allocated memory is still 100.7MB. Free memory was 63.6MB in the beginning and 37.6MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-02-21 04:28:43,975 INFO L158 Benchmark]: BuchiAutomizer took 6436.91ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 37.6MB in the beginning and 72.6MB in the end (delta: -35.1MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-02-21 04:28:43,975 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 146.8MB. Free memory was 72.6MB in the beginning and 71.7MB in the end (delta: 993.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:43,977 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.18ms. Allocated memory is still 100.7MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.98ms. Allocated memory is still 100.7MB. Free memory was 61.0MB in the beginning and 69.4MB in the end (delta: -8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.80ms. Allocated memory is still 100.7MB. Free memory was 69.4MB in the beginning and 66.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.77ms. Allocated memory is still 100.7MB. Free memory was 66.0MB in the beginning and 63.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 723.03ms. Allocated memory is still 100.7MB. Free memory was 63.6MB in the beginning and 37.6MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 6436.91ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 37.6MB in the beginning and 72.6MB in the end (delta: -35.1MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 146.8MB. Free memory was 72.6MB in the beginning and 71.7MB in the end (delta: 993.0kB). There was no memory consumed. 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 + -2 * i2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. Construction of modules took 0.0s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 113 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 1635 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1129 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 506 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax100 hnf100 lsp41 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq228 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:28:44,036 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