./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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.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 5e99154d55f7fd098c0e840b496605adea5c7214bf70234e7c54dceeadfa306b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:28:39,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:28:39,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:28:39,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:28:39,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:28:39,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:28:39,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:28:39,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:28:39,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:28:39,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:28:39,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:28:39,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:28:39,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:28:39,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:28:39,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:28:39,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:28:39,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:28:39,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:28:39,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:28:39,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:28:39,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:28:39,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:28:39,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:28:39,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:28:39,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:28:39,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:28:39,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:28:39,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:28:39,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:28:39,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:28:39,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:28:39,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:28:39,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:28:39,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:28:39,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:28:39,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:28:39,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:28:39,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:28:39,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:28:39,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:28:39,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:28:39,700 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:39,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:28:39,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:28:39,734 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:28:39,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:28:39,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:28:39,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:28:39,740 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:28:39,740 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:28:39,741 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:28:39,741 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:28:39,742 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:28:39,742 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:28:39,742 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:28:39,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:28:39,743 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:28:39,743 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:28:39,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:28:39,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:28:39,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:28:39,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:28:39,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:28:39,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:28:39,744 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:28:39,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:28:39,745 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:28:39,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:28:39,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:28:39,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:28:39,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:28:39,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:28:39,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:28:39,748 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:28:39,748 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 -> 5e99154d55f7fd098c0e840b496605adea5c7214bf70234e7c54dceeadfa306b [2022-02-21 04:28:39,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:28:40,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:28:40,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:28:40,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:28:40,018 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:28:40,020 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.ufo.BOUNDED-10.pals.c [2022-02-21 04:28:40,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33cf278d5/58372c7abaeb49b5813a1828d22b7cd9/FLAGe82cfb119 [2022-02-21 04:28:40,509 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:28:40,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2022-02-21 04:28:40,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33cf278d5/58372c7abaeb49b5813a1828d22b7cd9/FLAGe82cfb119 [2022-02-21 04:28:40,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33cf278d5/58372c7abaeb49b5813a1828d22b7cd9 [2022-02-21 04:28:40,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:28:40,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:28:40,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:40,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:28:40,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:28:40,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:40" (1/1) ... [2022-02-21 04:28:40,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e992217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:40, skipping insertion in model container [2022-02-21 04:28:40,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:40" (1/1) ... [2022-02-21 04:28:40,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:28:40,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:28:41,190 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.ufo.BOUNDED-10.pals.c[12751,12764] [2022-02-21 04:28:41,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:41,198 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:28:41,244 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.ufo.BOUNDED-10.pals.c[12751,12764] [2022-02-21 04:28:41,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:41,257 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:28:41,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:41 WrapperNode [2022-02-21 04:28:41,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:41,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:41,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:28:41,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:28:41,267 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:41" (1/1) ... [2022-02-21 04:28:41,284 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:41" (1/1) ... [2022-02-21 04:28:41,331 INFO L137 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 372 [2022-02-21 04:28:41,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:41,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:28:41,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:28:41,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:28:41,340 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:41" (1/1) ... [2022-02-21 04:28:41,340 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:41" (1/1) ... [2022-02-21 04:28:41,343 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:41" (1/1) ... [2022-02-21 04:28:41,343 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:41" (1/1) ... [2022-02-21 04:28:41,349 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:41" (1/1) ... [2022-02-21 04:28:41,364 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:41" (1/1) ... [2022-02-21 04:28:41,367 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:41" (1/1) ... [2022-02-21 04:28:41,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:28:41,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:28:41,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:28:41,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:28:41,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:41" (1/1) ... [2022-02-21 04:28:41,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:41,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:41,402 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:41,404 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:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:28:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:28:41,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:28:41,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:28:41,510 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:28:41,512 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:28:41,980 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:28:41,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:28:41,991 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:28:41,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:41 BoogieIcfgContainer [2022-02-21 04:28:41,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:28:41,996 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:28:41,996 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:28:41,998 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:28:41,999 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:41,999 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:28:40" (1/3) ... [2022-02-21 04:28:42,000 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@735a33b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:42, skipping insertion in model container [2022-02-21 04:28:42,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:42,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:41" (2/3) ... [2022-02-21 04:28:42,001 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@735a33b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:42, skipping insertion in model container [2022-02-21 04:28:42,001 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:42,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:41" (3/3) ... [2022-02-21 04:28:42,002 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c [2022-02-21 04:28:42,048 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:28:42,048 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:28:42,049 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:28:42,049 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:28:42,049 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:28:42,049 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:28:42,049 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:28:42,049 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:28:42,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 121 states, 120 states have (on average 1.7) internal successors, (204), 120 states have internal predecessors, (204), 0 states have call successors, (0), 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:42,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2022-02-21 04:28:42,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:42,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:42,124 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:42,124 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:42,124 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:28:42,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 121 states, 120 states have (on average 1.7) internal successors, (204), 120 states have internal predecessors, (204), 0 states have call successors, (0), 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:42,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2022-02-21 04:28:42,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:42,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:42,144 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:42,144 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:42,151 INFO L791 eck$LassoCheckResult]: Stem: 107#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(48, 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; 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 61#L246true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 20#L246-1true init_#res#1 := init_~tmp~0#1; 17#L375true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 36#L22true assume !(0 == assume_abort_if_not_~cond#1); 91#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; 18#L444-2true [2022-02-21 04:28:42,151 INFO L793 eck$LassoCheckResult]: Loop: 18#L444-2true assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 65#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; 10#L80true assume !(node1_~m1~0#1 != ~nomsg~0); 105#L80-1true ~mode1~0 := 0; 110#L76-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 21#L111true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 48#L114true assume !(node2_~m2~0#1 != ~nomsg~0); 89#L114-1true ~mode2~0 := 0; 92#L111-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 55#L145true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 29#L148true assume !(node3_~m3~0#1 != ~nomsg~0); 101#L148-1true ~mode3~0 := 0; 49#L145-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 114#L179true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 95#L182true assume !(node4_~m4~0#1 != ~nomsg~0); 122#L182-1true ~mode4~0 := 0; 24#L179-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 115#L213true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 99#L216true assume !(node5_~m5~0#1 != ~nomsg~0); 57#L216-1true ~mode5~0 := 0; 14#L213-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; 44#L383true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 11#L383-1true check_#res#1 := check_~tmp~1#1; 76#L395true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 52#L474true assume !(0 == assert_~arg#1 % 256); 16#L469true assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 18#L444-2true [2022-02-21 04:28:42,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1984313218, now seen corresponding path program 1 times [2022-02-21 04:28:42,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:42,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864387637] [2022-02-21 04:28:42,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:42,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:42,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#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(48, 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; {125#true} is VALID [2022-02-21 04:28:42,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {125#true} is VALID [2022-02-21 04:28:42,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {127#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:28:42,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {127#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {128#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:28:42,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {128#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {129#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:28:42,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {126#false} is VALID [2022-02-21 04:28:42,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {126#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; {126#false} is VALID [2022-02-21 04:28:42,386 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:42,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:42,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864387637] [2022-02-21 04:28:42,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864387637] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:42,389 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:42,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:42,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903835675] [2022-02-21 04:28:42,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:42,396 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash 738213390, now seen corresponding path program 1 times [2022-02-21 04:28:42,399 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:42,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008922570] [2022-02-21 04:28:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:42,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {130#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:42,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {130#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:42,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {130#true} assume !(node1_~m1~0#1 != ~nomsg~0); {130#true} is VALID [2022-02-21 04:28:42,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {130#true} ~mode1~0 := 0; {130#true} is VALID [2022-02-21 04:28:42,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {130#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:42,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {130#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:42,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {130#true} assume !(node2_~m2~0#1 != ~nomsg~0); {130#true} is VALID [2022-02-21 04:28:42,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#true} ~mode2~0 := 0; {130#true} is VALID [2022-02-21 04:28:42,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:42,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:42,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#true} assume !(node3_~m3~0#1 != ~nomsg~0); {130#true} is VALID [2022-02-21 04:28:42,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#true} ~mode3~0 := 0; {130#true} is VALID [2022-02-21 04:28:42,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {130#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:42,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {130#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:42,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {130#true} assume !(node4_~m4~0#1 != ~nomsg~0); {130#true} is VALID [2022-02-21 04:28:42,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {130#true} ~mode4~0 := 0; {130#true} is VALID [2022-02-21 04:28:42,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {130#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:42,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {130#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {130#true} is VALID [2022-02-21 04:28:42,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {130#true} assume !(node5_~m5~0#1 != ~nomsg~0); {130#true} is VALID [2022-02-21 04:28:42,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {130#true} ~mode5~0 := 0; {130#true} is VALID [2022-02-21 04:28:42,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {130#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; {130#true} is VALID [2022-02-21 04:28:42,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {130#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {132#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:42,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {132#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {133#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:42,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {133#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {134#(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:42,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {134#(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); {131#false} is VALID [2022-02-21 04:28:42,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {131#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {131#false} is VALID [2022-02-21 04:28:42,619 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:42,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:42,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008922570] [2022-02-21 04:28:42,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008922570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:42,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:42,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:42,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448094098] [2022-02-21 04:28:42,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:42,623 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:42,624 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:42,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:42,659 INFO L87 Difference]: Start difference. First operand has 121 states, 120 states have (on average 1.7) internal successors, (204), 120 states have internal predecessors, (204), 0 states have call successors, (0), 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:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:43,119 INFO L93 Difference]: Finished difference Result 124 states and 203 transitions. [2022-02-21 04:28:43,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:43,121 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:43,130 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:43,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 203 transitions. [2022-02-21 04:28:43,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:28:43,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 116 states and 164 transitions. [2022-02-21 04:28:43,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2022-02-21 04:28:43,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2022-02-21 04:28:43,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 164 transitions. [2022-02-21 04:28:43,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:43,150 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2022-02-21 04:28:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 164 transitions. [2022-02-21 04:28:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-02-21 04:28:43,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:43,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 164 transitions. Second operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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,184 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 164 transitions. Second operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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,185 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:43,189 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2022-02-21 04:28:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2022-02-21 04:28:43,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:43,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:43,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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 116 states and 164 transitions. [2022-02-21 04:28:43,192 INFO L87 Difference]: Start difference. First operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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 116 states and 164 transitions. [2022-02-21 04:28:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:43,196 INFO L93 Difference]: Finished difference Result 116 states and 164 transitions. [2022-02-21 04:28:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2022-02-21 04:28:43,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:43,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:43,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:43,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 115 states have internal predecessors, (164), 0 states have call successors, (0), 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,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2022-02-21 04:28:43,202 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2022-02-21 04:28:43,202 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 164 transitions. [2022-02-21 04:28:43,203 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:28:43,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 164 transitions. [2022-02-21 04:28:43,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:28:43,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:43,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:43,206 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:43,206 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:43,207 INFO L791 eck$LassoCheckResult]: Stem: 378#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(48, 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; 321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 322#L246 assume 0 == ~r1~0; 348#L247 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 376#L248 assume ~id1~0 >= 0; 268#L249 assume 0 == ~st1~0; 269#L250 assume ~send1~0 == ~id1~0; 363#L251 assume 0 == ~mode1~0 % 256; 332#L252 assume ~id2~0 >= 0; 333#L253 assume 0 == ~st2~0; 339#L254 assume ~send2~0 == ~id2~0; 293#L255 assume 0 == ~mode2~0 % 256; 294#L256 assume ~id3~0 >= 0; 334#L257 assume 0 == ~st3~0; 315#L258 assume ~send3~0 == ~id3~0; 316#L259 assume 0 == ~mode3~0 % 256; 353#L260 assume ~id4~0 >= 0; 354#L261 assume 0 == ~st4~0; 342#L262 assume ~send4~0 == ~id4~0; 343#L263 assume 0 == ~mode4~0 % 256; 346#L264 assume ~id5~0 >= 0; 347#L265 assume 0 == ~st5~0; 279#L266 assume ~send5~0 == ~id5~0; 280#L267 assume 0 == ~mode5~0 % 256; 299#L268 assume ~id1~0 != ~id2~0; 300#L269 assume ~id1~0 != ~id3~0; 272#L270 assume ~id1~0 != ~id4~0; 273#L271 assume ~id1~0 != ~id5~0; 317#L272 assume ~id2~0 != ~id3~0; 325#L273 assume ~id2~0 != ~id4~0; 345#L274 assume ~id2~0 != ~id5~0; 368#L275 assume ~id3~0 != ~id4~0; 263#L276 assume ~id3~0 != ~id5~0; 264#L277 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 295#L246-1 init_#res#1 := init_~tmp~0#1; 290#L375 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 291#L22 assume !(0 == assume_abort_if_not_~cond#1); 324#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; 289#L444-2 [2022-02-21 04:28:43,207 INFO L793 eck$LassoCheckResult]: Loop: 289#L444-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 292#L76 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; 274#L80 assume !(node1_~m1~0#1 != ~nomsg~0); 276#L80-1 ~mode1~0 := 0; 377#L76-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 296#L111 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 297#L114 assume !(node2_~m2~0#1 != ~nomsg~0); 308#L114-1 ~mode2~0 := 0; 373#L111-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 344#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 313#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 271#L148-1 ~mode3~0 := 0; 306#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 338#L179 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 374#L182 assume !(node4_~m4~0#1 != ~nomsg~0); 311#L182-1 ~mode4~0 := 0; 304#L179-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 305#L213 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 375#L216 assume !(node5_~m5~0#1 != ~nomsg~0); 302#L216-1 ~mode5~0 := 0; 284#L213-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; 285#L383 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 277#L383-1 check_#res#1 := check_~tmp~1#1; 278#L395 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 341#L474 assume !(0 == assert_~arg#1 % 256); 288#L469 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 289#L444-2 [2022-02-21 04:28:43,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:43,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 1 times [2022-02-21 04:28:43,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:43,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073492300] [2022-02-21 04:28:43,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:43,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:43,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:43,306 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash 738213390, now seen corresponding path program 2 times [2022-02-21 04:28:43,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:43,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91625472] [2022-02-21 04:28:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:43,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:43,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:43,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume !(node1_~m1~0#1 != ~nomsg~0); {616#true} is VALID [2022-02-21 04:28:43,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {616#true} ~mode1~0 := 0; {616#true} is VALID [2022-02-21 04:28:43,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {616#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:43,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:43,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {616#true} assume !(node2_~m2~0#1 != ~nomsg~0); {616#true} is VALID [2022-02-21 04:28:43,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#true} ~mode2~0 := 0; {616#true} is VALID [2022-02-21 04:28:43,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {616#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:43,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {616#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:43,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {616#true} assume !(node3_~m3~0#1 != ~nomsg~0); {616#true} is VALID [2022-02-21 04:28:43,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {616#true} ~mode3~0 := 0; {616#true} is VALID [2022-02-21 04:28:43,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {616#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:43,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {616#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:43,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {616#true} assume !(node4_~m4~0#1 != ~nomsg~0); {616#true} is VALID [2022-02-21 04:28:43,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#true} ~mode4~0 := 0; {616#true} is VALID [2022-02-21 04:28:43,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {616#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:43,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {616#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {616#true} is VALID [2022-02-21 04:28:43,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {616#true} assume !(node5_~m5~0#1 != ~nomsg~0); {616#true} is VALID [2022-02-21 04:28:43,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {616#true} ~mode5~0 := 0; {616#true} is VALID [2022-02-21 04:28:43,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {616#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; {616#true} is VALID [2022-02-21 04:28:43,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {616#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {618#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:43,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {618#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {619#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:43,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {619#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {620#(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:43,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {620#(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); {617#false} is VALID [2022-02-21 04:28:43,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {617#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {617#false} is VALID [2022-02-21 04:28:43,430 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,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:43,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91625472] [2022-02-21 04:28:43,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91625472] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:43,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:43,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:43,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136762263] [2022-02-21 04:28:43,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:43,433 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:43,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:43,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:43,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:43,435 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. cyclomatic complexity: 49 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:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:43,814 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2022-02-21 04:28:43,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:43,814 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:43,839 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:43,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 166 transitions. [2022-02-21 04:28:43,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:28:43,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 116 states and 162 transitions. [2022-02-21 04:28:43,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2022-02-21 04:28:43,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2022-02-21 04:28:43,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 162 transitions. [2022-02-21 04:28:43,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:43,849 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2022-02-21 04:28:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 162 transitions. [2022-02-21 04:28:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-02-21 04:28:43,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:43,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 162 transitions. Second operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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,854 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 162 transitions. Second operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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,855 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:43,858 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2022-02-21 04:28:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-02-21 04:28:43,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:43,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:43,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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 116 states and 162 transitions. [2022-02-21 04:28:43,864 INFO L87 Difference]: Start difference. First operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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 116 states and 162 transitions. [2022-02-21 04:28:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:43,869 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2022-02-21 04:28:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2022-02-21 04:28:43,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:43,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:43,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:43,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.396551724137931) internal successors, (162), 115 states have internal predecessors, (162), 0 states have call successors, (0), 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,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2022-02-21 04:28:43,874 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2022-02-21 04:28:43,874 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 162 transitions. [2022-02-21 04:28:43,874 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:28:43,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 162 transitions. [2022-02-21 04:28:43,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:28:43,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:43,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:43,876 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:43,877 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:43,877 INFO L791 eck$LassoCheckResult]: Stem: 859#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(48, 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; 802#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 803#L246 assume 0 == ~r1~0; 829#L247 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; 857#L248 assume ~id1~0 >= 0; 749#L249 assume 0 == ~st1~0; 750#L250 assume ~send1~0 == ~id1~0; 844#L251 assume 0 == ~mode1~0 % 256; 813#L252 assume ~id2~0 >= 0; 814#L253 assume 0 == ~st2~0; 820#L254 assume ~send2~0 == ~id2~0; 774#L255 assume 0 == ~mode2~0 % 256; 775#L256 assume ~id3~0 >= 0; 815#L257 assume 0 == ~st3~0; 796#L258 assume ~send3~0 == ~id3~0; 797#L259 assume 0 == ~mode3~0 % 256; 834#L260 assume ~id4~0 >= 0; 835#L261 assume 0 == ~st4~0; 823#L262 assume ~send4~0 == ~id4~0; 824#L263 assume 0 == ~mode4~0 % 256; 827#L264 assume ~id5~0 >= 0; 828#L265 assume 0 == ~st5~0; 760#L266 assume ~send5~0 == ~id5~0; 761#L267 assume 0 == ~mode5~0 % 256; 780#L268 assume ~id1~0 != ~id2~0; 781#L269 assume ~id1~0 != ~id3~0; 753#L270 assume ~id1~0 != ~id4~0; 754#L271 assume ~id1~0 != ~id5~0; 798#L272 assume ~id2~0 != ~id3~0; 806#L273 assume ~id2~0 != ~id4~0; 826#L274 assume ~id2~0 != ~id5~0; 849#L275 assume ~id3~0 != ~id4~0; 744#L276 assume ~id3~0 != ~id5~0; 745#L277 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 776#L246-1 init_#res#1 := init_~tmp~0#1; 771#L375 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 772#L22 assume !(0 == assume_abort_if_not_~cond#1); 805#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; 770#L444-2 [2022-02-21 04:28:43,878 INFO L793 eck$LassoCheckResult]: Loop: 770#L444-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 773#L76 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; 755#L80 assume !(node1_~m1~0#1 != ~nomsg~0); 757#L80-1 ~mode1~0 := 0; 858#L76-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 777#L111 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 778#L114 assume !(node2_~m2~0#1 != ~nomsg~0); 789#L114-1 ~mode2~0 := 0; 854#L111-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 825#L145 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 794#L148 assume !(node3_~m3~0#1 != ~nomsg~0); 752#L148-1 ~mode3~0 := 0; 787#L145-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 819#L179 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 855#L182 assume !(node4_~m4~0#1 != ~nomsg~0); 792#L182-1 ~mode4~0 := 0; 785#L179-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 786#L213 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 856#L216 assume !(node5_~m5~0#1 != ~nomsg~0); 783#L216-1 ~mode5~0 := 0; 765#L213-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; 766#L383 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 816#L384 assume ~r1~0 < 5;check_~tmp~1#1 := 1; 758#L383-1 check_#res#1 := check_~tmp~1#1; 759#L395 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 822#L474 assume !(0 == assert_~arg#1 % 256); 769#L469 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 770#L444-2 [2022-02-21 04:28:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:43,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1707437673, now seen corresponding path program 2 times [2022-02-21 04:28:43,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:43,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508938207] [2022-02-21 04:28:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:43,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:43,903 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:43,944 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1026451556, now seen corresponding path program 1 times [2022-02-21 04:28:43,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:43,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518489851] [2022-02-21 04:28:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:43,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:43,981 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1906603762, now seen corresponding path program 1 times [2022-02-21 04:28:43,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:43,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935499205] [2022-02-21 04:28:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:44,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {1099#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(48, 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; {1099#true} is VALID [2022-02-21 04:28:44,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1099#true} is VALID [2022-02-21 04:28:44,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume 0 == ~r1~0; {1099#true} is VALID [2022-02-21 04:28:44,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {1099#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1099#true} is VALID [2022-02-21 04:28:44,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {1099#true} assume ~id1~0 >= 0; {1099#true} is VALID [2022-02-21 04:28:44,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#true} assume 0 == ~st1~0; {1099#true} is VALID [2022-02-21 04:28:44,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} assume ~send1~0 == ~id1~0; {1099#true} is VALID [2022-02-21 04:28:44,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#true} assume 0 == ~mode1~0 % 256; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~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; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:44,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {1101#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:44,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {1100#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1100#false} is VALID [2022-02-21 04:28:44,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {1100#false} ~mode1~0 := 0; {1100#false} is VALID [2022-02-21 04:28:44,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {1100#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:44,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {1100#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:44,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {1100#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1100#false} is VALID [2022-02-21 04:28:44,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {1100#false} ~mode2~0 := 0; {1100#false} is VALID [2022-02-21 04:28:44,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {1100#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:44,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {1100#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:44,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {1100#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1100#false} is VALID [2022-02-21 04:28:44,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {1100#false} ~mode3~0 := 0; {1100#false} is VALID [2022-02-21 04:28:44,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {1100#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:44,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {1100#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:44,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {1100#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1100#false} is VALID [2022-02-21 04:28:44,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {1100#false} ~mode4~0 := 0; {1100#false} is VALID [2022-02-21 04:28:44,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {1100#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:44,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {1100#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1100#false} is VALID [2022-02-21 04:28:44,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {1100#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1100#false} is VALID [2022-02-21 04:28:44,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {1100#false} ~mode5~0 := 0; {1100#false} is VALID [2022-02-21 04:28:44,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {1100#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; {1100#false} is VALID [2022-02-21 04:28:44,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {1100#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1100#false} is VALID [2022-02-21 04:28:44,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {1100#false} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {1100#false} is VALID [2022-02-21 04:28:44,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {1100#false} check_#res#1 := check_~tmp~1#1; {1100#false} is VALID [2022-02-21 04:28:44,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {1100#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {1100#false} is VALID [2022-02-21 04:28:44,058 INFO L290 TraceCheckUtils]: 63: Hoare triple {1100#false} assume !(0 == assert_~arg#1 % 256); {1100#false} is VALID [2022-02-21 04:28:44,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {1100#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {1100#false} is VALID [2022-02-21 04:28:44,058 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:44,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:44,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935499205] [2022-02-21 04:28:44,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935499205] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:44,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:44,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:28:44,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998373572] [2022-02-21 04:28:44,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:44,890 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:44,890 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:44,891 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:44,891 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:44,891 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:28:44,891 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:44,891 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:44,891 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:44,892 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-02-21 04:28:44,892 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:44,892 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:44,910 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:44,918 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:44,920 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:44,921 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:44,923 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:44,925 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:44,927 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:44,931 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:44,942 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:44,947 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:44,949 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:44,951 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:44,954 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:44,959 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:44,961 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:44,963 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:44,968 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:44,970 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:44,976 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:44,978 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:45,016 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:45,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:45,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:45,831 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:45,832 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:28:45,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:45,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:45,839 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:45,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:28:45,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:45,866 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:45,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:28:45,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:45,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:45,906 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:45,907 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:45,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:28:45,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:46,026 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:28:46,029 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:46,030 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:46,030 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:46,030 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:46,030 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:46,030 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:28:46,030 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:46,030 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:46,030 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:46,030 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-02-21 04:28:46,030 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:46,030 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:46,034 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:46,082 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:46,087 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:46,089 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:46,091 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:46,095 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:46,098 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:46,103 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:46,120 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:46,125 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:46,127 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:46,130 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:46,133 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:46,137 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:46,138 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:46,140 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:46,144 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:46,146 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:46,148 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:46,157 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:46,163 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:46,165 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:46,168 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:46,921 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:46,927 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:28:46,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:46,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:46,929 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:46,930 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:46,931 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:46,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:46,940 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:46,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:46,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:46,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:46,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:46,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:46,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:46,995 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:46,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:46,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:46,997 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:47,006 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:47,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,020 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:47,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,059 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:47,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,061 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:47,066 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:47,073 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:47,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,092 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:47,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,093 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:47,094 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:47,095 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:47,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,118 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:47,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,124 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:47,124 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:47,125 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:47,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,150 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:47,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,152 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:47,152 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:47,155 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:47,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,212 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:47,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,214 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:47,222 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:47,225 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:47,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,239 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,256 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:47,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,257 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:47,269 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:47,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,278 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:28:47,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,281 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:28:47,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,284 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:47,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,316 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:47,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,319 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:47,324 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:47,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,336 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:47,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:28:47,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,356 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:47,357 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:47,365 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:47,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,417 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:47,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,419 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:47,422 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:47,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,432 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:47,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:47,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,470 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:47,471 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:47,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:47,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,519 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:47,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,521 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:47,526 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:47,531 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:47,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,551 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:47,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,553 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:47,554 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:47,555 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:47,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,578 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:47,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,580 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:47,580 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:47,582 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:47,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:47,608 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:47,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,610 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:47,610 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:47,611 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:47,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:47,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:47,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:47,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:47,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:47,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:47,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:47,630 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:28:47,636 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:28:47,636 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:28:47,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:47,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:47,660 INFO L229 MonitoredProcess]: Starting monitored process 20 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:47,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:28:47,662 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:28:47,662 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:28:47,663 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:28:47,663 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:47,686 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:47,703 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:28:47,709 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node1_~m1~0#1 != ~nomsg~0);" "~mode1~0 := 0;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#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~ite8#1, node3_#t~ite9#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~ite10#1, node4_#t~ite11#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~ite12#1, node5_#t~ite13#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~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1;" [2022-02-21 04:28:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:47,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:28:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:47,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:47,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {1102#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(48, 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; {1102#unseeded} is VALID [2022-02-21 04:28:47,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {1102#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet14#1;havoc main_#t~nondet14#1;~id1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode4~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive4~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id5~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~st5~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~send5~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode5~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~alive5~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1102#unseeded} is VALID [2022-02-21 04:28:47,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {1102#unseeded} assume 0 == ~r1~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {1102#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 >= 1; {1102#unseeded} is VALID [2022-02-21 04:28:47,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {1102#unseeded} assume ~id1~0 >= 0; {1102#unseeded} is VALID [2022-02-21 04:28:47,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {1102#unseeded} assume 0 == ~st1~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {1102#unseeded} assume ~send1~0 == ~id1~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {1102#unseeded} assume 0 == ~mode1~0 % 256; {1102#unseeded} is VALID [2022-02-21 04:28:47,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {1102#unseeded} assume ~id2~0 >= 0; {1102#unseeded} is VALID [2022-02-21 04:28:47,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {1102#unseeded} assume 0 == ~st2~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {1102#unseeded} assume ~send2~0 == ~id2~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {1102#unseeded} assume 0 == ~mode2~0 % 256; {1102#unseeded} is VALID [2022-02-21 04:28:47,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {1102#unseeded} assume ~id3~0 >= 0; {1102#unseeded} is VALID [2022-02-21 04:28:47,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {1102#unseeded} assume 0 == ~st3~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {1102#unseeded} assume ~send3~0 == ~id3~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {1102#unseeded} assume 0 == ~mode3~0 % 256; {1102#unseeded} is VALID [2022-02-21 04:28:47,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {1102#unseeded} assume ~id4~0 >= 0; {1102#unseeded} is VALID [2022-02-21 04:28:47,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {1102#unseeded} assume 0 == ~st4~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {1102#unseeded} assume ~send4~0 == ~id4~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {1102#unseeded} assume 0 == ~mode4~0 % 256; {1102#unseeded} is VALID [2022-02-21 04:28:47,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {1102#unseeded} assume ~id5~0 >= 0; {1102#unseeded} is VALID [2022-02-21 04:28:47,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {1102#unseeded} assume 0 == ~st5~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {1102#unseeded} assume ~send5~0 == ~id5~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {1102#unseeded} assume 0 == ~mode5~0 % 256; {1102#unseeded} is VALID [2022-02-21 04:28:47,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {1102#unseeded} assume ~id1~0 != ~id2~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {1102#unseeded} assume ~id1~0 != ~id3~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {1102#unseeded} assume ~id1~0 != ~id4~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {1102#unseeded} assume ~id1~0 != ~id5~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {1102#unseeded} assume ~id2~0 != ~id3~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {1102#unseeded} assume ~id2~0 != ~id4~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {1102#unseeded} assume ~id2~0 != ~id5~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {1102#unseeded} assume ~id3~0 != ~id4~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {1102#unseeded} assume ~id3~0 != ~id5~0; {1102#unseeded} is VALID [2022-02-21 04:28:47,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {1102#unseeded} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1102#unseeded} is VALID [2022-02-21 04:28:47,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {1102#unseeded} init_#res#1 := init_~tmp~0#1; {1102#unseeded} is VALID [2022-02-21 04:28:47,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {1102#unseeded} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {1102#unseeded} is VALID [2022-02-21 04:28:47,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {1102#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {1102#unseeded} is VALID [2022-02-21 04:28:47,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {1102#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; {1102#unseeded} is VALID [2022-02-21 04:28:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:47,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:28:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:48,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:48,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:48,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#(>= 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_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} 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; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node1_~m1~0#1 != ~nomsg~0); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode1~0 := 0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {1231#(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~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {1231#(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; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node2_~m2~0#1 != ~nomsg~0); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode2~0 := 0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {1231#(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~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {1231#(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; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node3_~m3~0#1 != ~nomsg~0); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode3~0 := 0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {1231#(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~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {1231#(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; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node4_~m4~0#1 != ~nomsg~0); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode4~0 := 0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {1231#(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~ite12#1, node5_#t~ite13#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {1231#(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; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node5_~m5~0#1 != ~nomsg~0); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode5~0 := 0; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {1231#(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; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {1231#(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; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {1231#(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; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} check_#res#1 := check_~tmp~1#1; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 == assert_~arg#1 % 256); {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:28:48,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {1231#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {1115#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:28:48,328 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:48,329 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:48,349 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:48,351 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:48,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,354 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:48,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 162 transitions. cyclomatic complexity: 47 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:48,611 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 162 transitions. cyclomatic complexity: 47. 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 194 states and 287 transitions. Complement of second has 4 states. [2022-02-21 04:28:48,612 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:48,612 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:48,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 162 transitions. cyclomatic complexity: 47 [2022-02-21 04:28:48,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:48,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:48,612 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:48,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:48,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:48,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:48,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. [2022-02-21 04:28:48,625 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:48,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:48,627 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 116 states and 162 transitions. cyclomatic complexity: 47 [2022-02-21 04:28:48,665 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 78 examples of accepted words. [2022-02-21 04:28:48,665 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:48,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:48,668 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:28:48,668 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2022-02-21 04:28:48,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2022-02-21 04:28:48,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:48,668 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:28:48,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:48,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,669 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:48,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:48,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:48,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,671 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:48,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:48,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 194 letters. Loop has 194 letters. [2022-02-21 04:28:48,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,672 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 194 letters. Loop has 194 letters. [2022-02-21 04:28:48,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 194 letters. Loop has 194 letters. [2022-02-21 04:28:48,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 116 letters. Loop has 116 letters. [2022-02-21 04:28:48,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,673 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 116 letters. Loop has 116 letters. [2022-02-21 04:28:48,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 116 letters. Loop has 116 letters. [2022-02-21 04:28:48,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:48,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,674 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:48,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:48,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:28:48,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,675 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:48,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 28 letters. [2022-02-21 04:28:48,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:28:48,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,676 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:48,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:28:48,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:48,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,677 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:48,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:48,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 39 letters. Loop has 27 letters. [2022-02-21 04:28:48,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,679 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:48,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 39 letters. Loop has 27 letters. [2022-02-21 04:28:48,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 27 letters. [2022-02-21 04:28:48,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,680 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:48,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 27 letters. [2022-02-21 04:28:48,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 44 letters. Loop has 27 letters. [2022-02-21 04:28:48,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,681 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:48,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 44 letters. Loop has 27 letters. [2022-02-21 04:28:48,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 44 letters. Loop has 28 letters. [2022-02-21 04:28:48,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,682 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:48,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 44 letters. Loop has 28 letters. [2022-02-21 04:28:48,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:48,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,684 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:48,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:48,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:28:48,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,685 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:48,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:28:48,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:48,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,686 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:48,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:48,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:28:48,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,687 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:48,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:28:48,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:28:48,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,689 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:48,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:28:48,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:28:48,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,690 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:48,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:28:48,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:48,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,691 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:48,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:48,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:28:48,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,692 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:48,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:28:48,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:48,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,693 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:48,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:48,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:48,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,695 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:48,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:48,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:28:48,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,696 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:48,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:28:48,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:48,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,697 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:48,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:48,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:28:48,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,698 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:48,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:28:48,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:48,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,699 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:48,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:48,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 48 letters. Loop has 28 letters. [2022-02-21 04:28:48,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,701 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:48,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 28 letters. [2022-02-21 04:28:48,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:28:48,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,702 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:48,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:28:48,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:48,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,703 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:48,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:48,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:48,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,704 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:48,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:48,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:48,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,706 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:48,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:48,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:28:48,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,707 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:48,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:28:48,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:48,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,708 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:48,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:48,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:48,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,709 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:48,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 28 letters. [2022-02-21 04:28:48,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 28 letters. [2022-02-21 04:28:48,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,710 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:48,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 28 letters. [2022-02-21 04:28:48,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:28:48,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,712 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:48,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:28:48,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:28:48,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,713 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:48,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:28:48,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 61 letters. Loop has 28 letters. [2022-02-21 04:28:48,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,714 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:48,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 28 letters. [2022-02-21 04:28:48,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:48,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,715 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:48,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 28 letters. [2022-02-21 04:28:48,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:28:48,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,716 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:48,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:28:48,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:28:48,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,717 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:48,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:28:48,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:28:48,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,718 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:48,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:28:48,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 27 letters. [2022-02-21 04:28:48,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,720 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:48,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 27 letters. [2022-02-21 04:28:48,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 52 letters. Loop has 28 letters. [2022-02-21 04:28:48,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,721 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:48,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 28 letters. [2022-02-21 04:28:48,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:28:48,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,722 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:48,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:28:48,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:48,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,723 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:48,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 28 letters. [2022-02-21 04:28:48,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:28:48,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,724 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:48,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:28:48,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 40 letters. Loop has 28 letters. [2022-02-21 04:28:48,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,725 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 28 letters. [2022-02-21 04:28:48,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 40 letters. Loop has 28 letters. [2022-02-21 04:28:48,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:48,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,726 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:48,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:48,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 30 letters. [2022-02-21 04:28:48,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,728 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 30 letters. [2022-02-21 04:28:48,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 30 letters. [2022-02-21 04:28:48,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 28 letters. [2022-02-21 04:28:48,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,729 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 28 letters. [2022-02-21 04:28:48,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 28 letters. [2022-02-21 04:28:48,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:48,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,730 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:48,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:28:48,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 56 letters. Loop has 28 letters. [2022-02-21 04:28:48,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,731 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:48,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 28 letters. [2022-02-21 04:28:48,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:28:48,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,732 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:48,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:28:48,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:48,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,733 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:48,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 30 letters. [2022-02-21 04:28:48,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:48,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,734 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:48,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:28:48,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:48,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,735 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:48,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:48,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:48,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,742 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:48,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:28:48,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:48,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,743 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:48,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:48,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 29 letters. [2022-02-21 04:28:48,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,745 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:48,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 29 letters. [2022-02-21 04:28:48,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:48,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,746 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:48,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:48,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:48,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,747 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:48,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:28:48,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:48,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,748 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:48,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:28:48,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 27 letters. [2022-02-21 04:28:48,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,749 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:48,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 27 letters. [2022-02-21 04:28:48,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:28:48,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,750 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:48,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:28:48,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:28:48,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,751 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:48,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:28:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 42 letters. Loop has 27 letters. [2022-02-21 04:28:48,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,752 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:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 27 letters. [2022-02-21 04:28:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:48,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,753 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:48,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:28:48,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 28 letters. [2022-02-21 04:28:48,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,755 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:48,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 28 letters. [2022-02-21 04:28:48,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:48,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,756 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:48,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:28:48,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:48,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,757 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:48,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:28:48,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:28:48,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,758 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:48,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:28:48,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 40 letters. Loop has 27 letters. [2022-02-21 04:28:48,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,759 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:48,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 40 letters. Loop has 27 letters. [2022-02-21 04:28:48,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:48,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,760 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:48,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 28 letters. [2022-02-21 04:28:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 41 letters. Loop has 27 letters. [2022-02-21 04:28:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,761 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:48,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 41 letters. Loop has 27 letters. [2022-02-21 04:28:48,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:28:48,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,762 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:48,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:28:48,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:28:48,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,763 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:48,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:28:48,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:48,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,764 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:48,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 28 letters. [2022-02-21 04:28:48,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:28:48,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,766 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:48,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:28:48,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 50 letters. Loop has 28 letters. [2022-02-21 04:28:48,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,767 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:48,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 28 letters. [2022-02-21 04:28:48,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:28:48,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,768 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:48,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:28:48,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:28:48,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,769 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:48,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:28:48,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:48,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,770 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:48,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:28:48,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 116 states and 162 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:48,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,771 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:48,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:48,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,772 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:48,773 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:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-21 04:28:48,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 38 letters. Loop has 27 letters. [2022-02-21 04:28:48,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:28:48,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 162 transitions. Stem has 38 letters. Loop has 54 letters. [2022-02-21 04:28:48,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:48,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2022-02-21 04:28:48,781 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:48,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 0 states and 0 transitions. [2022-02-21 04:28:48,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:48,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:48,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:48,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:48,782 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:48,782 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:48,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:48,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:28:48,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:28:48,783 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:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:48,784 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:28:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:48,784 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:48,841 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:48,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:28:48,842 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:48,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:28:48,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:48,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:48,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:48,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:48,843 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:48,843 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:48,843 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:48,843 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:28:48,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:28:48,843 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:48,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:48,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:28:48 BoogieIcfgContainer [2022-02-21 04:28:48,849 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:28:48,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:28:48,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:28:48,850 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:28:48,851 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:41" (3/4) ... [2022-02-21 04:28:48,853 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:28:48,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:28:48,854 INFO L158 Benchmark]: Toolchain (without parser) took 7938.71ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 64.2MB in the beginning and 96.2MB in the end (delta: -32.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2022-02-21 04:28:48,854 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 81.8MB. Free memory was 60.8MB in the beginning and 60.8MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:48,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.49ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 67.5MB in the end (delta: -3.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:28:48,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.47ms. Allocated memory is still 98.6MB. Free memory was 67.5MB in the beginning and 64.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:28:48,855 INFO L158 Benchmark]: Boogie Preprocessor took 37.48ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 61.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:48,856 INFO L158 Benchmark]: RCFGBuilder took 623.95ms. Allocated memory is still 98.6MB. Free memory was 61.7MB in the beginning and 65.7MB in the end (delta: -4.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:48,856 INFO L158 Benchmark]: BuchiAutomizer took 6853.76ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 65.7MB in the beginning and 96.2MB in the end (delta: -30.5MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2022-02-21 04:28:48,856 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 144.7MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:48,858 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.21ms. Allocated memory is still 81.8MB. Free memory was 60.8MB in the beginning and 60.8MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.49ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 67.5MB in the end (delta: -3.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.47ms. Allocated memory is still 98.6MB. Free memory was 67.5MB in the beginning and 64.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.48ms. Allocated memory is still 98.6MB. Free memory was 64.2MB in the beginning and 61.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 623.95ms. Allocated memory is still 98.6MB. Free memory was 61.7MB in the beginning and 65.7MB in the end (delta: -4.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 6853.76ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 65.7MB in the beginning and 96.2MB in the end (delta: -30.5MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 144.7MB. Free memory is still 96.2MB. 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.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 1.9s. 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 116 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 1685 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1164 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 521 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf100 lsp37 ukn100 mio100 lsp100 div104 bol100 ite100 ukn100 eq218 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:28:48,892 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