./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.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.4.2.ufo.BOUNDED-8.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 c5be25d34b5f565c0e61b447a9da3cd9d228084b5ddd898e062981f46972caa8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:28:20,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:28:20,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:28:20,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:28:20,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:28:20,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:28:20,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:28:20,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:28:20,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:28:20,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:28:20,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:28:20,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:28:20,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:28:20,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:28:20,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:28:20,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:28:20,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:28:20,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:28:20,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:28:20,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:28:20,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:28:20,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:28:20,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:28:20,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:28:20,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:28:20,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:28:20,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:28:20,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:28:20,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:28:20,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:28:20,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:28:20,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:28:20,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:28:20,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:28:20,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:28:20,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:28:20,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:28:20,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:28:20,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:28:20,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:28:20,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:28:20,464 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:20,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:28:20,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:28:20,497 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:28:20,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:28:20,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:28:20,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:28:20,498 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:28:20,498 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:28:20,498 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:28:20,498 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:28:20,499 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:28:20,499 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:28:20,500 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:28:20,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:28:20,500 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:28:20,500 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:28:20,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:28:20,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:28:20,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:28:20,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:28:20,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:28:20,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:28:20,501 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:28:20,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:28:20,502 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:28:20,502 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:28:20,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:28:20,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:28:20,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:28:20,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:28:20,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:28:20,504 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:28:20,504 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 -> c5be25d34b5f565c0e61b447a9da3cd9d228084b5ddd898e062981f46972caa8 [2022-02-21 04:28:20,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:28:20,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:28:20,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:28:20,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:28:20,743 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:28:20,744 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.4.2.ufo.BOUNDED-8.pals.c [2022-02-21 04:28:20,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3cd4c73/4c38fb8ce7934c3da1347d8b101baa6a/FLAGc761d6aa1 [2022-02-21 04:28:21,115 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:28:21,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2022-02-21 04:28:21,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3cd4c73/4c38fb8ce7934c3da1347d8b101baa6a/FLAGc761d6aa1 [2022-02-21 04:28:21,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f3cd4c73/4c38fb8ce7934c3da1347d8b101baa6a [2022-02-21 04:28:21,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:28:21,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:28:21,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:21,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:28:21,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:28:21,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:21" (1/1) ... [2022-02-21 04:28:21,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d35274a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:21, skipping insertion in model container [2022-02-21 04:28:21,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:21" (1/1) ... [2022-02-21 04:28:21,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:28:21,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:28:21,764 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.4.2.ufo.BOUNDED-8.pals.c[9280,9293] [2022-02-21 04:28:21,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:21,770 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:28:21,839 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.4.2.ufo.BOUNDED-8.pals.c[9280,9293] [2022-02-21 04:28:21,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:21,850 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:28:21,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:21 WrapperNode [2022-02-21 04:28:21,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:21,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:21,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:28:21,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:28:21,863 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:21" (1/1) ... [2022-02-21 04:28:21,870 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:21" (1/1) ... [2022-02-21 04:28:21,926 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 298 [2022-02-21 04:28:21,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:21,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:28:21,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:28:21,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:28:21,934 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:21" (1/1) ... [2022-02-21 04:28:21,934 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:21" (1/1) ... [2022-02-21 04:28:21,936 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:21" (1/1) ... [2022-02-21 04:28:21,937 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:21" (1/1) ... [2022-02-21 04:28:21,952 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:21" (1/1) ... [2022-02-21 04:28:21,956 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:21" (1/1) ... [2022-02-21 04:28:21,958 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:21" (1/1) ... [2022-02-21 04:28:21,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:28:21,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:28:21,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:28:21,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:28:21,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:21" (1/1) ... [2022-02-21 04:28:21,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:21,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:22,002 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:22,007 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:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:28:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:28:22,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:28:22,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:28:22,096 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:28:22,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:28:22,412 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:28:22,417 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:28:22,417 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:28:22,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:22 BoogieIcfgContainer [2022-02-21 04:28:22,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:28:22,419 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:28:22,419 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:28:22,422 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:28:22,422 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:22,422 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:28:21" (1/3) ... [2022-02-21 04:28:22,423 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4407e7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:22, skipping insertion in model container [2022-02-21 04:28:22,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:22,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:21" (2/3) ... [2022-02-21 04:28:22,424 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4407e7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:22, skipping insertion in model container [2022-02-21 04:28:22,424 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:22,424 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:22" (3/3) ... [2022-02-21 04:28:22,425 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2022-02-21 04:28:22,479 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:28:22,479 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:28:22,479 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:28:22,479 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:28:22,479 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:28:22,480 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:28:22,480 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:28:22,480 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:28:22,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 96 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 0 states have call successors, (0), 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:22,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-02-21 04:28:22,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:22,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:22,555 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:22,557 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] [2022-02-21 04:28:22,557 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:28:22,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 96 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 0 states have call successors, (0), 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:22,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-02-21 04:28:22,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:22,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:22,573 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:22,573 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] [2022-02-21 04:28:22,579 INFO L791 eck$LassoCheckResult]: Stem: 71#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(49, 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; 57#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 4#L198true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 33#L198-1true init_#res#1 := init_~tmp~0#1; 7#L295true main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; 66#L347true assume !(0 == main_~i2~0#1); 93#L347-2true ~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;main_~i2~0#1 := 0; 56#L357-2true [2022-02-21 04:28:22,582 INFO L793 eck$LassoCheckResult]: Loop: 56#L357-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 96#L65true 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 20#L69true assume !(node1_~m1~0#1 != ~nomsg~0); 85#L69-1true ~mode1~0 := 0; 54#L65-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 13#L97true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 78#L100true assume !(node2_~m2~0#1 != ~nomsg~0); 11#L100-1true ~mode2~0 := 0; 75#L97-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 61#L131true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 74#L134true assume !(node3_~m3~0#1 != ~nomsg~0); 67#L134-1true ~mode3~0 := 0; 38#L131-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 19#L165true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 6#L168true assume !(node4_~m4~0#1 != ~nomsg~0); 83#L168-1true ~mode4~0 := 0; 30#L165-2true assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 76#L303true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 44#L303-1true check_#res#1 := check_~tmp~1#1; 62#L315true main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; 94#L384true assume !(0 == assert_~arg#1 % 256); 50#L379true assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; 56#L357-2true [2022-02-21 04:28:22,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:22,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1938506578, now seen corresponding path program 1 times [2022-02-21 04:28:22,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:22,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709179902] [2022-02-21 04:28:22,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:22,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:22,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {100#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(49, 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; {100#true} is VALID [2022-02-21 04:28:22,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {100#true} is VALID [2022-02-21 04:28:22,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {102#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:28:22,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {102#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {103#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:28:22,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {103#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {104#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-21 04:28:22,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {104#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {101#false} is VALID [2022-02-21 04:28:22,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {101#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {101#false} is VALID [2022-02-21 04:28:22,769 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:22,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:22,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709179902] [2022-02-21 04:28:22,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709179902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:22,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:22,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:22,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965619291] [2022-02-21 04:28:22,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:22,775 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:22,776 INFO L85 PathProgramCache]: Analyzing trace with hash -388024983, now seen corresponding path program 1 times [2022-02-21 04:28:22,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:22,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510513596] [2022-02-21 04:28:22,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:22,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:22,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {105#true} is VALID [2022-02-21 04:28:22,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {105#true} is VALID [2022-02-21 04:28:22,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {105#true} assume !(node1_~m1~0#1 != ~nomsg~0); {105#true} is VALID [2022-02-21 04:28:22,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#true} ~mode1~0 := 0; {105#true} is VALID [2022-02-21 04:28:22,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {105#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {105#true} is VALID [2022-02-21 04:28:22,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {105#true} is VALID [2022-02-21 04:28:22,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#true} assume !(node2_~m2~0#1 != ~nomsg~0); {105#true} is VALID [2022-02-21 04:28:22,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {105#true} ~mode2~0 := 0; {105#true} is VALID [2022-02-21 04:28:22,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {105#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {105#true} is VALID [2022-02-21 04:28:22,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {105#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {105#true} is VALID [2022-02-21 04:28:22,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {105#true} assume !(node3_~m3~0#1 != ~nomsg~0); {105#true} is VALID [2022-02-21 04:28:22,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {105#true} ~mode3~0 := 0; {105#true} is VALID [2022-02-21 04:28:22,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {105#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {105#true} is VALID [2022-02-21 04:28:22,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {105#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {105#true} is VALID [2022-02-21 04:28:22,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {105#true} assume !(node4_~m4~0#1 != ~nomsg~0); {105#true} is VALID [2022-02-21 04:28:22,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {105#true} ~mode4~0 := 0; {105#true} is VALID [2022-02-21 04:28:22,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {105#true} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {105#true} is VALID [2022-02-21 04:28:22,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {105#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {107#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:22,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {107#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {108#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:22,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {108#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {109#(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:22,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {109#(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); {106#false} is VALID [2022-02-21 04:28:22,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {106#false} assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {106#false} is VALID [2022-02-21 04:28:22,931 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:22,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:22,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510513596] [2022-02-21 04:28:22,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510513596] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:22,932 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:22,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:22,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247691239] [2022-02-21 04:28:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:22,948 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:22,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:22,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:22,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:22,982 INFO L87 Difference]: Start difference. First operand has 96 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 0 states have call successors, (0), 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:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:23,328 INFO L93 Difference]: Finished difference Result 161 states and 258 transitions. [2022-02-21 04:28:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:28:23,329 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:23,336 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:23,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 258 transitions. [2022-02-21 04:28:23,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2022-02-21 04:28:23,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 152 states and 226 transitions. [2022-02-21 04:28:23,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2022-02-21 04:28:23,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2022-02-21 04:28:23,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 226 transitions. [2022-02-21 04:28:23,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:23,355 INFO L681 BuchiCegarLoop]: Abstraction has 152 states and 226 transitions. [2022-02-21 04:28:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 226 transitions. [2022-02-21 04:28:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 91. [2022-02-21 04:28:23,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:23,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states and 226 transitions. Second operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 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:23,384 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states and 226 transitions. Second operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 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:23,385 INFO L87 Difference]: Start difference. First operand 152 states and 226 transitions. Second operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 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:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:23,390 INFO L93 Difference]: Finished difference Result 152 states and 226 transitions. [2022-02-21 04:28:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2022-02-21 04:28:23,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:23,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:23,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 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 152 states and 226 transitions. [2022-02-21 04:28:23,393 INFO L87 Difference]: Start difference. First operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 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 152 states and 226 transitions. [2022-02-21 04:28:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:23,397 INFO L93 Difference]: Finished difference Result 152 states and 226 transitions. [2022-02-21 04:28:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2022-02-21 04:28:23,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:23,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:23,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:23,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 0 states have call successors, (0), 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:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2022-02-21 04:28:23,402 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2022-02-21 04:28:23,402 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2022-02-21 04:28:23,402 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:28:23,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 128 transitions. [2022-02-21 04:28:23,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2022-02-21 04:28:23,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:23,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:23,409 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] [2022-02-21 04:28:23,409 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] [2022-02-21 04:28:23,410 INFO L791 eck$LassoCheckResult]: Stem: 357#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(49, 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; 350#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 275#L198 assume 0 == ~r1~0; 276#L199 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 343#L200 assume ~id1~0 >= 0; 344#L201 assume 0 == ~st1~0; 319#L202 assume ~send1~0 == ~id1~0; 320#L203 assume 0 == ~mode1~0 % 256; 333#L204 assume ~id2~0 >= 0; 299#L205 assume 0 == ~st2~0; 300#L206 assume ~send2~0 == ~id2~0; 284#L207 assume 0 == ~mode2~0 % 256; 285#L208 assume ~id3~0 >= 0; 347#L209 assume 0 == ~st3~0; 301#L210 assume ~send3~0 == ~id3~0; 302#L211 assume 0 == ~mode3~0 % 256; 289#L212 assume ~id4~0 >= 0; 290#L213 assume 0 == ~st4~0; 361#L214 assume ~send4~0 == ~id4~0; 362#L215 assume 0 == ~mode4~0 % 256; 345#L216 assume ~id1~0 != ~id2~0; 321#L217 assume ~id1~0 != ~id3~0; 322#L218 assume ~id1~0 != ~id4~0; 351#L219 assume ~id2~0 != ~id3~0; 365#L220 assume ~id2~0 != ~id4~0; 315#L221 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 316#L198-1 init_#res#1 := init_~tmp~0#1; 282#L295 main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; 283#L347 assume !(0 == main_~i2~0#1); 356#L347-2 ~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;main_~i2~0#1 := 0; 342#L357-2 [2022-02-21 04:28:23,410 INFO L793 eck$LassoCheckResult]: Loop: 342#L357-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 349#L65 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 307#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 278#L69-1 ~mode1~0 := 0; 348#L65-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 294#L97 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 296#L100 assume !(node2_~m2~0#1 != ~nomsg~0); 292#L100-1 ~mode2~0 := 0; 293#L97-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 352#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 353#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 313#L134-1 ~mode3~0 := 0; 328#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 305#L165 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 279#L168 assume !(node4_~m4~0#1 != ~nomsg~0); 280#L168-1 ~mode4~0 := 0; 323#L165-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 324#L303 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 304#L303-1 check_#res#1 := check_~tmp~1#1; 339#L315 main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; 354#L384 assume !(0 == assert_~arg#1 % 256); 341#L379 assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; 342#L357-2 [2022-02-21 04:28:23,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:23,411 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 1 times [2022-02-21 04:28:23,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:23,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807253919] [2022-02-21 04:28:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:23,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:23,483 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash -388024983, now seen corresponding path program 2 times [2022-02-21 04:28:23,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:23,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40179265] [2022-02-21 04:28:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:23,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {675#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {675#true} is VALID [2022-02-21 04:28:23,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {675#true} is VALID [2022-02-21 04:28:23,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} assume !(node1_~m1~0#1 != ~nomsg~0); {675#true} is VALID [2022-02-21 04:28:23,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {675#true} ~mode1~0 := 0; {675#true} is VALID [2022-02-21 04:28:23,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {675#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {675#true} is VALID [2022-02-21 04:28:23,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {675#true} is VALID [2022-02-21 04:28:23,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {675#true} assume !(node2_~m2~0#1 != ~nomsg~0); {675#true} is VALID [2022-02-21 04:28:23,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#true} ~mode2~0 := 0; {675#true} is VALID [2022-02-21 04:28:23,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {675#true} is VALID [2022-02-21 04:28:23,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {675#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {675#true} is VALID [2022-02-21 04:28:23,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {675#true} assume !(node3_~m3~0#1 != ~nomsg~0); {675#true} is VALID [2022-02-21 04:28:23,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {675#true} ~mode3~0 := 0; {675#true} is VALID [2022-02-21 04:28:23,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {675#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {675#true} is VALID [2022-02-21 04:28:23,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {675#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {675#true} is VALID [2022-02-21 04:28:23,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {675#true} assume !(node4_~m4~0#1 != ~nomsg~0); {675#true} is VALID [2022-02-21 04:28:23,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {675#true} ~mode4~0 := 0; {675#true} is VALID [2022-02-21 04:28:23,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {675#true} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {675#true} is VALID [2022-02-21 04:28:23,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {675#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {677#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:23,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {677#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {678#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:23,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {678#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {679#(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:23,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {679#(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); {676#false} is VALID [2022-02-21 04:28:23,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {676#false} assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {676#false} is VALID [2022-02-21 04:28:23,623 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:23,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:23,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40179265] [2022-02-21 04:28:23,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40179265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:23,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:23,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:23,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809689584] [2022-02-21 04:28:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:23,626 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:23,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:23,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:23,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:23,628 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. cyclomatic complexity: 38 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:23,888 INFO L93 Difference]: Finished difference Result 94 states and 130 transitions. [2022-02-21 04:28:23,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:23,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:23,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:23,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 130 transitions. [2022-02-21 04:28:23,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2022-02-21 04:28:23,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 91 states and 126 transitions. [2022-02-21 04:28:23,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2022-02-21 04:28:23,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2022-02-21 04:28:23,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 126 transitions. [2022-02-21 04:28:23,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:23,919 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 126 transitions. [2022-02-21 04:28:23,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 126 transitions. [2022-02-21 04:28:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-21 04:28:23,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:23,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states and 126 transitions. Second operand has 91 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 90 states have internal predecessors, (126), 0 states have call successors, (0), 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:23,941 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states and 126 transitions. Second operand has 91 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 90 states have internal predecessors, (126), 0 states have call successors, (0), 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:23,941 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 91 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 90 states have internal predecessors, (126), 0 states have call successors, (0), 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:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:23,945 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2022-02-21 04:28:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2022-02-21 04:28:23,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:23,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:23,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 90 states have internal predecessors, (126), 0 states have call successors, (0), 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 91 states and 126 transitions. [2022-02-21 04:28:23,946 INFO L87 Difference]: Start difference. First operand has 91 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 90 states have internal predecessors, (126), 0 states have call successors, (0), 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 91 states and 126 transitions. [2022-02-21 04:28:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:23,948 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2022-02-21 04:28:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2022-02-21 04:28:23,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:23,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:23,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:23,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 90 states have internal predecessors, (126), 0 states have call successors, (0), 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:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2022-02-21 04:28:23,952 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 126 transitions. [2022-02-21 04:28:23,952 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 126 transitions. [2022-02-21 04:28:23,952 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:28:23,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 126 transitions. [2022-02-21 04:28:23,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2022-02-21 04:28:23,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:23,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:23,954 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] [2022-02-21 04:28:23,954 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] [2022-02-21 04:28:23,955 INFO L791 eck$LassoCheckResult]: Stem: 860#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(49, 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; 853#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 778#L198 assume 0 == ~r1~0; 779#L199 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 846#L200 assume ~id1~0 >= 0; 847#L201 assume 0 == ~st1~0; 822#L202 assume ~send1~0 == ~id1~0; 823#L203 assume 0 == ~mode1~0 % 256; 836#L204 assume ~id2~0 >= 0; 800#L205 assume 0 == ~st2~0; 801#L206 assume ~send2~0 == ~id2~0; 787#L207 assume 0 == ~mode2~0 % 256; 788#L208 assume ~id3~0 >= 0; 850#L209 assume 0 == ~st3~0; 804#L210 assume ~send3~0 == ~id3~0; 805#L211 assume 0 == ~mode3~0 % 256; 792#L212 assume ~id4~0 >= 0; 793#L213 assume 0 == ~st4~0; 864#L214 assume ~send4~0 == ~id4~0; 865#L215 assume 0 == ~mode4~0 % 256; 848#L216 assume ~id1~0 != ~id2~0; 824#L217 assume ~id1~0 != ~id3~0; 825#L218 assume ~id1~0 != ~id4~0; 854#L219 assume ~id2~0 != ~id3~0; 868#L220 assume ~id2~0 != ~id4~0; 818#L221 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 819#L198-1 init_#res#1 := init_~tmp~0#1; 785#L295 main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; 786#L347 assume !(0 == main_~i2~0#1); 859#L347-2 ~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;main_~i2~0#1 := 0; 845#L357-2 [2022-02-21 04:28:23,955 INFO L793 eck$LassoCheckResult]: Loop: 845#L357-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 852#L65 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 810#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 781#L69-1 ~mode1~0 := 0; 851#L65-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 797#L97 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 799#L100 assume !(node2_~m2~0#1 != ~nomsg~0); 795#L100-1 ~mode2~0 := 0; 796#L97-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 855#L131 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 856#L134 assume !(node3_~m3~0#1 != ~nomsg~0); 816#L134-1 ~mode3~0 := 0; 831#L131-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 808#L165 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 782#L168 assume !(node4_~m4~0#1 != ~nomsg~0); 783#L168-1 ~mode4~0 := 0; 826#L165-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 827#L303 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 843#L304 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 807#L303-1 check_#res#1 := check_~tmp~1#1; 840#L315 main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; 857#L384 assume !(0 == assert_~arg#1 % 256); 844#L379 assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; 845#L357-2 [2022-02-21 04:28:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 2 times [2022-02-21 04:28:23,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:23,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620982880] [2022-02-21 04:28:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:23,974 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:23,993 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:23,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash 472800243, now seen corresponding path program 1 times [2022-02-21 04:28:23,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:23,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411261100] [2022-02-21 04:28:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:23,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:24,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:24,018 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:24,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:24,019 INFO L85 PathProgramCache]: Analyzing trace with hash 614624425, now seen corresponding path program 1 times [2022-02-21 04:28:24,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:24,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747235370] [2022-02-21 04:28:24,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:24,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:24,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {1058#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(49, 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; {1058#true} is VALID [2022-02-21 04:28:24,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {1058#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1058#true} is VALID [2022-02-21 04:28:24,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {1058#true} assume 0 == ~r1~0; {1058#true} is VALID [2022-02-21 04:28:24,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {1058#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1058#true} is VALID [2022-02-21 04:28:24,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {1058#true} assume ~id1~0 >= 0; {1058#true} is VALID [2022-02-21 04:28:24,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {1058#true} assume 0 == ~st1~0; {1058#true} is VALID [2022-02-21 04:28:24,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {1058#true} assume ~send1~0 == ~id1~0; {1058#true} is VALID [2022-02-21 04:28:24,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {1058#true} assume 0 == ~mode1~0 % 256; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1060#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:24,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {1060#(= (+ (* (- 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-21 04:28:24,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {1059#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-21 04:28:24,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {1059#false} ~mode1~0 := 0; {1059#false} is VALID [2022-02-21 04:28:24,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {1059#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1059#false} is VALID [2022-02-21 04:28:24,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {1059#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-21 04:28:24,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {1059#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-21 04:28:24,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {1059#false} ~mode2~0 := 0; {1059#false} is VALID [2022-02-21 04:28:24,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {1059#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1059#false} is VALID [2022-02-21 04:28:24,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {1059#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-21 04:28:24,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {1059#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-21 04:28:24,076 INFO L290 TraceCheckUtils]: 41: Hoare triple {1059#false} ~mode3~0 := 0; {1059#false} is VALID [2022-02-21 04:28:24,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {1059#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1059#false} is VALID [2022-02-21 04:28:24,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {1059#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1059#false} is VALID [2022-02-21 04:28:24,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {1059#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1059#false} is VALID [2022-02-21 04:28:24,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {1059#false} ~mode4~0 := 0; {1059#false} is VALID [2022-02-21 04:28:24,077 INFO L290 TraceCheckUtils]: 46: Hoare triple {1059#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1059#false} is VALID [2022-02-21 04:28:24,077 INFO L290 TraceCheckUtils]: 47: Hoare triple {1059#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1059#false} is VALID [2022-02-21 04:28:24,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {1059#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {1059#false} is VALID [2022-02-21 04:28:24,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {1059#false} check_#res#1 := check_~tmp~1#1; {1059#false} is VALID [2022-02-21 04:28:24,078 INFO L290 TraceCheckUtils]: 50: Hoare triple {1059#false} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {1059#false} is VALID [2022-02-21 04:28:24,078 INFO L290 TraceCheckUtils]: 51: Hoare triple {1059#false} assume !(0 == assert_~arg#1 % 256); {1059#false} is VALID [2022-02-21 04:28:24,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {1059#false} assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {1059#false} is VALID [2022-02-21 04:28:24,078 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:24,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:24,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747235370] [2022-02-21 04:28:24,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747235370] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:24,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:24,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:28:24,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217098212] [2022-02-21 04:28:24,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:24,714 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:24,714 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:24,714 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:24,715 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:24,715 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:28:24,715 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:24,715 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:24,715 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:24,715 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:28:24,715 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:24,716 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:24,732 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:24,741 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:24,746 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:24,748 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:24,750 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:24,775 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:24,778 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:24,783 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:24,785 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:24,787 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:24,789 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:24,794 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:24,800 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:24,803 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:24,814 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:24,817 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:24,821 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:24,823 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:24,827 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:25,329 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:25,330 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:28:25,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:25,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:25,333 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:25,334 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:25,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:28:25,335 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:25,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:25,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:25,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:25,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:25,452 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:25,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:28:25,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:25,647 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:28:25,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:25,652 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:25,652 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:25,652 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:25,652 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:25,653 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:28:25,653 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:25,653 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:25,653 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:25,653 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:28:25,653 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:25,653 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:25,655 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:25,667 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:25,671 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:25,673 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:25,674 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:25,678 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:25,680 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:25,682 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:25,683 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:25,687 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:25,689 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:25,707 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:25,709 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:25,713 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:25,714 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:25,718 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:25,745 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:25,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:25,749 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:26,304 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:26,307 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:28:26,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:26,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:26,309 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:26,311 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:26,312 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:26,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:26,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:26,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:26,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:26,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:26,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:26,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:26,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:26,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 04:28:26,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:26,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:26,355 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:26,357 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:26,358 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:26,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:26,364 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:26,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:26,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:26,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:26,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:26,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:26,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:26,394 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:26,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:26,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:26,396 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:26,397 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:26,398 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:26,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:26,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:26,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:26,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:26,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:26,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:26,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:26,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:26,446 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:26,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:26,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:26,454 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:26,456 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:26,457 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:26,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:26,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:26,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:26,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:26,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:26,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:26,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:26,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:26,481 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:26,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:26,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:26,483 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:26,484 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:26,486 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:26,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:26,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:26,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:26,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:26,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:26,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:26,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:26,502 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:28:26,505 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:28:26,506 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:28:26,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:26,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:26,533 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:26,579 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:28:26,579 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:28:26,580 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:28:26,580 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2022-02-21 04:28:26,603 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:26,623 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:26,640 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:28:26,655 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_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~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0#1 != ~nomsg~0);" "~mode2~0 := 0;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0#1 != ~nomsg~0);" "~mode3~0 := 0;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0#1 != ~nomsg~0);" "~mode4~0 := 0;" "assume { :end_inline_node4 } true;~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;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 <= 1;" "assume ~r1~0 < 4;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1;" [2022-02-21 04:28:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:26,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:26,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:28:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:26,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:26,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#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(49, 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; {1061#unseeded} is VALID [2022-02-21 04:28:26,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~ret32#1, main_#t~ret33#1, main_#t~post34#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~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~alive1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~alive2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~alive3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~id4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~st4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~send4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~alive4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1061#unseeded} is VALID [2022-02-21 04:28:26,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#unseeded} assume 0 == ~r1~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {1061#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1061#unseeded} is VALID [2022-02-21 04:28:26,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {1061#unseeded} assume ~id1~0 >= 0; {1061#unseeded} is VALID [2022-02-21 04:28:26,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {1061#unseeded} assume 0 == ~st1~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {1061#unseeded} assume ~send1~0 == ~id1~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#unseeded} assume 0 == ~mode1~0 % 256; {1061#unseeded} is VALID [2022-02-21 04:28:26,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#unseeded} assume ~id2~0 >= 0; {1061#unseeded} is VALID [2022-02-21 04:28:26,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#unseeded} assume 0 == ~st2~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {1061#unseeded} assume ~send2~0 == ~id2~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {1061#unseeded} assume 0 == ~mode2~0 % 256; {1061#unseeded} is VALID [2022-02-21 04:28:26,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {1061#unseeded} assume ~id3~0 >= 0; {1061#unseeded} is VALID [2022-02-21 04:28:26,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {1061#unseeded} assume 0 == ~st3~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {1061#unseeded} assume ~send3~0 == ~id3~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {1061#unseeded} assume 0 == ~mode3~0 % 256; {1061#unseeded} is VALID [2022-02-21 04:28:26,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {1061#unseeded} assume ~id4~0 >= 0; {1061#unseeded} is VALID [2022-02-21 04:28:26,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {1061#unseeded} assume 0 == ~st4~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {1061#unseeded} assume ~send4~0 == ~id4~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {1061#unseeded} assume 0 == ~mode4~0 % 256; {1061#unseeded} is VALID [2022-02-21 04:28:26,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {1061#unseeded} assume ~id1~0 != ~id2~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {1061#unseeded} assume ~id1~0 != ~id3~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {1061#unseeded} assume ~id1~0 != ~id4~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {1061#unseeded} assume ~id2~0 != ~id3~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {1061#unseeded} assume ~id2~0 != ~id4~0; {1061#unseeded} is VALID [2022-02-21 04:28:26,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {1061#unseeded} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1061#unseeded} is VALID [2022-02-21 04:28:26,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {1061#unseeded} init_#res#1 := init_~tmp~0#1; {1061#unseeded} is VALID [2022-02-21 04:28:26,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {1061#unseeded} main_#t~ret32#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1; {1061#unseeded} is VALID [2022-02-21 04:28:26,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {1061#unseeded} assume !(0 == main_~i2~0#1); {1061#unseeded} is VALID [2022-02-21 04:28:26,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {1061#unseeded} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1061#unseeded} is VALID [2022-02-21 04:28:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:26,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:28:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:26,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:27,079 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:27,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#(>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(node1_~m1~0#1 != ~nomsg~0); {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode1~0 := 0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(node2_~m2~0#1 != ~nomsg~0); {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode2~0 := 0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_#t~ite8#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(node3_~m3~0#1 != ~nomsg~0); {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode3~0 := 0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9#1, node4_#t~ite10#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(node4_~m4~0#1 != ~nomsg~0); {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode4~0 := 0; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} check_#res#1 := check_~tmp~1#1; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} main_#t~ret33#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret33#1;havoc main_#t~ret33#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; {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 == assert_~arg#1 % 256); {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:27,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {1166#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_assert } true;main_#t~post34#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {1074#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:28:27,113 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:27,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:27,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:27,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:27,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,135 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:27,135 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 126 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:27,290 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 126 transitions. cyclomatic complexity: 36. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 152 states and 223 transitions. Complement of second has 4 states. [2022-02-21 04:28:27,291 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:27,291 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:27,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 126 transitions. cyclomatic complexity: 36 [2022-02-21 04:28:27,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:27,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:27,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:27,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:27,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:27,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:27,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 223 transitions. [2022-02-21 04:28:27,298 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:27,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:27,301 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 91 states and 126 transitions. cyclomatic complexity: 36 [2022-02-21 04:28:27,326 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 61 examples of accepted words. [2022-02-21 04:28:27,326 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:27,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:27,328 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:28:27,328 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 152 states and 223 transitions. cyclomatic complexity: 72 [2022-02-21 04:28:27,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 223 transitions. cyclomatic complexity: 72 [2022-02-21 04:28:27,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:27,329 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:28:27,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:27,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:27,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:27,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:27,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:27,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:27,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 152 letters. Loop has 152 letters. [2022-02-21 04:28:27,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 152 letters. [2022-02-21 04:28:27,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 152 letters. Loop has 152 letters. [2022-02-21 04:28:27,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 91 letters. Loop has 91 letters. [2022-02-21 04:28:27,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 91 letters. [2022-02-21 04:28:27,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 91 letters. Loop has 91 letters. [2022-02-21 04:28:27,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:27,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:27,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:27,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:28:27,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:28:27,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:28:27,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 33 letters. Loop has 23 letters. [2022-02-21 04:28:27,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 23 letters. [2022-02-21 04:28:27,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 23 letters. [2022-02-21 04:28:27,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 44 letters. Loop has 23 letters. [2022-02-21 04:28:27,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 44 letters. Loop has 23 letters. [2022-02-21 04:28:27,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 45 letters. Loop has 23 letters. [2022-02-21 04:28:27,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 45 letters. Loop has 23 letters. [2022-02-21 04:28:27,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 45 letters. Loop has 24 letters. [2022-02-21 04:28:27,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 24 letters. [2022-02-21 04:28:27,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 45 letters. Loop has 24 letters. [2022-02-21 04:28:27,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:27,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:27,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:27,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 38 letters. Loop has 24 letters. [2022-02-21 04:28:27,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 24 letters. [2022-02-21 04:28:27,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 38 letters. Loop has 24 letters. [2022-02-21 04:28:27,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 38 letters. Loop has 26 letters. [2022-02-21 04:28:27,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:28:27,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 38 letters. Loop has 26 letters. [2022-02-21 04:28:27,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:27,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:27,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:27,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 37 letters. Loop has 23 letters. [2022-02-21 04:28:27,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 23 letters. [2022-02-21 04:28:27,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 37 letters. Loop has 23 letters. [2022-02-21 04:28:27,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 38 letters. Loop has 23 letters. [2022-02-21 04:28:27,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 38 letters. Loop has 23 letters. [2022-02-21 04:28:27,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 35 letters. Loop has 23 letters. [2022-02-21 04:28:27,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 23 letters. [2022-02-21 04:28:27,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 35 letters. Loop has 23 letters. [2022-02-21 04:28:27,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 36 letters. Loop has 24 letters. [2022-02-21 04:28:27,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 24 letters. [2022-02-21 04:28:27,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 36 letters. Loop has 24 letters. [2022-02-21 04:28:27,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 36 letters. Loop has 23 letters. [2022-02-21 04:28:27,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 23 letters. [2022-02-21 04:28:27,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 36 letters. Loop has 23 letters. [2022-02-21 04:28:27,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:28:27,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:28:27,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:28:27,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 46 letters. Loop has 24 letters. [2022-02-21 04:28:27,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 24 letters. [2022-02-21 04:28:27,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 46 letters. Loop has 24 letters. [2022-02-21 04:28:27,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 49 letters. Loop has 24 letters. [2022-02-21 04:28:27,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 24 letters. [2022-02-21 04:28:27,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 49 letters. Loop has 24 letters. [2022-02-21 04:28:27,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 49 letters. Loop has 23 letters. [2022-02-21 04:28:27,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 49 letters. Loop has 23 letters. [2022-02-21 04:28:27,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 43 letters. Loop has 23 letters. [2022-02-21 04:28:27,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 43 letters. Loop has 23 letters. [2022-02-21 04:28:27,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 44 letters. Loop has 24 letters. [2022-02-21 04:28:27,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 24 letters. [2022-02-21 04:28:27,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 44 letters. Loop has 24 letters. [2022-02-21 04:28:27,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 32 letters. Loop has 23 letters. [2022-02-21 04:28:27,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 23 letters. [2022-02-21 04:28:27,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 32 letters. Loop has 23 letters. [2022-02-21 04:28:27,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 33 letters. Loop has 24 letters. [2022-02-21 04:28:27,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 24 letters. [2022-02-21 04:28:27,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 24 letters. [2022-02-21 04:28:27,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 41 letters. Loop has 24 letters. [2022-02-21 04:28:27,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 24 letters. [2022-02-21 04:28:27,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 41 letters. Loop has 24 letters. [2022-02-21 04:28:27,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 42 letters. Loop has 24 letters. [2022-02-21 04:28:27,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 24 letters. [2022-02-21 04:28:27,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 42 letters. Loop has 24 letters. [2022-02-21 04:28:27,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 42 letters. Loop has 26 letters. [2022-02-21 04:28:27,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:28:27,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 42 letters. Loop has 26 letters. [2022-02-21 04:28:27,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 42 letters. Loop has 25 letters. [2022-02-21 04:28:27,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 25 letters. [2022-02-21 04:28:27,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 42 letters. Loop has 25 letters. [2022-02-21 04:28:27,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 41 letters. Loop has 23 letters. [2022-02-21 04:28:27,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 41 letters. Loop has 23 letters. [2022-02-21 04:28:27,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:28:27,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:28:27,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:28:27,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:28:27,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:28:27,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:28:27,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:28:27,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:28:27,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:28:27,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 46 letters. Loop has 23 letters. [2022-02-21 04:28:27,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 46 letters. Loop has 23 letters. [2022-02-21 04:28:27,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 47 letters. Loop has 23 letters. [2022-02-21 04:28:27,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 47 letters. Loop has 23 letters. [2022-02-21 04:28:27,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 32 letters. Loop has 23 letters. [2022-02-21 04:28:27,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 23 letters. [2022-02-21 04:28:27,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 32 letters. Loop has 23 letters. [2022-02-21 04:28:27,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 33 letters. Loop has 25 letters. [2022-02-21 04:28:27,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 25 letters. [2022-02-21 04:28:27,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 25 letters. [2022-02-21 04:28:27,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 33 letters. Loop has 23 letters. [2022-02-21 04:28:27,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 23 letters. [2022-02-21 04:28:27,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 23 letters. [2022-02-21 04:28:27,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 42 letters. Loop has 23 letters. [2022-02-21 04:28:27,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 42 letters. Loop has 23 letters. [2022-02-21 04:28:27,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:28:27,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:28:27,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:28:27,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 41 letters. Loop has 25 letters. [2022-02-21 04:28:27,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 25 letters. [2022-02-21 04:28:27,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 41 letters. Loop has 25 letters. [2022-02-21 04:28:27,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 42 letters. Loop has 25 letters. [2022-02-21 04:28:27,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 25 letters. [2022-02-21 04:28:27,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 42 letters. Loop has 25 letters. [2022-02-21 04:28:27,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:27,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:27,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:27,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 45 letters. Loop has 25 letters. [2022-02-21 04:28:27,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 25 letters. [2022-02-21 04:28:27,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 45 letters. Loop has 25 letters. [2022-02-21 04:28:27,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 46 letters. Loop has 25 letters. [2022-02-21 04:28:27,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 25 letters. [2022-02-21 04:28:27,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 46 letters. Loop has 25 letters. [2022-02-21 04:28:27,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 40 letters. Loop has 24 letters. [2022-02-21 04:28:27,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 24 letters. [2022-02-21 04:28:27,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 40 letters. Loop has 24 letters. [2022-02-21 04:28:27,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 50 letters. Loop has 23 letters. [2022-02-21 04:28:27,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 50 letters. Loop has 23 letters. [2022-02-21 04:28:27,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 45 letters. Loop has 24 letters. [2022-02-21 04:28:27,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 24 letters. [2022-02-21 04:28:27,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 45 letters. Loop has 24 letters. [2022-02-21 04:28:27,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 46 letters. Loop has 26 letters. [2022-02-21 04:28:27,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:28:27,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 46 letters. Loop has 26 letters. [2022-02-21 04:28:27,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 48 letters. Loop has 23 letters. [2022-02-21 04:28:27,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 48 letters. Loop has 23 letters. [2022-02-21 04:28:27,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 52 letters. Loop has 23 letters. [2022-02-21 04:28:27,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 52 letters. Loop has 23 letters. [2022-02-21 04:28:27,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:27,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:27,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:27,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 41 letters. Loop has 24 letters. [2022-02-21 04:28:27,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 24 letters. [2022-02-21 04:28:27,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 41 letters. Loop has 24 letters. [2022-02-21 04:28:27,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 34 letters. Loop has 23 letters. [2022-02-21 04:28:27,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 23 letters. [2022-02-21 04:28:27,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 34 letters. Loop has 23 letters. [2022-02-21 04:28:27,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 31 letters. Loop has 23 letters. [2022-02-21 04:28:27,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 23 letters. [2022-02-21 04:28:27,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 31 letters. Loop has 23 letters. [2022-02-21 04:28:27,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 39 letters. Loop has 23 letters. [2022-02-21 04:28:27,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 39 letters. Loop has 23 letters. [2022-02-21 04:28:27,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 40 letters. Loop has 23 letters. [2022-02-21 04:28:27,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 40 letters. Loop has 23 letters. [2022-02-21 04:28:27,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 51 letters. Loop has 23 letters. [2022-02-21 04:28:27,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 23 letters. [2022-02-21 04:28:27,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 51 letters. Loop has 23 letters. [2022-02-21 04:28:27,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 38 letters. Loop has 25 letters. [2022-02-21 04:28:27,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 25 letters. [2022-02-21 04:28:27,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 38 letters. Loop has 25 letters. [2022-02-21 04:28:27,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:27,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:27,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:27,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 37 letters. Loop has 25 letters. [2022-02-21 04:28:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 25 letters. [2022-02-21 04:28:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 37 letters. Loop has 25 letters. [2022-02-21 04:28:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:28:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 26 letters. [2022-02-21 04:28:27,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:28:27,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 38 letters. Loop has 25 letters. [2022-02-21 04:28:27,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 25 letters. [2022-02-21 04:28:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 38 letters. Loop has 25 letters. [2022-02-21 04:28:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 46 letters. Loop has 25 letters. [2022-02-21 04:28:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 25 letters. [2022-02-21 04:28:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 46 letters. Loop has 25 letters. [2022-02-21 04:28:27,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:27,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:27,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:27,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,402 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-21 04:28:27,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 126 transitions. Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:27,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 126 transitions. Stem has 53 letters. Loop has 23 letters. [2022-02-21 04:28:27,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 126 transitions. Stem has 30 letters. Loop has 46 letters. [2022-02-21 04:28:27,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:27,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 223 transitions. cyclomatic complexity: 72 [2022-02-21 04:28:27,412 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:27,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 0 states and 0 transitions. [2022-02-21 04:28:27,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:27,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:27,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:27,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:27,412 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:27,413 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:27,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:27,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:28:27,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:28:27,413 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:27,414 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:28:27,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:27,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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:27,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:27,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:28:27,449 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:27,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:28:27,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:27,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:27,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:27,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:27,450 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:27,450 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:27,450 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:27,450 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:28:27,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:28:27,451 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:27,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:27,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:28:27 BoogieIcfgContainer [2022-02-21 04:28:27,457 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:28:27,457 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:28:27,458 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:28:27,458 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:28:27,458 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:22" (3/4) ... [2022-02-21 04:28:27,461 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:28:27,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:28:27,462 INFO L158 Benchmark]: Toolchain (without parser) took 5927.82ms. Allocated memory was 73.4MB in the beginning and 130.0MB in the end (delta: 56.6MB). Free memory was 44.4MB in the beginning and 37.5MB in the end (delta: 6.9MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:27,462 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory is still 44.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:27,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.87ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 44.2MB in the beginning and 57.3MB in the end (delta: -13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:28:27,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.42ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 54.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:28:27,466 INFO L158 Benchmark]: Boogie Preprocessor took 33.08ms. Allocated memory is still 88.1MB. Free memory was 54.1MB in the beginning and 52.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:27,466 INFO L158 Benchmark]: RCFGBuilder took 457.67ms. Allocated memory is still 88.1MB. Free memory was 52.3MB in the beginning and 59.5MB in the end (delta: -7.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-21 04:28:27,466 INFO L158 Benchmark]: BuchiAutomizer took 5037.63ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 59.5MB in the beginning and 38.6MB in the end (delta: 20.9MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2022-02-21 04:28:27,468 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 130.0MB. Free memory was 38.6MB in the beginning and 37.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:27,476 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory is still 44.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.87ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 44.2MB in the beginning and 57.3MB in the end (delta: -13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.42ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 54.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.08ms. Allocated memory is still 88.1MB. Free memory was 54.1MB in the beginning and 52.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 457.67ms. Allocated memory is still 88.1MB. Free memory was 52.3MB in the beginning and 59.5MB in the end (delta: -7.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 5037.63ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 59.5MB in the beginning and 38.6MB in the end (delta: 20.9MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 130.0MB. Free memory was 38.6MB in the beginning and 37.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 + -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 4.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 61 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 91 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 228 mSDsluCounter, 1298 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 895 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 403 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital145 mio100 ax100 hnf100 lsp34 ukn100 mio100 lsp100 div129 bol100 ite100 ukn100 eq175 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:28:27,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE