/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:19:57,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:19:57,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:19:57,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:19:57,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:19:57,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:19:57,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:19:57,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:19:57,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:19:57,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:19:57,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:19:57,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:19:57,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:19:57,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:19:57,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:19:57,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:19:57,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:19:57,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:19:57,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:19:57,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:19:57,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:19:57,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:19:57,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:19:57,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:19:57,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:19:57,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:19:57,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:19:57,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:19:57,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:19:57,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:19:57,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:19:57,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:19:57,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:19:57,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:19:57,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:19:57,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:19:57,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:19:57,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:19:57,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:19:57,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:19:57,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:19:57,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:19:57,896 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:19:57,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:19:57,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:19:57,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:19:57,898 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:19:57,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:19:57,898 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:19:57,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:19:57,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:19:57,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:19:57,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:19:57,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:19:57,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:19:57,900 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:19:57,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:19:57,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:19:57,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:19:57,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:19:57,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:19:57,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:19:57,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:19:57,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:19:57,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:19:57,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:19:57,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:19:57,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:19:57,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:19:57,901 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:19:57,901 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-06 05:19:58,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:19:58,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:19:58,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:19:58,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:19:58,181 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:19:58,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2022-12-06 05:19:59,117 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:19:59,330 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:19:59,330 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2022-12-06 05:19:59,335 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b77257f/8bf2dc90e4bc4083a3f44355ed9fa7c0/FLAGa28bbae14 [2022-12-06 05:19:59,346 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b77257f/8bf2dc90e4bc4083a3f44355ed9fa7c0 [2022-12-06 05:19:59,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:19:59,349 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:19:59,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:19:59,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:19:59,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:19:59,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac3cebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59, skipping insertion in model container [2022-12-06 05:19:59,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:19:59,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:19:59,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,486 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2022-12-06 05:19:59,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:19:59,498 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:19:59,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:19:59,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:19:59,545 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c[4400,4413] [2022-12-06 05:19:59,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:19:59,563 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:19:59,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59 WrapperNode [2022-12-06 05:19:59,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:19:59,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:19:59,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:19:59,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:19:59,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,588 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,626 INFO L138 Inliner]: procedures = 25, calls = 100, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 278 [2022-12-06 05:19:59,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:19:59,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:19:59,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:19:59,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:19:59,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,664 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:19:59,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:19:59,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:19:59,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:19:59,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (1/1) ... [2022-12-06 05:19:59,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:19:59,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:19:59,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:19:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:19:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:19:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:19:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:19:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:19:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:19:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:19:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:19:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:19:59,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:19:59,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 05:19:59,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 05:19:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:19:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-06 05:19:59,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-06 05:19:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-06 05:19:59,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-06 05:19:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:19:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:19:59,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:19:59,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:19:59,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:19:59,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:19:59,744 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:19:59,818 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:19:59,820 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:20:00,104 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:20:00,197 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:20:00,197 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 05:20:00,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:20:00 BoogieIcfgContainer [2022-12-06 05:20:00,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:20:00,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:20:00,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:20:00,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:20:00,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:19:59" (1/3) ... [2022-12-06 05:20:00,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e25ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:20:00, skipping insertion in model container [2022-12-06 05:20:00,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:19:59" (2/3) ... [2022-12-06 05:20:00,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e25ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:20:00, skipping insertion in model container [2022-12-06 05:20:00,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:20:00" (3/3) ... [2022-12-06 05:20:00,204 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2022-12-06 05:20:00,216 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:20:00,216 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:20:00,216 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:20:00,274 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-12-06 05:20:00,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 181 transitions, 410 flow [2022-12-06 05:20:00,364 INFO L130 PetriNetUnfolder]: 2/175 cut-off events. [2022-12-06 05:20:00,364 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:20:00,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 175 events. 2/175 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-06 05:20:00,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 181 transitions, 410 flow [2022-12-06 05:20:00,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 159 transitions, 354 flow [2022-12-06 05:20:00,372 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:00,383 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 159 transitions, 354 flow [2022-12-06 05:20:00,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 159 transitions, 354 flow [2022-12-06 05:20:00,422 INFO L130 PetriNetUnfolder]: 2/159 cut-off events. [2022-12-06 05:20:00,422 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:20:00,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 159 events. 2/159 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-06 05:20:00,427 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 159 transitions, 354 flow [2022-12-06 05:20:00,427 INFO L188 LiptonReduction]: Number of co-enabled transitions 3042 [2022-12-06 05:20:07,571 INFO L203 LiptonReduction]: Total number of compositions: 121 [2022-12-06 05:20:07,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:20:07,590 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@945998d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:20:07,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 05:20:07,598 INFO L130 PetriNetUnfolder]: 0/37 cut-off events. [2022-12-06 05:20:07,599 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:20:07,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:07,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:07,600 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash -152965531, now seen corresponding path program 1 times [2022-12-06 05:20:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:07,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581158324] [2022-12-06 05:20:07,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:08,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581158324] [2022-12-06 05:20:08,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581158324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:08,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:08,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:20:08,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638658843] [2022-12-06 05:20:08,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:08,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:20:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:08,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:20:08,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:20:08,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 05:20:08,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 112 flow. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-06 05:20:08,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:08,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 05:20:08,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:10,625 INFO L130 PetriNetUnfolder]: 17545/23053 cut-off events. [2022-12-06 05:20:10,625 INFO L131 PetriNetUnfolder]: For 1989/1989 co-relation queries the response was YES. [2022-12-06 05:20:10,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48140 conditions, 23053 events. 17545/23053 cut-off events. For 1989/1989 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 109005 event pairs, 4719 based on Foata normal form. 1/23054 useless extension candidates. Maximal degree in co-relation 37576. Up to 10440 conditions per place. [2022-12-06 05:20:10,734 INFO L137 encePairwiseOnDemand]: 29/38 looper letters, 86 selfloop transitions, 13 changer transitions 12/111 dead transitions. [2022-12-06 05:20:10,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 537 flow [2022-12-06 05:20:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:20:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:20:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-06 05:20:10,746 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5894736842105263 [2022-12-06 05:20:10,747 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 112 flow. Second operand 5 states and 112 transitions. [2022-12-06 05:20:10,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 537 flow [2022-12-06 05:20:10,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 111 transitions, 475 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-12-06 05:20:10,804 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 179 flow [2022-12-06 05:20:10,805 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2022-12-06 05:20:10,808 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2022-12-06 05:20:10,809 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:10,810 INFO L89 Accepts]: Start accepts. Operand has 52 places, 49 transitions, 179 flow [2022-12-06 05:20:10,816 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:10,816 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:10,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 49 transitions, 179 flow [2022-12-06 05:20:10,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 49 transitions, 179 flow [2022-12-06 05:20:10,853 INFO L130 PetriNetUnfolder]: 253/440 cut-off events. [2022-12-06 05:20:10,853 INFO L131 PetriNetUnfolder]: For 98/307 co-relation queries the response was YES. [2022-12-06 05:20:10,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 440 events. 253/440 cut-off events. For 98/307 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1895 event pairs, 152 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 1111. Up to 343 conditions per place. [2022-12-06 05:20:10,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 49 transitions, 179 flow [2022-12-06 05:20:10,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-06 05:20:10,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [675] L86-->thread3EXIT: Formula: (and (= (+ v_~s~0_637 1) v_~s~0_636) (= v_~b~0_239 (ite (= (ite (or (not (= (mod v_~b~0_240 256) 0)) (= v_~x~0_163 1)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork5_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| (ite (<= v_~m3~0_65 v_~s~0_637) 1 0))) InVars {~m3~0=v_~m3~0_65, ~b~0=v_~b~0_240, ~x~0=v_~x~0_163, ~s~0=v_~s~0_637} OutVars{~m3~0=v_~m3~0_65, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_7|, ~b~0=v_~b~0_239, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_7|, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_59|, ~x~0=v_~x~0_163, ~s~0=v_~s~0_636} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~s~0] [2022-12-06 05:20:11,028 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 05:20:11,096 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-06 05:20:11,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:20:11,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 05:20:11,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [699] L45-->thread3EXIT: Formula: (let ((.cse0 (= v_~x~0_226 1))) (and (= |v_thread3Thread1of1ForFork5_#res#1.base_15| 0) (= |v_thread3Thread1of1ForFork5_#res#1.offset_15| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_47| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_47|) .cse0 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| (ite (<= v_~m1~0_99 v_~s~0_747) 1 0)) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_47| (ite (<= v_~m3~0_95 v_~s~0_747) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0)) (= (+ v_~s~0_747 1) v_~s~0_746) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_342 256) 0))) 1 0) 0) 0 1) v_~b~0_341))) InVars {~m3~0=v_~m3~0_95, ~b~0=v_~b~0_342, ~m1~0=v_~m1~0_99, ~s~0=v_~s~0_747} OutVars{~m3~0=v_~m3~0_95, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_15|, ~b~0=v_~b~0_341, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_15|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~m1~0=v_~m1~0_99, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_47|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_47|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_67|, ~x~0=v_~x~0_226, ~s~0=v_~s~0_746, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:20:11,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [700] L45-->thread6EXIT: Formula: (let ((.cse0 (= v_~x~0_228 1))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|) (= (ite (<= v_~m6~0_91 v_~s~0_751) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= (+ v_~s~0_751 1) v_~s~0_750) .cse0 (= |v_thread6Thread1of1ForFork0_#res#1.base_53| 0) (= |v_thread6Thread1of1ForFork0_#res#1.offset_53| 0) (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35| (ite (<= v_~m1~0_101 v_~s~0_751) 1 0)) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (= v_~b~0_345 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_346 256) 0))) 1 0) 0) 0 1)))) InVars {~b~0=v_~b~0_346, ~m6~0=v_~m6~0_91, ~m1~0=v_~m1~0_101, ~s~0=v_~s~0_751} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_53|, ~b~0=v_~b~0_345, ~m6~0=v_~m6~0_91, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_57|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, ~m1~0=v_~m1~0_101, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_53|, ~x~0=v_~x~0_228, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, ~s~0=v_~s~0_750, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, ~x~0, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:20:11,495 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [701] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_230 1))) (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|) (= |v_thread4Thread1of1ForFork2_#res#1.offset_29| 0) (= (+ v_~s~0_755 1) v_~s~0_754) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|) (= (ite (<= v_~m1~0_103 v_~s~0_755) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37| 0)) (= |v_thread4Thread1of1ForFork2_#res#1.base_29| 0) (= (ite (<= v_~m4~0_91 v_~s~0_755) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_45| 0)) (= (ite (= (ite (or (not (= (mod v_~b~0_350 256) 0)) .cse0) 1 0) 0) 0 1) v_~b~0_349) .cse0)) InVars {~b~0=v_~b~0_350, ~m4~0=v_~m4~0_91, ~m1~0=v_~m1~0_103, ~s~0=v_~s~0_755} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_45|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_29|, ~b~0=v_~b~0_349, ~m4~0=v_~m4~0_91, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_59|, ~m1~0=v_~m1~0_103, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_45|, ~x~0=v_~x~0_230, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_29|, ~s~0=v_~s~0_754, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:20:11,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_232 1))) (and (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|) (= (ite (<= v_~m1~0_105 v_~s~0_759) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) .cse0 (= (+ v_~s~0_759 1) v_~s~0_758) (= |v_thread2Thread1of1ForFork3_#res#1.offset_63| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|) (= |v_thread2Thread1of1ForFork3_#res#1.base_63| 0) (= (ite (<= v_~m2~0_103 v_~s~0_759) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_49| 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39| 0)) (= v_~b~0_353 (ite (= (ite (or (not (= 0 (mod v_~b~0_354 256))) .cse0) 1 0) 0) 0 1)))) InVars {~b~0=v_~b~0_354, ~m2~0=v_~m2~0_103, ~m1~0=v_~m1~0_105, ~s~0=v_~s~0_759} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_75|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_49|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_63|, ~b~0=v_~b~0_353, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~m2~0=v_~m2~0_103, ~m1~0=v_~m1~0_105, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_49|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_63|, ~x~0=v_~x~0_232, ~s~0=v_~s~0_758, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:20:11,666 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [703] L45-->thread5EXIT: Formula: (let ((.cse0 (= v_~x~0_234 1))) (and (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m5~0_99 v_~s~0_763) 1 0)) .cse0 (= |v_thread5Thread1of1ForFork4_#res#1.base_39| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| 0)) (= (ite (= (ite (or (not (= (mod v_~b~0_358 256) 0)) .cse0) 1 0) 0) 0 1) v_~b~0_357) (= |v_thread5Thread1of1ForFork4_#res#1.offset_39| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_41| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|) (= (+ v_~s~0_763 1) v_~s~0_762) (= (ite (<= v_~m1~0_107 v_~s~0_763) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|))) InVars {~b~0=v_~b~0_358, ~m5~0=v_~m5~0_99, ~m1~0=v_~m1~0_107, ~s~0=v_~s~0_763} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_41|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_39|, ~b~0=v_~b~0_357, ~m5~0=v_~m5~0_99, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~m1~0=v_~m1~0_107, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_39|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_49|, ~x~0=v_~x~0_234, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_41|, ~s~0=v_~s~0_762, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, ~x~0, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:20:11,758 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:20:11,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 951 [2022-12-06 05:20:11,760 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 193 flow [2022-12-06 05:20:11,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-06 05:20:11,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:11,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:11,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:20:11,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash 294621299, now seen corresponding path program 2 times [2022-12-06 05:20:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:11,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712665706] [2022-12-06 05:20:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:12,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:12,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712665706] [2022-12-06 05:20:12,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712665706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:12,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:12,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:12,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219948761] [2022-12-06 05:20:12,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:12,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:20:12,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:12,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:20:12,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:20:12,324 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:20:12,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 193 flow. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-06 05:20:12,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:12,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:20:12,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:13,727 INFO L130 PetriNetUnfolder]: 15716/20622 cut-off events. [2022-12-06 05:20:13,728 INFO L131 PetriNetUnfolder]: For 11142/11142 co-relation queries the response was YES. [2022-12-06 05:20:13,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60631 conditions, 20622 events. 15716/20622 cut-off events. For 11142/11142 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 96077 event pairs, 2093 based on Foata normal form. 1/20623 useless extension candidates. Maximal degree in co-relation 33501. Up to 10256 conditions per place. [2022-12-06 05:20:13,827 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 86 selfloop transitions, 17 changer transitions 19/122 dead transitions. [2022-12-06 05:20:13,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 122 transitions, 667 flow [2022-12-06 05:20:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:20:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:20:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-06 05:20:13,828 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5488372093023256 [2022-12-06 05:20:13,829 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 193 flow. Second operand 5 states and 118 transitions. [2022-12-06 05:20:13,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 122 transitions, 667 flow [2022-12-06 05:20:13,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 122 transitions, 648 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 05:20:13,840 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 285 flow [2022-12-06 05:20:13,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2022-12-06 05:20:13,841 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2022-12-06 05:20:13,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:13,841 INFO L89 Accepts]: Start accepts. Operand has 56 places, 53 transitions, 285 flow [2022-12-06 05:20:13,842 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:13,842 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:13,842 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 53 transitions, 285 flow [2022-12-06 05:20:13,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 53 transitions, 285 flow [2022-12-06 05:20:13,877 INFO L130 PetriNetUnfolder]: 248/421 cut-off events. [2022-12-06 05:20:13,877 INFO L131 PetriNetUnfolder]: For 949/1659 co-relation queries the response was YES. [2022-12-06 05:20:13,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 421 events. 248/421 cut-off events. For 949/1659 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1700 event pairs, 69 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 1653. Up to 337 conditions per place. [2022-12-06 05:20:13,882 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 53 transitions, 285 flow [2022-12-06 05:20:13,882 INFO L188 LiptonReduction]: Number of co-enabled transitions 654 [2022-12-06 05:20:13,990 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 05:20:14,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [675] L86-->thread3EXIT: Formula: (and (= (+ v_~s~0_637 1) v_~s~0_636) (= v_~b~0_239 (ite (= (ite (or (not (= (mod v_~b~0_240 256) 0)) (= v_~x~0_163 1)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork5_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| (ite (<= v_~m3~0_65 v_~s~0_637) 1 0))) InVars {~m3~0=v_~m3~0_65, ~b~0=v_~b~0_240, ~x~0=v_~x~0_163, ~s~0=v_~s~0_637} OutVars{~m3~0=v_~m3~0_65, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_7|, ~b~0=v_~b~0_239, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_7|, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_59|, ~x~0=v_~x~0_163, ~s~0=v_~s~0_636} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~s~0] [2022-12-06 05:20:14,119 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 05:20:14,181 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-06 05:20:14,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [684] L45-->L52: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) (= v_~x~0_179 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| (ite (<= v_~m1~0_63 v_~s~0_666) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|)) InVars {~m1~0=v_~m1~0_63, ~s~0=v_~s~0_666} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_27|, ~m1~0=v_~m1~0_63, ~x~0=v_~x~0_179, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|, ~s~0=v_~s~0_666} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~x~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:20:14,306 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:14,308 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 466 [2022-12-06 05:20:14,308 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 305 flow [2022-12-06 05:20:14,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-06 05:20:14,308 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:14,308 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:14,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:20:14,308 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:14,309 INFO L85 PathProgramCache]: Analyzing trace with hash 261006528, now seen corresponding path program 1 times [2022-12-06 05:20:14,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:14,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393814667] [2022-12-06 05:20:14,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:14,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:14,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:14,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393814667] [2022-12-06 05:20:14,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393814667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:14,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:14,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:14,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138358429] [2022-12-06 05:20:14,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:14,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:20:14,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:14,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:20:14,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:20:14,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:20:14,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-06 05:20:14,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:14,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:20:14,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:15,590 INFO L130 PetriNetUnfolder]: 12357/16036 cut-off events. [2022-12-06 05:20:15,590 INFO L131 PetriNetUnfolder]: For 36150/36150 co-relation queries the response was YES. [2022-12-06 05:20:15,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60541 conditions, 16036 events. 12357/16036 cut-off events. For 36150/36150 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 70336 event pairs, 2324 based on Foata normal form. 124/16160 useless extension candidates. Maximal degree in co-relation 25973. Up to 15182 conditions per place. [2022-12-06 05:20:15,671 INFO L137 encePairwiseOnDemand]: 31/48 looper letters, 88 selfloop transitions, 24 changer transitions 3/115 dead transitions. [2022-12-06 05:20:15,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 115 transitions, 828 flow [2022-12-06 05:20:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:20:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:20:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-06 05:20:15,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 05:20:15,672 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 305 flow. Second operand 5 states and 112 transitions. [2022-12-06 05:20:15,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 115 transitions, 828 flow [2022-12-06 05:20:15,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 115 transitions, 649 flow, removed 32 selfloop flow, removed 5 redundant places. [2022-12-06 05:20:15,703 INFO L231 Difference]: Finished difference. Result has 57 places, 75 transitions, 410 flow [2022-12-06 05:20:15,703 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=57, PETRI_TRANSITIONS=75} [2022-12-06 05:20:15,704 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2022-12-06 05:20:15,704 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:15,704 INFO L89 Accepts]: Start accepts. Operand has 57 places, 75 transitions, 410 flow [2022-12-06 05:20:15,705 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:15,705 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:15,705 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 75 transitions, 410 flow [2022-12-06 05:20:15,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 75 transitions, 410 flow [2022-12-06 05:20:15,915 INFO L130 PetriNetUnfolder]: 1259/2304 cut-off events. [2022-12-06 05:20:15,915 INFO L131 PetriNetUnfolder]: For 2855/3520 co-relation queries the response was YES. [2022-12-06 05:20:15,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7039 conditions, 2304 events. 1259/2304 cut-off events. For 2855/3520 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 15305 event pairs, 297 based on Foata normal form. 30/2091 useless extension candidates. Maximal degree in co-relation 6591. Up to 1479 conditions per place. [2022-12-06 05:20:15,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 75 transitions, 410 flow [2022-12-06 05:20:15,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 900 [2022-12-06 05:20:15,940 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] L45-->thread3EXIT: Formula: (let ((.cse0 (= v_~x~0_258 1))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51|) (= |v_thread3Thread1of1ForFork5_#res#1.offset_19| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51| (ite (<= v_~m3~0_99 v_~s~0_801) 1 0)) (= (+ v_~s~0_801 1) v_~s~0_800) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_19| 0) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55| (ite (<= v_~m1~0_121 v_~s~0_801) 1 0)) (= v_~b~0_385 (ite (= (ite (or (not (= (mod v_~b~0_386 256) 0)) .cse0) 1 0) 0) 0 1)) .cse0)) InVars {~m3~0=v_~m3~0_99, ~b~0=v_~b~0_386, ~m1~0=v_~m1~0_121, ~s~0=v_~s~0_801} OutVars{~m3~0=v_~m3~0_99, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_19|, ~b~0=v_~b~0_385, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_19|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, ~m1~0=v_~m1~0_121, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_71|, ~x~0=v_~x~0_258, ~s~0=v_~s~0_800, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:20:16,034 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:20:16,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 332 [2022-12-06 05:20:16,036 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 414 flow [2022-12-06 05:20:16,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-06 05:20:16,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:16,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:16,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:20:16,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:16,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:16,037 INFO L85 PathProgramCache]: Analyzing trace with hash -600684432, now seen corresponding path program 2 times [2022-12-06 05:20:16,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:16,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017797656] [2022-12-06 05:20:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:16,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:16,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:16,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017797656] [2022-12-06 05:20:16,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017797656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:16,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:16,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 05:20:16,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519565924] [2022-12-06 05:20:16,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:16,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 05:20:16,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:16,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 05:20:16,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:20:16,307 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:20:16,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 75 transitions, 414 flow. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-06 05:20:16,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:16,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:20:16,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:17,656 INFO L130 PetriNetUnfolder]: 11860/15329 cut-off events. [2022-12-06 05:20:17,656 INFO L131 PetriNetUnfolder]: For 30192/30192 co-relation queries the response was YES. [2022-12-06 05:20:17,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57018 conditions, 15329 events. 11860/15329 cut-off events. For 30192/30192 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 65538 event pairs, 3880 based on Foata normal form. 24/15353 useless extension candidates. Maximal degree in co-relation 23704. Up to 14913 conditions per place. [2022-12-06 05:20:17,739 INFO L137 encePairwiseOnDemand]: 26/48 looper letters, 108 selfloop transitions, 109 changer transitions 0/217 dead transitions. [2022-12-06 05:20:17,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 217 transitions, 1600 flow [2022-12-06 05:20:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:20:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:20:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2022-12-06 05:20:17,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35984848484848486 [2022-12-06 05:20:17,744 INFO L175 Difference]: Start difference. First operand has 56 places, 75 transitions, 414 flow. Second operand 11 states and 190 transitions. [2022-12-06 05:20:17,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 217 transitions, 1600 flow [2022-12-06 05:20:17,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 217 transitions, 1574 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 05:20:17,821 INFO L231 Difference]: Finished difference. Result has 66 places, 168 transitions, 1303 flow [2022-12-06 05:20:17,821 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1303, PETRI_PLACES=66, PETRI_TRANSITIONS=168} [2022-12-06 05:20:17,822 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2022-12-06 05:20:17,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:17,823 INFO L89 Accepts]: Start accepts. Operand has 66 places, 168 transitions, 1303 flow [2022-12-06 05:20:17,827 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:17,827 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:17,827 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 168 transitions, 1303 flow [2022-12-06 05:20:17,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 168 transitions, 1303 flow [2022-12-06 05:20:18,070 INFO L130 PetriNetUnfolder]: 1778/3195 cut-off events. [2022-12-06 05:20:18,070 INFO L131 PetriNetUnfolder]: For 4754/6845 co-relation queries the response was YES. [2022-12-06 05:20:18,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10523 conditions, 3195 events. 1778/3195 cut-off events. For 4754/6845 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 21829 event pairs, 298 based on Foata normal form. 20/2994 useless extension candidates. Maximal degree in co-relation 9921. Up to 1835 conditions per place. [2022-12-06 05:20:18,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 168 transitions, 1303 flow [2022-12-06 05:20:18,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 1238 [2022-12-06 05:20:18,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] and [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] [2022-12-06 05:20:18,124 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] and [535] $Ultimate##0-->L105: Formula: (and (= v_~m4~0_7 v_~t~0_77) (= v_~t~0_76 (+ v_~t~0_77 1))) InVars {~t~0=v_~t~0_77} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_76} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 05:20:18,139 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] and [541] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_69 1) v_~t~0_68) (= v_~m5~0_9 v_~t~0_69)) InVars {~t~0=v_~t~0_69} OutVars{thread5Thread1of1ForFork4_#t~post9#1=|v_thread5Thread1of1ForFork4_#t~post9#1_1|, ~m5~0=v_~m5~0_9, ~t~0=v_~t~0_68} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_#t~post9#1, ~m5~0, ~t~0] [2022-12-06 05:20:18,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] and [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] [2022-12-06 05:20:18,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] and [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] [2022-12-06 05:20:18,271 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 05:20:18,329 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-06 05:20:18,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [658] L143-->thread6EXIT: Formula: (and (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (= (ite (<= v_~m6~0_49 v_~s~0_537) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|) (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29| 0)) (= |v_thread6Thread1of1ForFork0_#res#1.offset_41| 0) (= (+ v_~s~0_537 1) v_~s~0_536) (= |v_thread6Thread1of1ForFork0_#res#1.base_41| 0) (= v_~b~0_165 (ite (= (ite (or (not (= (mod v_~b~0_166 256) 0)) (= v_~x~0_121 1)) 1 0) 0) 0 1))) InVars {~b~0=v_~b~0_166, ~m6~0=v_~m6~0_49, ~x~0=v_~x~0_121, ~s~0=v_~s~0_537} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_41|, ~b~0=v_~b~0_165, ~m6~0=v_~m6~0_49, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_45|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_41|, ~x~0=v_~x~0_121, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_29|, ~s~0=v_~s~0_536} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0] [2022-12-06 05:20:18,440 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [709] L45-->thread5EXIT: Formula: (let ((.cse0 (= v_~x~0_256 1))) (and (= (+ v_~s~0_797 1) v_~s~0_796) (= |v_thread5Thread1of1ForFork4_#res#1.base_43| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_45| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45|) (= (ite (= (ite (or .cse0 (not (= (mod v_~b~0_382 256) 0))) 1 0) 0) 0 1) v_~b~0_381) .cse0 (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| 0)) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_45| 0)) (= |v_thread5Thread1of1ForFork4_#res#1.offset_43| 0) (= (ite (<= v_~m1~0_119 v_~s~0_797) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_53|) (= (ite (<= v_~m5~0_103 v_~s~0_797) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45|))) InVars {~b~0=v_~b~0_382, ~m5~0=v_~m5~0_103, ~m1~0=v_~m1~0_119, ~s~0=v_~s~0_797} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_45|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_43|, ~b~0=v_~b~0_381, ~m5~0=v_~m5~0_103, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, ~m1~0=v_~m1~0_119, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_43|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_53|, ~x~0=v_~x~0_256, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_45|, ~s~0=v_~s~0_796, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_53|} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, ~x~0, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:20:18,518 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [710] L45-->thread3EXIT: Formula: (let ((.cse0 (= v_~x~0_258 1))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51|) (= |v_thread3Thread1of1ForFork5_#res#1.offset_19| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51| (ite (<= v_~m3~0_99 v_~s~0_801) 1 0)) (= (+ v_~s~0_801 1) v_~s~0_800) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_19| 0) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55| (ite (<= v_~m1~0_121 v_~s~0_801) 1 0)) (= v_~b~0_385 (ite (= (ite (or (not (= (mod v_~b~0_386 256) 0)) .cse0) 1 0) 0) 0 1)) .cse0)) InVars {~m3~0=v_~m3~0_99, ~b~0=v_~b~0_386, ~m1~0=v_~m1~0_121, ~s~0=v_~s~0_801} OutVars{~m3~0=v_~m3~0_99, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_19|, ~b~0=v_~b~0_385, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_19|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_55|, ~m1~0=v_~m1~0_121, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_51|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_51|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_71|, ~x~0=v_~x~0_258, ~s~0=v_~s~0_800, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_55|} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:20:18,594 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [712] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_262 1))) (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_33| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (ite (<= v_~m1~0_125 v_~s~0_809) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) .cse0 (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| 0)) (= v_~b~0_393 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_394 256) 0))) 1 0) 0) 0 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (= (ite (<= v_~m4~0_95 v_~s~0_809) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (+ v_~s~0_809 1) v_~s~0_808) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|) (= |v_thread4Thread1of1ForFork2_#res#1.base_33| 0))) InVars {~b~0=v_~b~0_394, ~m4~0=v_~m4~0_95, ~m1~0=v_~m1~0_125, ~s~0=v_~s~0_809} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_33|, ~b~0=v_~b~0_393, ~m4~0=v_~m4~0_95, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_63|, ~m1~0=v_~m1~0_125, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, ~x~0=v_~x~0_262, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_33|, ~s~0=v_~s~0_808, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:20:18,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [675] L86-->thread3EXIT: Formula: (and (= (+ v_~s~0_637 1) v_~s~0_636) (= v_~b~0_239 (ite (= (ite (or (not (= (mod v_~b~0_240 256) 0)) (= v_~x~0_163 1)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork5_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| (ite (<= v_~m3~0_65 v_~s~0_637) 1 0))) InVars {~m3~0=v_~m3~0_65, ~b~0=v_~b~0_240, ~x~0=v_~x~0_163, ~s~0=v_~s~0_637} OutVars{~m3~0=v_~m3~0_65, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_7|, ~b~0=v_~b~0_239, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_7|, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_59|, ~x~0=v_~x~0_163, ~s~0=v_~s~0_636} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~s~0] [2022-12-06 05:20:18,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [711] L45-->thread6EXIT: Formula: (let ((.cse0 (= v_~x~0_260 1))) (and (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= (+ v_~s~0_805 1) v_~s~0_804) (= |v_thread6Thread1of1ForFork0_#res#1.offset_57| 0) .cse0 (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|) (= |v_thread6Thread1of1ForFork0_#res#1.base_57| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57| (ite (<= v_~m1~0_123 v_~s~0_805) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57|) (= v_~b~0_389 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_390 256) 0))) 1 0) 0) 0 1)) (= (ite (<= v_~m6~0_95 v_~s~0_805) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|))) InVars {~b~0=v_~b~0_390, ~m6~0=v_~m6~0_95, ~m1~0=v_~m1~0_123, ~s~0=v_~s~0_805} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_57|, ~b~0=v_~b~0_389, ~m6~0=v_~m6~0_95, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45|, ~m1~0=v_~m1~0_123, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_57|, ~x~0=v_~x~0_260, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|, ~s~0=v_~s~0_804, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57|} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, ~x~0, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:20:18,804 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:20:18,805 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 982 [2022-12-06 05:20:18,805 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 167 transitions, 1335 flow [2022-12-06 05:20:18,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-06 05:20:18,805 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:18,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:18,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:20:18,805 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:18,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:18,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1389034247, now seen corresponding path program 1 times [2022-12-06 05:20:18,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:18,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148248831] [2022-12-06 05:20:18,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:18,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:18,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148248831] [2022-12-06 05:20:18,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148248831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:18,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:18,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:18,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905897710] [2022-12-06 05:20:18,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:18,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:20:18,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:18,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:20:18,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:20:18,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:20:18,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 167 transitions, 1335 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-12-06 05:20:18,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:18,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:20:18,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:20,190 INFO L130 PetriNetUnfolder]: 12035/15532 cut-off events. [2022-12-06 05:20:20,190 INFO L131 PetriNetUnfolder]: For 35340/35340 co-relation queries the response was YES. [2022-12-06 05:20:20,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63661 conditions, 15532 events. 12035/15532 cut-off events. For 35340/35340 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 66719 event pairs, 3040 based on Foata normal form. 80/15612 useless extension candidates. Maximal degree in co-relation 26533. Up to 15045 conditions per place. [2022-12-06 05:20:20,280 INFO L137 encePairwiseOnDemand]: 29/61 looper letters, 110 selfloop transitions, 131 changer transitions 2/243 dead transitions. [2022-12-06 05:20:20,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 243 transitions, 2407 flow [2022-12-06 05:20:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:20:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:20:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-12-06 05:20:20,283 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 05:20:20,283 INFO L175 Difference]: Start difference. First operand has 65 places, 167 transitions, 1335 flow. Second operand 5 states and 122 transitions. [2022-12-06 05:20:20,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 243 transitions, 2407 flow [2022-12-06 05:20:20,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 243 transitions, 2256 flow, removed 70 selfloop flow, removed 2 redundant places. [2022-12-06 05:20:20,381 INFO L231 Difference]: Finished difference. Result has 68 places, 208 transitions, 1973 flow [2022-12-06 05:20:20,382 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1973, PETRI_PLACES=68, PETRI_TRANSITIONS=208} [2022-12-06 05:20:20,383 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2022-12-06 05:20:20,383 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:20,384 INFO L89 Accepts]: Start accepts. Operand has 68 places, 208 transitions, 1973 flow [2022-12-06 05:20:20,387 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:20,387 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:20,387 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 208 transitions, 1973 flow [2022-12-06 05:20:20,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 208 transitions, 1973 flow [2022-12-06 05:20:20,521 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0][65], [Black: 256#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) ~m6~0)), 33#$Ultimate##0true, 77#thread2EXITtrue, Black: 227#(and (= ~t~0 0) (= ~s~0 0)), 102#thread4EXITtrue, 47#L45true, Black: 231#(and (<= (+ ~m1~0 1) ~t~0) (= ~m1~0 0) (<= (+ ~m1~0 1) ~m2~0) (= ~s~0 0)), 117#L181-4true, 234#true, 209#(and (= ~x~0 0) (<= ~b~0 0) (<= 0 ~b~0)), 225#true, Black: 243#(and (<= (+ ~s~0 ~m1~0 4) ~m2~0) (= ~m1~0 0)), 250#true, 76#L86true, 121#thread6EXITtrue, Black: 216#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)))]) [2022-12-06 05:20:20,521 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 05:20:20,521 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:20:20,521 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:20:20,521 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:20:20,521 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([706] L45-->thread1EXIT: Formula: (and (= v_~b~0_369 1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_61| 0) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (= |v_thread1Thread1of1ForFork1_#res#1.base_61| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_31| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_31| 0) (= (+ 2 v_~s~0_780) v_~s~0_778) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47| (ite (<= v_~m1~0_113 v_~s~0_780) 1 0)) (= v_~x~0_244 0) (= (ite (<= v_~m4~0_93 v_~s~0_780) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|)) InVars {~m4~0=v_~m4~0_93, ~m1~0=v_~m1~0_113, ~s~0=v_~s~0_780} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_63|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_31|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|, ~b~0=v_~b~0_369, ~m4~0=v_~m4~0_93, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_61|, ~m1~0=v_~m1~0_113, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_61|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_61|, ~x~0=v_~x~0_244, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_31|, ~s~0=v_~s~0_778, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][67], [60#thread1EXITtrue, Black: 256#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) ~m6~0)), 33#$Ultimate##0true, 77#thread2EXITtrue, Black: 227#(and (= ~t~0 0) (= ~s~0 0)), 102#thread4EXITtrue, Black: 231#(and (<= (+ ~m1~0 1) ~t~0) (= ~m1~0 0) (<= (+ ~m1~0 1) ~m2~0) (= ~s~0 0)), 117#L181-4true, 234#true, 225#true, Black: 243#(and (<= (+ ~s~0 ~m1~0 4) ~m2~0) (= ~m1~0 0)), 250#true, 76#L86true, 121#thread6EXITtrue, Black: 216#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)))]) [2022-12-06 05:20:20,521 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 05:20:20,521 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:20:20,522 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:20:20,522 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:20:20,522 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0][91], [Black: 256#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) ~m6~0)), 111#$Ultimate##0true, 77#thread2EXITtrue, Black: 227#(and (= ~t~0 0) (= ~s~0 0)), Black: 231#(and (<= (+ ~m1~0 1) ~t~0) (= ~m1~0 0) (<= (+ ~m1~0 1) ~m2~0) (= ~s~0 0)), 47#L45true, 234#true, 117#L181-4true, 209#(and (= ~x~0 0) (<= ~b~0 0) (<= 0 ~b~0)), 225#true, 250#true, Black: 243#(and (<= (+ ~s~0 ~m1~0 4) ~m2~0) (= ~m1~0 0)), 76#L86true, 11#thread5EXITtrue, 121#thread6EXITtrue, Black: 216#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)))]) [2022-12-06 05:20:20,522 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 05:20:20,522 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:20:20,522 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:20:20,522 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:20:20,522 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([708] L45-->thread1EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|) (= (ite (<= v_~m1~0_117 v_~s~0_792) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (= (+ 2 v_~s~0_792) v_~s~0_790) (= |v_thread1Thread1of1ForFork1_#res#1.offset_65| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_65| 0) (= |v_thread5Thread1of1ForFork4_#res#1.base_41| 0) (= v_~x~0_252 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m5~0_101 v_~s~0_792) 1 0)) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|) (= v_~b~0_377 1) (= |v_thread5Thread1of1ForFork4_#res#1.offset_41| 0)) InVars {~m5~0=v_~m5~0_101, ~m1~0=v_~m1~0_117, ~s~0=v_~s~0_792} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_67|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_41|, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_41|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_51|, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43|, thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|, ~b~0=v_~b~0_377, ~m5~0=v_~m5~0_101, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, ~m1~0=v_~m1~0_117, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_65|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_65|, ~x~0=v_~x~0_252, ~s~0=v_~s~0_790, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread5Thread1of1ForFork4_#res#1.offset, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][93], [60#thread1EXITtrue, Black: 256#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ 2 ~s~0) ~m6~0)), 111#$Ultimate##0true, 77#thread2EXITtrue, Black: 227#(and (= ~t~0 0) (= ~s~0 0)), Black: 231#(and (<= (+ ~m1~0 1) ~t~0) (= ~m1~0 0) (<= (+ ~m1~0 1) ~m2~0) (= ~s~0 0)), 117#L181-4true, 234#true, 225#true, Black: 243#(and (<= (+ ~s~0 ~m1~0 4) ~m2~0) (= ~m1~0 0)), 250#true, 76#L86true, 11#thread5EXITtrue, 121#thread6EXITtrue, Black: 216#(and (= ~x~0 0) (= ~b~0 (* (div ~b~0 256) 256)))]) [2022-12-06 05:20:20,522 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 05:20:20,523 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:20:20,523 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 05:20:20,523 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 05:20:20,569 INFO L130 PetriNetUnfolder]: 1717/2900 cut-off events. [2022-12-06 05:20:20,569 INFO L131 PetriNetUnfolder]: For 3577/5113 co-relation queries the response was YES. [2022-12-06 05:20:20,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8695 conditions, 2900 events. 1717/2900 cut-off events. For 3577/5113 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 17781 event pairs, 290 based on Foata normal form. 20/2560 useless extension candidates. Maximal degree in co-relation 8252. Up to 1646 conditions per place. [2022-12-06 05:20:20,596 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 208 transitions, 1973 flow [2022-12-06 05:20:20,596 INFO L188 LiptonReduction]: Number of co-enabled transitions 1298 [2022-12-06 05:20:20,599 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:20:20,599 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-06 05:20:20,599 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 208 transitions, 1973 flow [2022-12-06 05:20:20,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-12-06 05:20:20,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:20,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:20,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:20:20,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:20,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1918834542, now seen corresponding path program 1 times [2022-12-06 05:20:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:20,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112485857] [2022-12-06 05:20:20,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:20,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:20,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112485857] [2022-12-06 05:20:20,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112485857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:20,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:20,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:20:20,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872576650] [2022-12-06 05:20:20,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:20,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:20:20,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:20,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:20:20,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:20:20,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:20:20,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 208 transitions, 1973 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:20,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:20,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:20:20,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:22,896 INFO L130 PetriNetUnfolder]: 19935/25520 cut-off events. [2022-12-06 05:20:22,897 INFO L131 PetriNetUnfolder]: For 43815/43815 co-relation queries the response was YES. [2022-12-06 05:20:22,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95518 conditions, 25520 events. 19935/25520 cut-off events. For 43815/43815 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 115943 event pairs, 3848 based on Foata normal form. 260/25780 useless extension candidates. Maximal degree in co-relation 85954. Up to 18799 conditions per place. [2022-12-06 05:20:23,038 INFO L137 encePairwiseOnDemand]: 27/61 looper letters, 141 selfloop transitions, 222 changer transitions 0/363 dead transitions. [2022-12-06 05:20:23,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 363 transitions, 3851 flow [2022-12-06 05:20:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:20:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:20:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2022-12-06 05:20:23,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4808743169398907 [2022-12-06 05:20:23,039 INFO L175 Difference]: Start difference. First operand has 67 places, 208 transitions, 1973 flow. Second operand 6 states and 176 transitions. [2022-12-06 05:20:23,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 363 transitions, 3851 flow [2022-12-06 05:20:23,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 363 transitions, 3679 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:20:23,164 INFO L231 Difference]: Finished difference. Result has 72 places, 301 transitions, 3511 flow [2022-12-06 05:20:23,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=1847, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3511, PETRI_PLACES=72, PETRI_TRANSITIONS=301} [2022-12-06 05:20:23,164 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2022-12-06 05:20:23,164 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:23,164 INFO L89 Accepts]: Start accepts. Operand has 72 places, 301 transitions, 3511 flow [2022-12-06 05:20:23,166 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:23,166 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:23,166 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 301 transitions, 3511 flow [2022-12-06 05:20:23,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 301 transitions, 3511 flow [2022-12-06 05:20:23,625 INFO L130 PetriNetUnfolder]: 4722/7005 cut-off events. [2022-12-06 05:20:23,625 INFO L131 PetriNetUnfolder]: For 16569/22183 co-relation queries the response was YES. [2022-12-06 05:20:23,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28120 conditions, 7005 events. 4722/7005 cut-off events. For 16569/22183 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 41037 event pairs, 674 based on Foata normal form. 42/6629 useless extension candidates. Maximal degree in co-relation 27417. Up to 4034 conditions per place. [2022-12-06 05:20:23,683 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 301 transitions, 3511 flow [2022-12-06 05:20:23,683 INFO L188 LiptonReduction]: Number of co-enabled transitions 1954 [2022-12-06 05:20:23,688 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:20:23,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 524 [2022-12-06 05:20:23,688 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 301 transitions, 3511 flow [2022-12-06 05:20:23,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:23,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:23,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:23,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:20:23,689 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:23,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:23,689 INFO L85 PathProgramCache]: Analyzing trace with hash 396203711, now seen corresponding path program 1 times [2022-12-06 05:20:23,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:23,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745324953] [2022-12-06 05:20:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:23,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:23,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745324953] [2022-12-06 05:20:23,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745324953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:23,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:23,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:20:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433669742] [2022-12-06 05:20:23,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:23,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:20:23,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:23,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:20:23,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:20:23,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:20:23,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 301 transitions, 3511 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:23,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:23,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:20:23,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:27,215 INFO L130 PetriNetUnfolder]: 25797/33100 cut-off events. [2022-12-06 05:20:27,216 INFO L131 PetriNetUnfolder]: For 93455/93455 co-relation queries the response was YES. [2022-12-06 05:20:27,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155823 conditions, 33100 events. 25797/33100 cut-off events. For 93455/93455 co-relation queries the response was YES. Maximal size of possible extension queue 1329. Compared 157131 event pairs, 4022 based on Foata normal form. 348/33448 useless extension candidates. Maximal degree in co-relation 133053. Up to 19633 conditions per place. [2022-12-06 05:20:27,418 INFO L137 encePairwiseOnDemand]: 29/61 looper letters, 159 selfloop transitions, 440 changer transitions 0/599 dead transitions. [2022-12-06 05:20:27,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 599 transitions, 7592 flow [2022-12-06 05:20:27,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:20:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:20:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2022-12-06 05:20:27,419 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4371584699453552 [2022-12-06 05:20:27,419 INFO L175 Difference]: Start difference. First operand has 72 places, 301 transitions, 3511 flow. Second operand 9 states and 240 transitions. [2022-12-06 05:20:27,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 599 transitions, 7592 flow [2022-12-06 05:20:28,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 599 transitions, 7345 flow, removed 118 selfloop flow, removed 1 redundant places. [2022-12-06 05:20:28,155 INFO L231 Difference]: Finished difference. Result has 81 places, 526 transitions, 7256 flow [2022-12-06 05:20:28,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=3430, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7256, PETRI_PLACES=81, PETRI_TRANSITIONS=526} [2022-12-06 05:20:28,156 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2022-12-06 05:20:28,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:28,156 INFO L89 Accepts]: Start accepts. Operand has 81 places, 526 transitions, 7256 flow [2022-12-06 05:20:28,160 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:28,160 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:28,160 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 526 transitions, 7256 flow [2022-12-06 05:20:28,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 526 transitions, 7256 flow [2022-12-06 05:20:29,006 INFO L130 PetriNetUnfolder]: 6802/9718 cut-off events. [2022-12-06 05:20:29,007 INFO L131 PetriNetUnfolder]: For 30476/44957 co-relation queries the response was YES. [2022-12-06 05:20:29,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47504 conditions, 9718 events. 6802/9718 cut-off events. For 30476/44957 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 56849 event pairs, 749 based on Foata normal form. 45/9285 useless extension candidates. Maximal degree in co-relation 46758. Up to 5425 conditions per place. [2022-12-06 05:20:29,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 526 transitions, 7256 flow [2022-12-06 05:20:29,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 2900 [2022-12-06 05:20:29,116 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:20:29,117 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 961 [2022-12-06 05:20:29,117 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 526 transitions, 7256 flow [2022-12-06 05:20:29,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:29,117 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:29,117 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:29,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:20:29,117 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:29,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:29,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1930979095, now seen corresponding path program 2 times [2022-12-06 05:20:29,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:29,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127527548] [2022-12-06 05:20:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:29,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:29,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:29,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127527548] [2022-12-06 05:20:29,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127527548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:29,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:29,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:29,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907652682] [2022-12-06 05:20:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:29,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:20:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:29,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:20:29,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:20:29,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:20:29,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 526 transitions, 7256 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:29,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:29,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:20:29,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:32,300 INFO L130 PetriNetUnfolder]: 26012/33427 cut-off events. [2022-12-06 05:20:32,300 INFO L131 PetriNetUnfolder]: For 130855/130855 co-relation queries the response was YES. [2022-12-06 05:20:32,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184255 conditions, 33427 events. 26012/33427 cut-off events. For 130855/130855 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 159268 event pairs, 4285 based on Foata normal form. 356/33783 useless extension candidates. Maximal degree in co-relation 156578. Up to 32621 conditions per place. [2022-12-06 05:20:32,568 INFO L137 encePairwiseOnDemand]: 34/61 looper letters, 285 selfloop transitions, 380 changer transitions 0/665 dead transitions. [2022-12-06 05:20:32,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 665 transitions, 10603 flow [2022-12-06 05:20:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:20:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:20:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2022-12-06 05:20:32,570 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3901639344262295 [2022-12-06 05:20:32,570 INFO L175 Difference]: Start difference. First operand has 81 places, 526 transitions, 7256 flow. Second operand 5 states and 119 transitions. [2022-12-06 05:20:32,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 665 transitions, 10603 flow [2022-12-06 05:20:33,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 665 transitions, 10494 flow, removed 49 selfloop flow, removed 1 redundant places. [2022-12-06 05:20:33,293 INFO L231 Difference]: Finished difference. Result has 84 places, 628 transitions, 9764 flow [2022-12-06 05:20:33,294 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=6937, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9764, PETRI_PLACES=84, PETRI_TRANSITIONS=628} [2022-12-06 05:20:33,296 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2022-12-06 05:20:33,296 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:33,296 INFO L89 Accepts]: Start accepts. Operand has 84 places, 628 transitions, 9764 flow [2022-12-06 05:20:33,300 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:33,300 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:33,300 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 628 transitions, 9764 flow [2022-12-06 05:20:33,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 628 transitions, 9764 flow [2022-12-06 05:20:34,223 INFO L130 PetriNetUnfolder]: 6839/9796 cut-off events. [2022-12-06 05:20:34,223 INFO L131 PetriNetUnfolder]: For 30104/43208 co-relation queries the response was YES. [2022-12-06 05:20:34,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45302 conditions, 9796 events. 6839/9796 cut-off events. For 30104/43208 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 56926 event pairs, 767 based on Foata normal form. 45/9353 useless extension candidates. Maximal degree in co-relation 44555. Up to 4484 conditions per place. [2022-12-06 05:20:34,316 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 628 transitions, 9764 flow [2022-12-06 05:20:34,316 INFO L188 LiptonReduction]: Number of co-enabled transitions 3224 [2022-12-06 05:20:34,322 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:20:34,323 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1027 [2022-12-06 05:20:34,323 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 628 transitions, 9764 flow [2022-12-06 05:20:34,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:34,323 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:34,323 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:34,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:20:34,323 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:34,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1193440958, now seen corresponding path program 2 times [2022-12-06 05:20:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:34,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123367258] [2022-12-06 05:20:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:34,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:34,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123367258] [2022-12-06 05:20:34,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123367258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:34,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:34,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:34,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251895431] [2022-12-06 05:20:34,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:34,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:20:34,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:34,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:20:34,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:20:34,466 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:20:34,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 628 transitions, 9764 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:34,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:34,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:20:34,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:37,761 INFO L130 PetriNetUnfolder]: 26012/33481 cut-off events. [2022-12-06 05:20:37,761 INFO L131 PetriNetUnfolder]: For 120169/120169 co-relation queries the response was YES. [2022-12-06 05:20:37,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176027 conditions, 33481 events. 26012/33481 cut-off events. For 120169/120169 co-relation queries the response was YES. Maximal size of possible extension queue 1316. Compared 160274 event pairs, 3982 based on Foata normal form. 244/33725 useless extension candidates. Maximal degree in co-relation 150673. Up to 32467 conditions per place. [2022-12-06 05:20:37,974 INFO L137 encePairwiseOnDemand]: 29/61 looper letters, 279 selfloop transitions, 418 changer transitions 0/697 dead transitions. [2022-12-06 05:20:37,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 697 transitions, 11984 flow [2022-12-06 05:20:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:20:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:20:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2022-12-06 05:20:37,975 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39344262295081966 [2022-12-06 05:20:37,975 INFO L175 Difference]: Start difference. First operand has 84 places, 628 transitions, 9764 flow. Second operand 5 states and 120 transitions. [2022-12-06 05:20:37,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 697 transitions, 11984 flow [2022-12-06 05:20:38,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 697 transitions, 11569 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:20:38,296 INFO L231 Difference]: Finished difference. Result has 87 places, 662 transitions, 11101 flow [2022-12-06 05:20:38,297 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=9013, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11101, PETRI_PLACES=87, PETRI_TRANSITIONS=662} [2022-12-06 05:20:38,297 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2022-12-06 05:20:38,297 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:38,297 INFO L89 Accepts]: Start accepts. Operand has 87 places, 662 transitions, 11101 flow [2022-12-06 05:20:38,299 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:38,299 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:38,299 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 662 transitions, 11101 flow [2022-12-06 05:20:38,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 662 transitions, 11101 flow [2022-12-06 05:20:39,200 INFO L130 PetriNetUnfolder]: 6819/9752 cut-off events. [2022-12-06 05:20:39,200 INFO L131 PetriNetUnfolder]: For 32849/46706 co-relation queries the response was YES. [2022-12-06 05:20:39,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45557 conditions, 9752 events. 6819/9752 cut-off events. For 32849/46706 co-relation queries the response was YES. Maximal size of possible extension queue 831. Compared 56545 event pairs, 733 based on Foata normal form. 45/9331 useless extension candidates. Maximal degree in co-relation 44853. Up to 4453 conditions per place. [2022-12-06 05:20:39,290 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 662 transitions, 11101 flow [2022-12-06 05:20:39,290 INFO L188 LiptonReduction]: Number of co-enabled transitions 3324 [2022-12-06 05:20:39,295 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:20:39,296 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 999 [2022-12-06 05:20:39,296 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 662 transitions, 11101 flow [2022-12-06 05:20:39,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:39,296 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:39,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:39,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:20:39,296 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:39,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1626210604, now seen corresponding path program 1 times [2022-12-06 05:20:39,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:39,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2214152] [2022-12-06 05:20:39,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:39,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:39,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2214152] [2022-12-06 05:20:39,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2214152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:39,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:39,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:20:39,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51840645] [2022-12-06 05:20:39,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:39,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:39,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:39,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:39,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:39,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:20:39,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 662 transitions, 11101 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:39,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:39,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:20:39,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:42,836 INFO L130 PetriNetUnfolder]: 25645/33110 cut-off events. [2022-12-06 05:20:42,836 INFO L131 PetriNetUnfolder]: For 125039/125039 co-relation queries the response was YES. [2022-12-06 05:20:42,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174113 conditions, 33110 events. 25645/33110 cut-off events. For 125039/125039 co-relation queries the response was YES. Maximal size of possible extension queue 1331. Compared 160060 event pairs, 4087 based on Foata normal form. 276/33386 useless extension candidates. Maximal degree in co-relation 148840. Up to 32863 conditions per place. [2022-12-06 05:20:43,073 INFO L137 encePairwiseOnDemand]: 46/61 looper letters, 610 selfloop transitions, 10 changer transitions 26/646 dead transitions. [2022-12-06 05:20:43,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 646 transitions, 11506 flow [2022-12-06 05:20:43,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-06 05:20:43,074 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36885245901639346 [2022-12-06 05:20:43,074 INFO L175 Difference]: Start difference. First operand has 87 places, 662 transitions, 11101 flow. Second operand 4 states and 90 transitions. [2022-12-06 05:20:43,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 646 transitions, 11506 flow [2022-12-06 05:20:43,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 646 transitions, 11165 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:20:43,458 INFO L231 Difference]: Finished difference. Result has 89 places, 611 transitions, 9760 flow [2022-12-06 05:20:43,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=9655, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9760, PETRI_PLACES=89, PETRI_TRANSITIONS=611} [2022-12-06 05:20:43,459 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2022-12-06 05:20:43,459 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:43,459 INFO L89 Accepts]: Start accepts. Operand has 89 places, 611 transitions, 9760 flow [2022-12-06 05:20:43,461 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:43,461 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:43,461 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 611 transitions, 9760 flow [2022-12-06 05:20:43,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 611 transitions, 9760 flow [2022-12-06 05:20:44,288 INFO L130 PetriNetUnfolder]: 6660/9562 cut-off events. [2022-12-06 05:20:44,289 INFO L131 PetriNetUnfolder]: For 31111/40824 co-relation queries the response was YES. [2022-12-06 05:20:44,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43896 conditions, 9562 events. 6660/9562 cut-off events. For 31111/40824 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 55661 event pairs, 739 based on Foata normal form. 45/9150 useless extension candidates. Maximal degree in co-relation 43171. Up to 4345 conditions per place. [2022-12-06 05:20:44,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 611 transitions, 9760 flow [2022-12-06 05:20:44,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 3126 [2022-12-06 05:20:44,371 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:20:44,371 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 912 [2022-12-06 05:20:44,371 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 611 transitions, 9760 flow [2022-12-06 05:20:44,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:44,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:44,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:44,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:20:44,372 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:44,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash 733317168, now seen corresponding path program 1 times [2022-12-06 05:20:44,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:44,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622114943] [2022-12-06 05:20:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:44,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:44,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:44,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622114943] [2022-12-06 05:20:44,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622114943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:44,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:44,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:20:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891325836] [2022-12-06 05:20:44,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:44,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:20:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:44,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:20:44,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:20:44,499 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 60 [2022-12-06 05:20:44,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 611 transitions, 9760 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:44,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:44,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 60 [2022-12-06 05:20:44,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:47,328 INFO L130 PetriNetUnfolder]: 22883/29600 cut-off events. [2022-12-06 05:20:47,328 INFO L131 PetriNetUnfolder]: For 111069/111069 co-relation queries the response was YES. [2022-12-06 05:20:47,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152281 conditions, 29600 events. 22883/29600 cut-off events. For 111069/111069 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 141966 event pairs, 3967 based on Foata normal form. 268/29868 useless extension candidates. Maximal degree in co-relation 133819. Up to 29361 conditions per place. [2022-12-06 05:20:47,582 INFO L137 encePairwiseOnDemand]: 42/60 looper letters, 511 selfloop transitions, 78 changer transitions 0/589 dead transitions. [2022-12-06 05:20:47,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 589 transitions, 10039 flow [2022-12-06 05:20:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:20:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:20:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-06 05:20:47,583 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2022-12-06 05:20:47,583 INFO L175 Difference]: Start difference. First operand has 88 places, 611 transitions, 9760 flow. Second operand 4 states and 89 transitions. [2022-12-06 05:20:47,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 589 transitions, 10039 flow [2022-12-06 05:20:47,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 589 transitions, 9903 flow, removed 58 selfloop flow, removed 3 redundant places. [2022-12-06 05:20:47,874 INFO L231 Difference]: Finished difference. Result has 89 places, 557 transitions, 8823 flow [2022-12-06 05:20:47,874 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=7741, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=8823, PETRI_PLACES=89, PETRI_TRANSITIONS=557} [2022-12-06 05:20:47,875 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2022-12-06 05:20:47,875 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:47,875 INFO L89 Accepts]: Start accepts. Operand has 89 places, 557 transitions, 8823 flow [2022-12-06 05:20:47,876 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:47,876 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:47,877 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 557 transitions, 8823 flow [2022-12-06 05:20:47,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 557 transitions, 8823 flow [2022-12-06 05:20:48,751 INFO L130 PetriNetUnfolder]: 5808/8488 cut-off events. [2022-12-06 05:20:48,752 INFO L131 PetriNetUnfolder]: For 26357/31755 co-relation queries the response was YES. [2022-12-06 05:20:48,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38213 conditions, 8488 events. 5808/8488 cut-off events. For 26357/31755 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 50125 event pairs, 684 based on Foata normal form. 45/8106 useless extension candidates. Maximal degree in co-relation 37506. Up to 3799 conditions per place. [2022-12-06 05:20:48,835 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 557 transitions, 8823 flow [2022-12-06 05:20:48,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 2854 [2022-12-06 05:20:48,841 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:20:48,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 966 [2022-12-06 05:20:48,841 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 557 transitions, 8823 flow [2022-12-06 05:20:48,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:48,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:48,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:48,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:20:48,842 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:48,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2067901108, now seen corresponding path program 1 times [2022-12-06 05:20:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:48,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879925716] [2022-12-06 05:20:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:48,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:49,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:49,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879925716] [2022-12-06 05:20:49,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879925716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:49,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:49,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:20:49,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979347689] [2022-12-06 05:20:49,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:49,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:20:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:20:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:20:49,016 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:20:49,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 557 transitions, 8823 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:49,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:49,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:20:49,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:52,515 INFO L130 PetriNetUnfolder]: 25594/33253 cut-off events. [2022-12-06 05:20:52,515 INFO L131 PetriNetUnfolder]: For 121983/121983 co-relation queries the response was YES. [2022-12-06 05:20:52,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173484 conditions, 33253 events. 25594/33253 cut-off events. For 121983/121983 co-relation queries the response was YES. Maximal size of possible extension queue 1393. Compared 164655 event pairs, 4504 based on Foata normal form. 1218/34471 useless extension candidates. Maximal degree in co-relation 153626. Up to 24587 conditions per place. [2022-12-06 05:20:52,796 INFO L137 encePairwiseOnDemand]: 28/58 looper letters, 239 selfloop transitions, 613 changer transitions 0/852 dead transitions. [2022-12-06 05:20:52,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 852 transitions, 13773 flow [2022-12-06 05:20:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:20:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:20:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 226 transitions. [2022-12-06 05:20:52,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2022-12-06 05:20:52,797 INFO L175 Difference]: Start difference. First operand has 89 places, 557 transitions, 8823 flow. Second operand 8 states and 226 transitions. [2022-12-06 05:20:52,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 852 transitions, 13773 flow [2022-12-06 05:20:53,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 852 transitions, 13686 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:20:53,205 INFO L231 Difference]: Finished difference. Result has 95 places, 743 transitions, 12947 flow [2022-12-06 05:20:53,206 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=8736, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=427, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12947, PETRI_PLACES=95, PETRI_TRANSITIONS=743} [2022-12-06 05:20:53,206 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2022-12-06 05:20:53,206 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:53,206 INFO L89 Accepts]: Start accepts. Operand has 95 places, 743 transitions, 12947 flow [2022-12-06 05:20:53,208 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:53,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:53,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 743 transitions, 12947 flow [2022-12-06 05:20:53,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 743 transitions, 12947 flow [2022-12-06 05:20:54,124 INFO L130 PetriNetUnfolder]: 6677/9775 cut-off events. [2022-12-06 05:20:54,124 INFO L131 PetriNetUnfolder]: For 38459/45004 co-relation queries the response was YES. [2022-12-06 05:20:54,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50227 conditions, 9775 events. 6677/9775 cut-off events. For 38459/45004 co-relation queries the response was YES. Maximal size of possible extension queue 841. Compared 59213 event pairs, 773 based on Foata normal form. 47/9354 useless extension candidates. Maximal degree in co-relation 49451. Up to 4422 conditions per place. [2022-12-06 05:20:54,222 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 743 transitions, 12947 flow [2022-12-06 05:20:54,222 INFO L188 LiptonReduction]: Number of co-enabled transitions 3626 [2022-12-06 05:20:54,229 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:20:54,230 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1024 [2022-12-06 05:20:54,230 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 743 transitions, 12947 flow [2022-12-06 05:20:54,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:54,230 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:54,230 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:54,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:20:54,230 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:54,230 INFO L85 PathProgramCache]: Analyzing trace with hash -4460429, now seen corresponding path program 1 times [2022-12-06 05:20:54,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:54,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828915066] [2022-12-06 05:20:54,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:54,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:54,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:54,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828915066] [2022-12-06 05:20:54,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828915066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:54,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:54,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:20:54,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101328992] [2022-12-06 05:20:54,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:54,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:20:54,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:54,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:20:54,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:20:54,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:20:54,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 743 transitions, 12947 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:54,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:54,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:20:54,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:20:57,470 INFO L130 PetriNetUnfolder]: 20903/27370 cut-off events. [2022-12-06 05:20:57,470 INFO L131 PetriNetUnfolder]: For 124719/124719 co-relation queries the response was YES. [2022-12-06 05:20:57,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147389 conditions, 27370 events. 20903/27370 cut-off events. For 124719/124719 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 134445 event pairs, 4145 based on Foata normal form. 604/27974 useless extension candidates. Maximal degree in co-relation 146375. Up to 26530 conditions per place. [2022-12-06 05:20:57,678 INFO L137 encePairwiseOnDemand]: 36/58 looper letters, 333 selfloop transitions, 195 changer transitions 12/540 dead transitions. [2022-12-06 05:20:57,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 540 transitions, 8939 flow [2022-12-06 05:20:57,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:20:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:20:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-06 05:20:57,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36551724137931035 [2022-12-06 05:20:57,679 INFO L175 Difference]: Start difference. First operand has 95 places, 743 transitions, 12947 flow. Second operand 5 states and 106 transitions. [2022-12-06 05:20:57,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 540 transitions, 8939 flow [2022-12-06 05:20:57,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 540 transitions, 8470 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-06 05:20:57,982 INFO L231 Difference]: Finished difference. Result has 95 places, 505 transitions, 7607 flow [2022-12-06 05:20:57,983 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=6774, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7607, PETRI_PLACES=95, PETRI_TRANSITIONS=505} [2022-12-06 05:20:57,983 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2022-12-06 05:20:57,983 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:20:57,983 INFO L89 Accepts]: Start accepts. Operand has 95 places, 505 transitions, 7607 flow [2022-12-06 05:20:57,985 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:20:57,985 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:20:57,985 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 505 transitions, 7607 flow [2022-12-06 05:20:57,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 505 transitions, 7607 flow [2022-12-06 05:20:58,569 INFO L130 PetriNetUnfolder]: 5277/7793 cut-off events. [2022-12-06 05:20:58,570 INFO L131 PetriNetUnfolder]: For 23769/25786 co-relation queries the response was YES. [2022-12-06 05:20:58,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35400 conditions, 7793 events. 5277/7793 cut-off events. For 23769/25786 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 46816 event pairs, 683 based on Foata normal form. 36/7415 useless extension candidates. Maximal degree in co-relation 34755. Up to 3540 conditions per place. [2022-12-06 05:20:58,646 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 505 transitions, 7607 flow [2022-12-06 05:20:58,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 2470 [2022-12-06 05:20:58,651 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:20:58,651 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 668 [2022-12-06 05:20:58,651 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 505 transitions, 7607 flow [2022-12-06 05:20:58,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:58,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:20:58,652 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:20:58,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:20:58,652 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:20:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:20:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1902372427, now seen corresponding path program 1 times [2022-12-06 05:20:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:20:58,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820487611] [2022-12-06 05:20:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:20:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:20:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:20:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:20:58,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:20:58,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820487611] [2022-12-06 05:20:58,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820487611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:20:58,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:20:58,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:20:58,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827016909] [2022-12-06 05:20:58,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:20:58,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:20:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:20:58,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:20:58,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:20:58,828 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:20:58,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 505 transitions, 7607 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:20:58,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:20:58,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:20:58,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:01,738 INFO L130 PetriNetUnfolder]: 21156/27539 cut-off events. [2022-12-06 05:21:01,739 INFO L131 PetriNetUnfolder]: For 98804/98804 co-relation queries the response was YES. [2022-12-06 05:21:01,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143106 conditions, 27539 events. 21156/27539 cut-off events. For 98804/98804 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 133358 event pairs, 4926 based on Foata normal form. 200/27739 useless extension candidates. Maximal degree in co-relation 131052. Up to 17579 conditions per place. [2022-12-06 05:21:01,907 INFO L137 encePairwiseOnDemand]: 30/53 looper letters, 126 selfloop transitions, 514 changer transitions 0/640 dead transitions. [2022-12-06 05:21:01,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 640 transitions, 10328 flow [2022-12-06 05:21:01,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:21:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:21:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-12-06 05:21:01,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39832285115303984 [2022-12-06 05:21:01,908 INFO L175 Difference]: Start difference. First operand has 94 places, 505 transitions, 7607 flow. Second operand 9 states and 190 transitions. [2022-12-06 05:21:01,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 640 transitions, 10328 flow [2022-12-06 05:21:02,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 640 transitions, 9900 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-06 05:21:02,161 INFO L231 Difference]: Finished difference. Result has 98 places, 589 transitions, 9433 flow [2022-12-06 05:21:02,161 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=7223, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=430, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9433, PETRI_PLACES=98, PETRI_TRANSITIONS=589} [2022-12-06 05:21:02,162 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places. [2022-12-06 05:21:02,162 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:02,162 INFO L89 Accepts]: Start accepts. Operand has 98 places, 589 transitions, 9433 flow [2022-12-06 05:21:02,163 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:02,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:02,164 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 589 transitions, 9433 flow [2022-12-06 05:21:02,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 589 transitions, 9433 flow [2022-12-06 05:21:02,799 INFO L130 PetriNetUnfolder]: 5451/8125 cut-off events. [2022-12-06 05:21:02,799 INFO L131 PetriNetUnfolder]: For 27200/28917 co-relation queries the response was YES. [2022-12-06 05:21:02,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40881 conditions, 8125 events. 5451/8125 cut-off events. For 27200/28917 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 49835 event pairs, 898 based on Foata normal form. 36/7719 useless extension candidates. Maximal degree in co-relation 40148. Up to 3609 conditions per place. [2022-12-06 05:21:02,891 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 589 transitions, 9433 flow [2022-12-06 05:21:02,891 INFO L188 LiptonReduction]: Number of co-enabled transitions 2690 [2022-12-06 05:21:02,897 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:21:02,898 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 736 [2022-12-06 05:21:02,898 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 589 transitions, 9433 flow [2022-12-06 05:21:02,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:21:02,898 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:02,898 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:02,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:21:02,898 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:21:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:02,898 INFO L85 PathProgramCache]: Analyzing trace with hash 545984768, now seen corresponding path program 2 times [2022-12-06 05:21:02,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:02,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998133813] [2022-12-06 05:21:02,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:02,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:03,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:03,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998133813] [2022-12-06 05:21:03,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998133813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:03,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:03,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:21:03,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484131972] [2022-12-06 05:21:03,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:03,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:03,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:03,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:03,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:03,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:21:03,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 589 transitions, 9433 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:21:03,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:03,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:21:03,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:05,062 INFO L130 PetriNetUnfolder]: 16215/21210 cut-off events. [2022-12-06 05:21:05,062 INFO L131 PetriNetUnfolder]: For 95998/95998 co-relation queries the response was YES. [2022-12-06 05:21:05,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110872 conditions, 21210 events. 16215/21210 cut-off events. For 95998/95998 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 99871 event pairs, 4858 based on Foata normal form. 252/21462 useless extension candidates. Maximal degree in co-relation 99032. Up to 20989 conditions per place. [2022-12-06 05:21:05,232 INFO L137 encePairwiseOnDemand]: 41/53 looper letters, 387 selfloop transitions, 7 changer transitions 22/416 dead transitions. [2022-12-06 05:21:05,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 416 transitions, 6837 flow [2022-12-06 05:21:05,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 05:21:05,233 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3584905660377358 [2022-12-06 05:21:05,233 INFO L175 Difference]: Start difference. First operand has 98 places, 589 transitions, 9433 flow. Second operand 4 states and 76 transitions. [2022-12-06 05:21:05,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 416 transitions, 6837 flow [2022-12-06 05:21:05,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 416 transitions, 6399 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 05:21:05,466 INFO L231 Difference]: Finished difference. Result has 96 places, 385 transitions, 5356 flow [2022-12-06 05:21:05,467 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=5407, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5356, PETRI_PLACES=96, PETRI_TRANSITIONS=385} [2022-12-06 05:21:05,467 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 39 predicate places. [2022-12-06 05:21:05,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:05,467 INFO L89 Accepts]: Start accepts. Operand has 96 places, 385 transitions, 5356 flow [2022-12-06 05:21:05,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:05,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:05,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 385 transitions, 5356 flow [2022-12-06 05:21:05,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 385 transitions, 5356 flow [2022-12-06 05:21:05,873 INFO L130 PetriNetUnfolder]: 3881/5975 cut-off events. [2022-12-06 05:21:05,874 INFO L131 PetriNetUnfolder]: For 16724/18128 co-relation queries the response was YES. [2022-12-06 05:21:05,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24896 conditions, 5975 events. 3881/5975 cut-off events. For 16724/18128 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 37190 event pairs, 791 based on Foata normal form. 32/5571 useless extension candidates. Maximal degree in co-relation 24215. Up to 3081 conditions per place. [2022-12-06 05:21:05,931 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 385 transitions, 5356 flow [2022-12-06 05:21:05,931 INFO L188 LiptonReduction]: Number of co-enabled transitions 1674 [2022-12-06 05:21:05,936 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_97 (+ v_~t~0_235 1)) (= v_~t~0_233 (+ v_~t~0_235 2)) (= v_~t~0_235 v_~m1~0_141)) InVars {~t~0=v_~t~0_235} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_29|, ~m6~0=v_~m6~0_97, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_9|, ~m1~0=v_~m1~0_141, ~t~0=v_~t~0_233} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~m1~0, ~t~0] and [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] [2022-12-06 05:21:06,019 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_97 (+ v_~t~0_235 1)) (= v_~t~0_233 (+ v_~t~0_235 2)) (= v_~t~0_235 v_~m1~0_141)) InVars {~t~0=v_~t~0_235} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_29|, ~m6~0=v_~m6~0_97, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_9|, ~m1~0=v_~m1~0_141, ~t~0=v_~t~0_233} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~m1~0, ~t~0] and [711] L45-->thread6EXIT: Formula: (let ((.cse0 (= v_~x~0_260 1))) (and (not (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| 0)) (= (+ v_~s~0_805 1) v_~s~0_804) (= |v_thread6Thread1of1ForFork0_#res#1.offset_57| 0) .cse0 (= |v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45| |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|) (= |v_thread6Thread1of1ForFork0_#res#1.base_57| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57| (ite (<= v_~m1~0_123 v_~s~0_805) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57|) (= v_~b~0_389 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_390 256) 0))) 1 0) 0) 0 1)) (= (ite (<= v_~m6~0_95 v_~s~0_805) 1 0) |v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|))) InVars {~b~0=v_~b~0_390, ~m6~0=v_~m6~0_95, ~m1~0=v_~m1~0_123, ~s~0=v_~s~0_805} OutVars{thread6Thread1of1ForFork0_#res#1.base=|v_thread6Thread1of1ForFork0_#res#1.base_57|, ~b~0=v_~b~0_389, ~m6~0=v_~m6~0_95, thread6Thread1of1ForFork0_#t~post12#1=|v_thread6Thread1of1ForFork0_#t~post12#1_61|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_57|, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1_45|, ~m1~0=v_~m1~0_123, thread6Thread1of1ForFork0_#res#1.offset=|v_thread6Thread1of1ForFork0_#res#1.offset_57|, ~x~0=v_~x~0_260, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_45|, ~s~0=v_~s~0_804, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_57|} AuxVars[] AssignedVars[thread6Thread1of1ForFork0_#res#1.base, ~b~0, thread6Thread1of1ForFork0_#t~post12#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread6Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork0_#res#1.offset, ~x~0, thread6Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:21:06,155 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_97 (+ v_~t~0_235 1)) (= v_~t~0_233 (+ v_~t~0_235 2)) (= v_~t~0_235 v_~m1~0_141)) InVars {~t~0=v_~t~0_235} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_29|, ~m6~0=v_~m6~0_97, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_9|, ~m1~0=v_~m1~0_141, ~t~0=v_~t~0_233} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~m1~0, ~t~0] and [535] $Ultimate##0-->L105: Formula: (and (= v_~m4~0_7 v_~t~0_77) (= v_~t~0_76 (+ v_~t~0_77 1))) InVars {~t~0=v_~t~0_77} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_76} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 05:21:06,174 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_97 (+ v_~t~0_235 1)) (= v_~t~0_233 (+ v_~t~0_235 2)) (= v_~t~0_235 v_~m1~0_141)) InVars {~t~0=v_~t~0_235} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_29|, ~m6~0=v_~m6~0_97, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_9|, ~m1~0=v_~m1~0_141, ~t~0=v_~t~0_233} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~m1~0, ~t~0] and [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] [2022-12-06 05:21:06,194 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [719] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_97 (+ v_~t~0_235 1)) (= v_~t~0_233 (+ v_~t~0_235 2)) (= v_~t~0_235 v_~m1~0_141)) InVars {~t~0=v_~t~0_235} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_29|, ~m6~0=v_~m6~0_97, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_9|, ~m1~0=v_~m1~0_141, ~t~0=v_~t~0_233} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~m1~0, ~t~0] and [541] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_69 1) v_~t~0_68) (= v_~m5~0_9 v_~t~0_69)) InVars {~t~0=v_~t~0_69} OutVars{thread5Thread1of1ForFork4_#t~post9#1=|v_thread5Thread1of1ForFork4_#t~post9#1_1|, ~m5~0=v_~m5~0_9, ~t~0=v_~t~0_68} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_#t~post9#1, ~m5~0, ~t~0] [2022-12-06 05:21:06,416 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:21:06,416 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 949 [2022-12-06 05:21:06,417 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 384 transitions, 5376 flow [2022-12-06 05:21:06,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:21:06,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:06,417 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:06,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:21:06,417 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:21:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:06,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1239498762, now seen corresponding path program 1 times [2022-12-06 05:21:06,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:06,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655245794] [2022-12-06 05:21:06,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:06,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:06,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:06,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:06,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655245794] [2022-12-06 05:21:06,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655245794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:06,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:06,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:21:06,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358015235] [2022-12-06 05:21:06,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:06,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:21:06,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:06,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:21:06,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:21:06,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 05:21:06,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 384 transitions, 5376 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-06 05:21:06,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:06,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 05:21:06,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:07,751 INFO L130 PetriNetUnfolder]: 10886/14227 cut-off events. [2022-12-06 05:21:07,751 INFO L131 PetriNetUnfolder]: For 63260/63260 co-relation queries the response was YES. [2022-12-06 05:21:07,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63731 conditions, 14227 events. 10886/14227 cut-off events. For 63260/63260 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 61986 event pairs, 4682 based on Foata normal form. 198/14425 useless extension candidates. Maximal degree in co-relation 63715. Up to 14065 conditions per place. [2022-12-06 05:21:07,997 INFO L137 encePairwiseOnDemand]: 39/55 looper letters, 60 selfloop transitions, 6 changer transitions 19/85 dead transitions. [2022-12-06 05:21:07,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 85 transitions, 750 flow [2022-12-06 05:21:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:21:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:21:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 05:21:07,998 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2022-12-06 05:21:07,998 INFO L175 Difference]: Start difference. First operand has 91 places, 384 transitions, 5376 flow. Second operand 4 states and 76 transitions. [2022-12-06 05:21:07,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 85 transitions, 750 flow [2022-12-06 05:21:08,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 85 transitions, 666 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-12-06 05:21:08,141 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 310 flow [2022-12-06 05:21:08,141 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2022-12-06 05:21:08,141 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 23 predicate places. [2022-12-06 05:21:08,141 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:08,141 INFO L89 Accepts]: Start accepts. Operand has 80 places, 57 transitions, 310 flow [2022-12-06 05:21:08,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:08,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:08,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 57 transitions, 310 flow [2022-12-06 05:21:08,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 310 flow [2022-12-06 05:21:08,310 INFO L130 PetriNetUnfolder]: 1885/3131 cut-off events. [2022-12-06 05:21:08,310 INFO L131 PetriNetUnfolder]: For 4531/5941 co-relation queries the response was YES. [2022-12-06 05:21:08,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9303 conditions, 3131 events. 1885/3131 cut-off events. For 4531/5941 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 20514 event pairs, 716 based on Foata normal form. 32/2711 useless extension candidates. Maximal degree in co-relation 8767. Up to 2276 conditions per place. [2022-12-06 05:21:08,335 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 57 transitions, 310 flow [2022-12-06 05:21:08,335 INFO L188 LiptonReduction]: Number of co-enabled transitions 586 [2022-12-06 05:21:08,337 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:21:08,338 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 05:21:08,338 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 310 flow [2022-12-06 05:21:08,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-06 05:21:08,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:08,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:08,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:21:08,338 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:21:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash -781022548, now seen corresponding path program 3 times [2022-12-06 05:21:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:08,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749659269] [2022-12-06 05:21:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:08,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:08,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749659269] [2022-12-06 05:21:08,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749659269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:08,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:08,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:21:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906257690] [2022-12-06 05:21:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:08,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:21:08,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:08,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:21:08,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:21:08,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-06 05:21:08,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-06 05:21:08,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:08,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-06 05:21:08,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:09,818 INFO L130 PetriNetUnfolder]: 14069/18068 cut-off events. [2022-12-06 05:21:09,819 INFO L131 PetriNetUnfolder]: For 50454/50454 co-relation queries the response was YES. [2022-12-06 05:21:09,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75934 conditions, 18068 events. 14069/18068 cut-off events. For 50454/50454 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 80062 event pairs, 1388 based on Foata normal form. 470/18538 useless extension candidates. Maximal degree in co-relation 48138. Up to 15112 conditions per place. [2022-12-06 05:21:09,907 INFO L137 encePairwiseOnDemand]: 24/47 looper letters, 109 selfloop transitions, 68 changer transitions 0/177 dead transitions. [2022-12-06 05:21:09,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 177 transitions, 1304 flow [2022-12-06 05:21:09,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:21:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:21:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2022-12-06 05:21:09,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4601063829787234 [2022-12-06 05:21:09,908 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 310 flow. Second operand 8 states and 173 transitions. [2022-12-06 05:21:09,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 177 transitions, 1304 flow [2022-12-06 05:21:09,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 177 transitions, 1198 flow, removed 44 selfloop flow, removed 5 redundant places. [2022-12-06 05:21:09,937 INFO L231 Difference]: Finished difference. Result has 63 places, 109 transitions, 853 flow [2022-12-06 05:21:09,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=853, PETRI_PLACES=63, PETRI_TRANSITIONS=109} [2022-12-06 05:21:09,938 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2022-12-06 05:21:09,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:09,938 INFO L89 Accepts]: Start accepts. Operand has 63 places, 109 transitions, 853 flow [2022-12-06 05:21:09,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:09,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:09,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 109 transitions, 853 flow [2022-12-06 05:21:09,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 109 transitions, 853 flow [2022-12-06 05:21:10,217 INFO L130 PetriNetUnfolder]: 3081/4609 cut-off events. [2022-12-06 05:21:10,217 INFO L131 PetriNetUnfolder]: For 10797/15783 co-relation queries the response was YES. [2022-12-06 05:21:10,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18201 conditions, 4609 events. 3081/4609 cut-off events. For 10797/15783 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 26746 event pairs, 759 based on Foata normal form. 188/4243 useless extension candidates. Maximal degree in co-relation 17663. Up to 3037 conditions per place. [2022-12-06 05:21:10,259 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 109 transitions, 853 flow [2022-12-06 05:21:10,259 INFO L188 LiptonReduction]: Number of co-enabled transitions 1182 [2022-12-06 05:21:10,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [535] $Ultimate##0-->L105: Formula: (and (= v_~m4~0_7 v_~t~0_77) (= v_~t~0_76 (+ v_~t~0_77 1))) InVars {~t~0=v_~t~0_77} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, ~m4~0=v_~m4~0_7, ~t~0=v_~t~0_76} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, ~m4~0, ~t~0] [2022-12-06 05:21:10,283 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 05:21:10,299 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] [2022-12-06 05:21:10,317 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [541] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_69 1) v_~t~0_68) (= v_~m5~0_9 v_~t~0_69)) InVars {~t~0=v_~t~0_69} OutVars{thread5Thread1of1ForFork4_#t~post9#1=|v_thread5Thread1of1ForFork4_#t~post9#1_1|, ~m5~0=v_~m5~0_9, ~t~0=v_~t~0_68} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_#t~post9#1, ~m5~0, ~t~0] [2022-12-06 05:21:10,388 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [523] $Ultimate##0-->L67: Formula: (and (= v_~m2~0_11 v_~t~0_65) (= v_~t~0_64 (+ v_~t~0_65 1))) InVars {~t~0=v_~t~0_65} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~m2~0=v_~m2~0_11, ~t~0=v_~t~0_64} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, ~t~0] and [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] [2022-12-06 05:21:10,405 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:10,406 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 468 [2022-12-06 05:21:10,406 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 108 transitions, 870 flow [2022-12-06 05:21:10,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-06 05:21:10,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:10,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:10,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:21:10,407 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:21:10,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:10,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1292579190, now seen corresponding path program 1 times [2022-12-06 05:21:10,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:10,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983101396] [2022-12-06 05:21:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:10,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:10,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983101396] [2022-12-06 05:21:10,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983101396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:10,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:10,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:21:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538911114] [2022-12-06 05:21:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:10,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:21:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:10,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:21:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:21:10,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:21:10,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 108 transitions, 870 flow. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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-12-06 05:21:10,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:10,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:21:10,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:13,352 INFO L130 PetriNetUnfolder]: 29728/38221 cut-off events. [2022-12-06 05:21:13,352 INFO L131 PetriNetUnfolder]: For 113234/113234 co-relation queries the response was YES. [2022-12-06 05:21:13,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179692 conditions, 38221 events. 29728/38221 cut-off events. For 113234/113234 co-relation queries the response was YES. Maximal size of possible extension queue 1517. Compared 190067 event pairs, 2517 based on Foata normal form. 382/38603 useless extension candidates. Maximal degree in co-relation 128776. Up to 22575 conditions per place. [2022-12-06 05:21:13,562 INFO L137 encePairwiseOnDemand]: 25/53 looper letters, 119 selfloop transitions, 213 changer transitions 0/332 dead transitions. [2022-12-06 05:21:13,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 332 transitions, 3130 flow [2022-12-06 05:21:13,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:21:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:21:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2022-12-06 05:21:13,564 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5336927223719676 [2022-12-06 05:21:13,564 INFO L175 Difference]: Start difference. First operand has 62 places, 108 transitions, 870 flow. Second operand 7 states and 198 transitions. [2022-12-06 05:21:13,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 332 transitions, 3130 flow [2022-12-06 05:21:13,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 332 transitions, 3009 flow, removed 55 selfloop flow, removed 2 redundant places. [2022-12-06 05:21:13,751 INFO L231 Difference]: Finished difference. Result has 69 places, 257 transitions, 2863 flow [2022-12-06 05:21:13,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2863, PETRI_PLACES=69, PETRI_TRANSITIONS=257} [2022-12-06 05:21:13,752 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2022-12-06 05:21:13,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:13,752 INFO L89 Accepts]: Start accepts. Operand has 69 places, 257 transitions, 2863 flow [2022-12-06 05:21:13,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:13,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:13,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 257 transitions, 2863 flow [2022-12-06 05:21:13,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 257 transitions, 2863 flow [2022-12-06 05:21:14,694 INFO L130 PetriNetUnfolder]: 8185/11452 cut-off events. [2022-12-06 05:21:14,694 INFO L131 PetriNetUnfolder]: For 48693/92030 co-relation queries the response was YES. [2022-12-06 05:21:14,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61596 conditions, 11452 events. 8185/11452 cut-off events. For 48693/92030 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 65722 event pairs, 758 based on Foata normal form. 6/11255 useless extension candidates. Maximal degree in co-relation 60857. Up to 7527 conditions per place. [2022-12-06 05:21:14,780 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 257 transitions, 2863 flow [2022-12-06 05:21:14,780 INFO L188 LiptonReduction]: Number of co-enabled transitions 2162 [2022-12-06 05:21:14,787 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:21:14,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1036 [2022-12-06 05:21:14,788 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 257 transitions, 2863 flow [2022-12-06 05:21:14,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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-12-06 05:21:14,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:14,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:14,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:21:14,788 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:21:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash 321641492, now seen corresponding path program 1 times [2022-12-06 05:21:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:14,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906883658] [2022-12-06 05:21:14,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:14,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:14,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:14,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906883658] [2022-12-06 05:21:14,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906883658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:14,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:14,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:21:14,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238235859] [2022-12-06 05:21:14,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:14,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:21:14,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:14,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:21:14,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:21:14,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-06 05:21:14,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 257 transitions, 2863 flow. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-12-06 05:21:14,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:14,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-06 05:21:14,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:19,843 INFO L130 PetriNetUnfolder]: 42521/55116 cut-off events. [2022-12-06 05:21:19,843 INFO L131 PetriNetUnfolder]: For 240549/240549 co-relation queries the response was YES. [2022-12-06 05:21:19,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328360 conditions, 55116 events. 42521/55116 cut-off events. For 240549/240549 co-relation queries the response was YES. Maximal size of possible extension queue 2210. Compared 290837 event pairs, 4205 based on Foata normal form. 1100/56216 useless extension candidates. Maximal degree in co-relation 231724. Up to 32998 conditions per place. [2022-12-06 05:21:20,209 INFO L137 encePairwiseOnDemand]: 25/53 looper letters, 172 selfloop transitions, 318 changer transitions 0/490 dead transitions. [2022-12-06 05:21:20,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 490 transitions, 6084 flow [2022-12-06 05:21:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:21:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:21:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2022-12-06 05:21:20,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5251572327044025 [2022-12-06 05:21:20,211 INFO L175 Difference]: Start difference. First operand has 69 places, 257 transitions, 2863 flow. Second operand 6 states and 167 transitions. [2022-12-06 05:21:20,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 490 transitions, 6084 flow [2022-12-06 05:21:22,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 490 transitions, 5722 flow, removed 181 selfloop flow, removed 0 redundant places. [2022-12-06 05:21:22,402 INFO L231 Difference]: Finished difference. Result has 77 places, 419 transitions, 5715 flow [2022-12-06 05:21:22,403 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5715, PETRI_PLACES=77, PETRI_TRANSITIONS=419} [2022-12-06 05:21:22,403 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2022-12-06 05:21:22,403 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:22,403 INFO L89 Accepts]: Start accepts. Operand has 77 places, 419 transitions, 5715 flow [2022-12-06 05:21:22,405 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:22,405 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:22,405 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 419 transitions, 5715 flow [2022-12-06 05:21:22,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 419 transitions, 5715 flow [2022-12-06 05:21:23,793 INFO L130 PetriNetUnfolder]: 11631/16313 cut-off events. [2022-12-06 05:21:23,793 INFO L131 PetriNetUnfolder]: For 79339/111564 co-relation queries the response was YES. [2022-12-06 05:21:23,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95016 conditions, 16313 events. 11631/16313 cut-off events. For 79339/111564 co-relation queries the response was YES. Maximal size of possible extension queue 1344. Compared 97328 event pairs, 937 based on Foata normal form. 16/16032 useless extension candidates. Maximal degree in co-relation 94126. Up to 8980 conditions per place. [2022-12-06 05:21:23,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 419 transitions, 5715 flow [2022-12-06 05:21:23,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 3446 [2022-12-06 05:21:23,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-06 05:21:24,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [704] L45-->thread1EXIT: Formula: (and (= |v_thread3Thread1of1ForFork5_#res#1.offset_17| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_57| 0) (= |v_thread3Thread1of1ForFork5_#res#1.base_17| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_49|) (= v_~x~0_236 0) (= v_~b~0_361 1) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_49| 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_57| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m1~0_109 v_~s~0_768) 1 0)) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m3~0_97 v_~s~0_768) 1 0)) (= v_~s~0_766 (+ 2 v_~s~0_768))) InVars {~m3~0=v_~m3~0_97, ~m1~0=v_~m1~0_109, ~s~0=v_~s~0_768} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_59|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_69|, ~m3~0=v_~m3~0_97, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_17|, ~b~0=v_~b~0_361, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_17|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_43|, ~m1~0=v_~m1~0_109, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_49|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_57|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_57|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_49|, ~x~0=v_~x~0_236, ~s~0=v_~s~0_766, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_43|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread3Thread1of1ForFork5_#t~post6#1, thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:21:24,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [706] L45-->thread1EXIT: Formula: (and (= v_~b~0_369 1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_61| 0) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (= |v_thread1Thread1of1ForFork1_#res#1.base_61| 0) (= |v_thread4Thread1of1ForFork2_#res#1.base_31| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_31| 0) (= (+ 2 v_~s~0_780) v_~s~0_778) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47| (ite (<= v_~m1~0_113 v_~s~0_780) 1 0)) (= v_~x~0_244 0) (= (ite (<= v_~m4~0_93 v_~s~0_780) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|)) InVars {~m4~0=v_~m4~0_93, ~m1~0=v_~m1~0_113, ~s~0=v_~s~0_780} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_63|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_47|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_31|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_47|, ~b~0=v_~b~0_369, ~m4~0=v_~m4~0_93, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_47|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_61|, ~m1~0=v_~m1~0_113, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_61|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_61|, ~x~0=v_~x~0_244, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_31|, ~s~0=v_~s~0_778, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_47|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:21:24,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [675] L86-->thread3EXIT: Formula: (and (= (+ v_~s~0_637 1) v_~s~0_636) (= v_~b~0_239 (ite (= (ite (or (not (= (mod v_~b~0_240 256) 0)) (= v_~x~0_163 1)) 1 0) 0) 0 1)) (= |v_thread3Thread1of1ForFork5_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|) (not (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39| 0)) (= |v_thread3Thread1of1ForFork5_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39| (ite (<= v_~m3~0_65 v_~s~0_637) 1 0))) InVars {~m3~0=v_~m3~0_65, ~b~0=v_~b~0_240, ~x~0=v_~x~0_163, ~s~0=v_~s~0_637} OutVars{~m3~0=v_~m3~0_65, thread3Thread1of1ForFork5_#res#1.base=|v_thread3Thread1of1ForFork5_#res#1.base_7|, ~b~0=v_~b~0_239, thread3Thread1of1ForFork5_#res#1.offset=|v_thread3Thread1of1ForFork5_#res#1.offset_7|, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1_39|, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_39|, thread3Thread1of1ForFork5_#t~post6#1=|v_thread3Thread1of1ForFork5_#t~post6#1_59|, ~x~0=v_~x~0_163, ~s~0=v_~s~0_636} AuxVars[] AssignedVars[thread3Thread1of1ForFork5_#res#1.base, ~b~0, thread3Thread1of1ForFork5_#res#1.offset, thread3Thread1of1ForFork5_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork5_#t~post6#1, ~s~0] [2022-12-06 05:21:24,239 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [708] L45-->thread1EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|) (= (ite (<= v_~m1~0_117 v_~s~0_792) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|) (= (+ 2 v_~s~0_792) v_~s~0_790) (= |v_thread1Thread1of1ForFork1_#res#1.offset_65| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_65| 0) (= |v_thread5Thread1of1ForFork4_#res#1.base_41| 0) (= v_~x~0_252 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51| 0)) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43| (ite (<= v_~m5~0_101 v_~s~0_792) 1 0)) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|) (= v_~b~0_377 1) (= |v_thread5Thread1of1ForFork4_#res#1.offset_41| 0)) InVars {~m5~0=v_~m5~0_101, ~m1~0=v_~m1~0_117, ~s~0=v_~s~0_792} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_67|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_41|, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_41|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_51|, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_43|, thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_43|, ~b~0=v_~b~0_377, ~m5~0=v_~m5~0_101, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_51|, ~m1~0=v_~m1~0_117, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_65|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_65|, ~x~0=v_~x~0_252, ~s~0=v_~s~0_790, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread5Thread1of1ForFork4_#res#1.offset, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:21:24,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [661] L124-->thread5EXIT: Formula: (and (= |v_thread5Thread1of1ForFork4_#res#1.offset_29| 0) (not (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| 0)) (= v_~b~0_189 (ite (= (ite (or (= v_~x~0_136 1) (not (= (mod v_~b~0_190 256) 0))) 1 0) 0) 0 1)) (= |v_thread5Thread1of1ForFork4_#res#1.base_29| 0) (= |v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31| |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (ite (<= v_~m5~0_59 v_~s~0_585) 1 0) |v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|) (= (+ v_~s~0_585 1) v_~s~0_584)) InVars {~b~0=v_~b~0_190, ~m5~0=v_~m5~0_59, ~x~0=v_~x~0_136, ~s~0=v_~s~0_585} OutVars{thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1_31|, thread5Thread1of1ForFork4_#res#1.offset=|v_thread5Thread1of1ForFork4_#res#1.offset_29|, ~b~0=v_~b~0_189, ~m5~0=v_~m5~0_59, thread5Thread1of1ForFork4_#res#1.base=|v_thread5Thread1of1ForFork4_#res#1.base_29|, thread5Thread1of1ForFork4_#t~post10#1=|v_thread5Thread1of1ForFork4_#t~post10#1_39|, ~x~0=v_~x~0_136, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1_31|, ~s~0=v_~s~0_584} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork4_#res#1.offset, ~b~0, thread5Thread1of1ForFork4_#res#1.base, thread5Thread1of1ForFork4_#t~post10#1, thread5Thread1of1ForFork4_assume_abort_if_not_~cond#1, ~s~0] [2022-12-06 05:21:24,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:21:24,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [707] L45-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_63| 0) (= (+ 2 v_~s~0_786) v_~s~0_784) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork3_#res#1.offset_65| 0) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_63| 0) (= v_~b~0_373 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_115 v_~s~0_786) 1 0)) (= (ite (<= v_~m2~0_105 v_~s~0_786) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|) (= |v_thread2Thread1of1ForFork3_#res#1.base_65| 0) (= v_~x~0_248 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51| 0))) InVars {~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, ~s~0=v_~s~0_786} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_65|, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_77|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_65|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_65|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|, ~b~0=v_~b~0_373, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_63|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_63|, ~x~0=v_~x~0_248, ~s~0=v_~s~0_784, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:21:24,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:21:24,542 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:24,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2140 [2022-12-06 05:21:24,543 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 419 transitions, 5769 flow [2022-12-06 05:21:24,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-12-06 05:21:24,543 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:24,543 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:24,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:21:24,543 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:21:24,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:24,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2076990970, now seen corresponding path program 2 times [2022-12-06 05:21:24,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:24,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658764037] [2022-12-06 05:21:24,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:24,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:24,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:24,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658764037] [2022-12-06 05:21:24,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658764037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:24,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:24,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:21:24,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571039197] [2022-12-06 05:21:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:24,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:21:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:24,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:21:24,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:21:24,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 05:21:24,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 419 transitions, 5769 flow. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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-12-06 05:21:24,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:24,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 05:21:24,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:31,502 INFO L130 PetriNetUnfolder]: 48842/64027 cut-off events. [2022-12-06 05:21:31,502 INFO L131 PetriNetUnfolder]: For 336745/336745 co-relation queries the response was YES. [2022-12-06 05:21:31,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401644 conditions, 64027 events. 48842/64027 cut-off events. For 336745/336745 co-relation queries the response was YES. Maximal size of possible extension queue 2705. Compared 357807 event pairs, 3915 based on Foata normal form. 3260/67287 useless extension candidates. Maximal degree in co-relation 291507. Up to 30953 conditions per place. [2022-12-06 05:21:31,984 INFO L137 encePairwiseOnDemand]: 25/62 looper letters, 164 selfloop transitions, 652 changer transitions 0/816 dead transitions. [2022-12-06 05:21:31,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 816 transitions, 11940 flow [2022-12-06 05:21:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:21:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:21:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 294 transitions. [2022-12-06 05:21:31,986 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47419354838709676 [2022-12-06 05:21:31,986 INFO L175 Difference]: Start difference. First operand has 77 places, 419 transitions, 5769 flow. Second operand 10 states and 294 transitions. [2022-12-06 05:21:31,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 816 transitions, 11940 flow [2022-12-06 05:21:35,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 816 transitions, 11885 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-06 05:21:35,317 INFO L231 Difference]: Finished difference. Result has 88 places, 702 transitions, 11724 flow [2022-12-06 05:21:35,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=5598, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=360, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11724, PETRI_PLACES=88, PETRI_TRANSITIONS=702} [2022-12-06 05:21:35,317 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2022-12-06 05:21:35,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:35,318 INFO L89 Accepts]: Start accepts. Operand has 88 places, 702 transitions, 11724 flow [2022-12-06 05:21:35,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:35,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:35,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 702 transitions, 11724 flow [2022-12-06 05:21:35,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 702 transitions, 11724 flow [2022-12-06 05:21:37,430 INFO L130 PetriNetUnfolder]: 13354/19019 cut-off events. [2022-12-06 05:21:37,430 INFO L131 PetriNetUnfolder]: For 128071/211613 co-relation queries the response was YES. [2022-12-06 05:21:37,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133737 conditions, 19019 events. 13354/19019 cut-off events. For 128071/211613 co-relation queries the response was YES. Maximal size of possible extension queue 1606. Compared 119720 event pairs, 1028 based on Foata normal form. 32/18744 useless extension candidates. Maximal degree in co-relation 132703. Up to 10572 conditions per place. [2022-12-06 05:21:37,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 702 transitions, 11724 flow [2022-12-06 05:21:37,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 5104 [2022-12-06 05:21:37,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:21:37,694 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [586] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_29| 0) (= v_~x~0_14 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_29| 0) (= (+ v_~s~0_179 1) v_~s~0_178)) InVars {~s~0=v_~s~0_179} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_31|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_29|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_29|, ~x~0=v_~x~0_14, ~s~0=v_~s~0_178} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0] [2022-12-06 05:21:37,718 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [707] L45-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_63| 0) (= (+ 2 v_~s~0_786) v_~s~0_784) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork3_#res#1.offset_65| 0) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_63| 0) (= v_~b~0_373 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_115 v_~s~0_786) 1 0)) (= (ite (<= v_~m2~0_105 v_~s~0_786) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|) (= |v_thread2Thread1of1ForFork3_#res#1.base_65| 0) (= v_~x~0_248 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51| 0))) InVars {~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, ~s~0=v_~s~0_786} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_65|, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_77|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_65|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_65|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|, ~b~0=v_~b~0_373, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_63|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_63|, ~x~0=v_~x~0_248, ~s~0=v_~s~0_784, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:21:37,799 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:21:37,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:21:37,899 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [707] L45-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_63| 0) (= (+ 2 v_~s~0_786) v_~s~0_784) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork3_#res#1.offset_65| 0) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_63| 0) (= v_~b~0_373 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_115 v_~s~0_786) 1 0)) (= (ite (<= v_~m2~0_105 v_~s~0_786) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|) (= |v_thread2Thread1of1ForFork3_#res#1.base_65| 0) (= v_~x~0_248 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51| 0))) InVars {~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, ~s~0=v_~s~0_786} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_65|, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_77|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_65|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_65|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|, ~b~0=v_~b~0_373, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_63|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_63|, ~x~0=v_~x~0_248, ~s~0=v_~s~0_784, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:21:37,981 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:21:38,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [691] L105-->thread4EXIT: Formula: (and (= v_~b~0_281 (ite (= (ite (or (not (= (mod v_~b~0_282 256) 0)) (= v_~x~0_191 1)) 1 0) 0) 0 1)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|) (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41| 0)) (= (+ v_~s~0_685 1) v_~s~0_684) (= |v_thread4Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread4Thread1of1ForFork2_#res#1.offset_25| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41| (ite (<= v_~m4~0_71 v_~s~0_685) 1 0))) InVars {~b~0=v_~b~0_282, ~m4~0=v_~m4~0_71, ~x~0=v_~x~0_191, ~s~0=v_~s~0_685} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_41|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_25|, ~b~0=v_~b~0_281, ~m4~0=v_~m4~0_71, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_55|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_41|, ~x~0=v_~x~0_191, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_25|, ~s~0=v_~s~0_684} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#res#1.offset, ~s~0] [2022-12-06 05:21:38,081 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [713] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_264 1))) (and (= v_~b~0_397 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_398 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork3_#res#1.base_67| 0) .cse0 (= |v_thread2Thread1of1ForFork3_#res#1.offset_67| 0) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53| 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (= v_~s~0_812 (+ v_~s~0_813 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| (ite (<= v_~m1~0_127 v_~s~0_813) 1 0)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| (ite (<= v_~m2~0_107 v_~s~0_813) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|))) InVars {~b~0=v_~b~0_398, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, ~s~0=v_~s~0_813} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_79|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_67|, ~b~0=v_~b~0_397, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_67|, ~x~0=v_~x~0_264, ~s~0=v_~s~0_812, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:21:38,153 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [712] L45-->thread4EXIT: Formula: (let ((.cse0 (= v_~x~0_262 1))) (and (= |v_thread4Thread1of1ForFork2_#res#1.offset_33| 0) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (ite (<= v_~m1~0_125 v_~s~0_809) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) .cse0 (not (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49| 0)) (= v_~b~0_393 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_394 256) 0))) 1 0) 0) 0 1)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (= (ite (<= v_~m4~0_95 v_~s~0_809) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|) (= (+ v_~s~0_809 1) v_~s~0_808) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|) (= |v_thread4Thread1of1ForFork2_#res#1.base_33| 0))) InVars {~b~0=v_~b~0_394, ~m4~0=v_~m4~0_95, ~m1~0=v_~m1~0_125, ~s~0=v_~s~0_809} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_49|, thread4Thread1of1ForFork2_#res#1.base=|v_thread4Thread1of1ForFork2_#res#1.base_33|, ~b~0=v_~b~0_393, ~m4~0=v_~m4~0_95, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_63|, ~m1~0=v_~m1~0_125, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_49|, ~x~0=v_~x~0_262, thread4Thread1of1ForFork2_#res#1.offset=|v_thread4Thread1of1ForFork2_#res#1.offset_33|, ~s~0=v_~s~0_808, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#res#1.base, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~x~0, thread4Thread1of1ForFork2_#res#1.offset, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:21:38,260 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:38,261 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2944 [2022-12-06 05:21:38,261 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 702 transitions, 11792 flow [2022-12-06 05:21:38,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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-12-06 05:21:38,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:38,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:38,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:21:38,262 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:21:38,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:38,262 INFO L85 PathProgramCache]: Analyzing trace with hash -374080374, now seen corresponding path program 1 times [2022-12-06 05:21:38,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:38,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861827360] [2022-12-06 05:21:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:38,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:38,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:38,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861827360] [2022-12-06 05:21:38,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861827360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:38,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:38,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:21:38,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395806618] [2022-12-06 05:21:38,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:38,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:21:38,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:38,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:21:38,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:21:38,375 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 05:21:38,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 702 transitions, 11792 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:21:38,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:38,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 05:21:38,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:21:46,902 INFO L130 PetriNetUnfolder]: 50652/66457 cut-off events. [2022-12-06 05:21:46,902 INFO L131 PetriNetUnfolder]: For 497430/497430 co-relation queries the response was YES. [2022-12-06 05:21:47,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486014 conditions, 66457 events. 50652/66457 cut-off events. For 497430/497430 co-relation queries the response was YES. Maximal size of possible extension queue 2804. Compared 371874 event pairs, 5393 based on Foata normal form. 724/67181 useless extension candidates. Maximal degree in co-relation 382355. Up to 64465 conditions per place. [2022-12-06 05:21:47,467 INFO L137 encePairwiseOnDemand]: 44/72 looper letters, 680 selfloop transitions, 244 changer transitions 0/924 dead transitions. [2022-12-06 05:21:47,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 924 transitions, 16736 flow [2022-12-06 05:21:47,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:21:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:21:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2022-12-06 05:21:47,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35119047619047616 [2022-12-06 05:21:47,468 INFO L175 Difference]: Start difference. First operand has 88 places, 702 transitions, 11792 flow. Second operand 7 states and 177 transitions. [2022-12-06 05:21:47,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 924 transitions, 16736 flow [2022-12-06 05:21:55,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 924 transitions, 16575 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-06 05:21:55,320 INFO L231 Difference]: Finished difference. Result has 95 places, 846 transitions, 15205 flow [2022-12-06 05:21:55,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=11648, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15205, PETRI_PLACES=95, PETRI_TRANSITIONS=846} [2022-12-06 05:21:55,321 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2022-12-06 05:21:55,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:21:55,321 INFO L89 Accepts]: Start accepts. Operand has 95 places, 846 transitions, 15205 flow [2022-12-06 05:21:55,323 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:21:55,323 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:21:55,323 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 846 transitions, 15205 flow [2022-12-06 05:21:55,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 846 transitions, 15205 flow [2022-12-06 05:21:57,677 INFO L130 PetriNetUnfolder]: 13926/19865 cut-off events. [2022-12-06 05:21:57,677 INFO L131 PetriNetUnfolder]: For 152009/279347 co-relation queries the response was YES. [2022-12-06 05:21:57,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143449 conditions, 19865 events. 13926/19865 cut-off events. For 152009/279347 co-relation queries the response was YES. Maximal size of possible extension queue 1689. Compared 125990 event pairs, 1068 based on Foata normal form. 35/19576 useless extension candidates. Maximal degree in co-relation 142366. Up to 11035 conditions per place. [2022-12-06 05:21:57,894 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 846 transitions, 15205 flow [2022-12-06 05:21:57,895 INFO L188 LiptonReduction]: Number of co-enabled transitions 5692 [2022-12-06 05:21:57,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [736] $Ultimate##0-->L86: Formula: (and (= v_~t~0_315 (+ v_~t~0_317 2)) (= v_~t~0_317 v_~m2~0_136) (= v_~t~0_315 (+ v_~m3~0_111 1))) InVars {~t~0=v_~t~0_317} OutVars{~m3~0=v_~m3~0_111, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_38|, ~m2~0=v_~m2~0_136, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_13|, ~t~0=v_~t~0_315} AuxVars[] AssignedVars[~m3~0, thread2Thread1of1ForFork3_#t~post3#1, ~m2~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:21:58,011 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:21:58,012 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2691 [2022-12-06 05:21:58,012 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 846 transitions, 15211 flow [2022-12-06 05:21:58,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:21:58,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:21:58,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:21:58,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:21:58,012 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:21:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:21:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash -114305744, now seen corresponding path program 1 times [2022-12-06 05:21:58,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:21:58,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202510476] [2022-12-06 05:21:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:21:58,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:21:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:21:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:21:58,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:21:58,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202510476] [2022-12-06 05:21:58,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202510476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:21:58,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:21:58,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:21:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576174064] [2022-12-06 05:21:58,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:21:58,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:21:58,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:21:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:21:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:21:58,126 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 05:21:58,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 846 transitions, 15211 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:21:58,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:21:58,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 05:21:58,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:07,507 INFO L130 PetriNetUnfolder]: 50158/65897 cut-off events. [2022-12-06 05:22:07,508 INFO L131 PetriNetUnfolder]: For 539136/539136 co-relation queries the response was YES. [2022-12-06 05:22:07,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486746 conditions, 65897 events. 50158/65897 cut-off events. For 539136/539136 co-relation queries the response was YES. Maximal size of possible extension queue 2740. Compared 369662 event pairs, 5448 based on Foata normal form. 236/66133 useless extension candidates. Maximal degree in co-relation 430057. Up to 65050 conditions per place. [2022-12-06 05:22:08,140 INFO L137 encePairwiseOnDemand]: 51/73 looper letters, 754 selfloop transitions, 172 changer transitions 0/926 dead transitions. [2022-12-06 05:22:08,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 926 transitions, 18213 flow [2022-12-06 05:22:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:22:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:22:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2022-12-06 05:22:08,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3424657534246575 [2022-12-06 05:22:08,141 INFO L175 Difference]: Start difference. First operand has 95 places, 846 transitions, 15211 flow. Second operand 5 states and 125 transitions. [2022-12-06 05:22:08,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 926 transitions, 18213 flow [2022-12-06 05:22:16,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 926 transitions, 18125 flow, removed 36 selfloop flow, removed 1 redundant places. [2022-12-06 05:22:16,314 INFO L231 Difference]: Finished difference. Result has 99 places, 891 transitions, 16524 flow [2022-12-06 05:22:16,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=14665, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=824, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=16524, PETRI_PLACES=99, PETRI_TRANSITIONS=891} [2022-12-06 05:22:16,315 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 42 predicate places. [2022-12-06 05:22:16,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:16,315 INFO L89 Accepts]: Start accepts. Operand has 99 places, 891 transitions, 16524 flow [2022-12-06 05:22:16,317 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:16,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:16,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 891 transitions, 16524 flow [2022-12-06 05:22:16,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 891 transitions, 16524 flow [2022-12-06 05:22:18,607 INFO L130 PetriNetUnfolder]: 13768/19675 cut-off events. [2022-12-06 05:22:18,608 INFO L131 PetriNetUnfolder]: For 155438/287327 co-relation queries the response was YES. [2022-12-06 05:22:18,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142621 conditions, 19675 events. 13768/19675 cut-off events. For 155438/287327 co-relation queries the response was YES. Maximal size of possible extension queue 1682. Compared 125208 event pairs, 1052 based on Foata normal form. 38/19384 useless extension candidates. Maximal degree in co-relation 141546. Up to 10866 conditions per place. [2022-12-06 05:22:18,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 891 transitions, 16524 flow [2022-12-06 05:22:18,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 5850 [2022-12-06 05:22:19,087 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [713] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_264 1))) (and (= v_~b~0_397 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_398 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork3_#res#1.base_67| 0) .cse0 (= |v_thread2Thread1of1ForFork3_#res#1.offset_67| 0) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53| 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (= v_~s~0_812 (+ v_~s~0_813 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| (ite (<= v_~m1~0_127 v_~s~0_813) 1 0)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| (ite (<= v_~m2~0_107 v_~s~0_813) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|))) InVars {~b~0=v_~b~0_398, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, ~s~0=v_~s~0_813} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_79|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_67|, ~b~0=v_~b~0_397, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_67|, ~x~0=v_~x~0_264, ~s~0=v_~s~0_812, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:22:19,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:22:19,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [707] L45-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_63| 0) (= (+ 2 v_~s~0_786) v_~s~0_784) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread2Thread1of1ForFork3_#res#1.offset_65| 0) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_63| 0) (= v_~b~0_373 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| (ite (<= v_~m1~0_115 v_~s~0_786) 1 0)) (= (ite (<= v_~m2~0_105 v_~s~0_786) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|) (= |v_thread2Thread1of1ForFork3_#res#1.base_65| 0) (= v_~x~0_248 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51| 0))) InVars {~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, ~s~0=v_~s~0_786} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_65|, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_77|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_65|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_51|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_65|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_51|, ~b~0=v_~b~0_373, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_49|, ~m2~0=v_~m2~0_105, ~m1~0=v_~m1~0_115, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_63|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_63|, ~x~0=v_~x~0_248, ~s~0=v_~s~0_784, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_49|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:22:19,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:22:19,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:22:19,392 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] and [713] L45-->thread2EXIT: Formula: (let ((.cse0 (= v_~x~0_264 1))) (and (= v_~b~0_397 (ite (= (ite (or .cse0 (not (= (mod v_~b~0_398 256) 0))) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork3_#res#1.base_67| 0) .cse0 (= |v_thread2Thread1of1ForFork3_#res#1.offset_67| 0) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53| 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61| 0)) (= v_~s~0_812 (+ v_~s~0_813 1)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| (ite (<= v_~m1~0_127 v_~s~0_813) 1 0)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| (ite (<= v_~m2~0_107 v_~s~0_813) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|))) InVars {~b~0=v_~b~0_398, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, ~s~0=v_~s~0_813} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_79|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_67|, ~b~0=v_~b~0_397, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_61|, ~m2~0=v_~m2~0_107, ~m1~0=v_~m1~0_127, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_53|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_67|, ~x~0=v_~x~0_264, ~s~0=v_~s~0_812, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_61|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~x~0, ~s~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 05:22:19,497 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:22:19,498 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3183 [2022-12-06 05:22:19,498 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 891 transitions, 16568 flow [2022-12-06 05:22:19,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:22:19,498 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:19,498 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:19,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:22:19,498 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:22:19,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:19,498 INFO L85 PathProgramCache]: Analyzing trace with hash -197580648, now seen corresponding path program 1 times [2022-12-06 05:22:19,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:19,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127647744] [2022-12-06 05:22:19,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:19,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:19,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:19,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127647744] [2022-12-06 05:22:19,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127647744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:19,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:19,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:22:19,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582188430] [2022-12-06 05:22:19,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:19,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:22:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:19,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:22:19,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:22:19,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 79 [2022-12-06 05:22:19,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 891 transitions, 16568 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:22:19,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:19,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 79 [2022-12-06 05:22:19,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:31,273 INFO L130 PetriNetUnfolder]: 57070/75251 cut-off events. [2022-12-06 05:22:31,274 INFO L131 PetriNetUnfolder]: For 642207/642207 co-relation queries the response was YES. [2022-12-06 05:22:31,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565466 conditions, 75251 events. 57070/75251 cut-off events. For 642207/642207 co-relation queries the response was YES. Maximal size of possible extension queue 3167. Compared 433484 event pairs, 5583 based on Foata normal form. 674/75925 useless extension candidates. Maximal degree in co-relation 481519. Up to 64680 conditions per place. [2022-12-06 05:22:32,140 INFO L137 encePairwiseOnDemand]: 40/79 looper letters, 641 selfloop transitions, 636 changer transitions 0/1277 dead transitions. [2022-12-06 05:22:32,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 1277 transitions, 25456 flow [2022-12-06 05:22:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:22:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:22:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2022-12-06 05:22:32,141 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3924050632911392 [2022-12-06 05:22:32,141 INFO L175 Difference]: Start difference. First operand has 99 places, 891 transitions, 16568 flow. Second operand 6 states and 186 transitions. [2022-12-06 05:22:32,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 1277 transitions, 25456 flow [2022-12-06 05:22:44,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 1277 transitions, 25256 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 05:22:44,840 INFO L231 Difference]: Finished difference. Result has 105 places, 1211 transitions, 25076 flow [2022-12-06 05:22:44,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=15702, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=361, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=25076, PETRI_PLACES=105, PETRI_TRANSITIONS=1211} [2022-12-06 05:22:44,841 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 48 predicate places. [2022-12-06 05:22:44,841 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:44,841 INFO L89 Accepts]: Start accepts. Operand has 105 places, 1211 transitions, 25076 flow [2022-12-06 05:22:44,845 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:44,845 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:44,845 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 1211 transitions, 25076 flow [2022-12-06 05:22:44,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 1211 transitions, 25076 flow [2022-12-06 05:22:48,220 INFO L130 PetriNetUnfolder]: 15569/22536 cut-off events. [2022-12-06 05:22:48,220 INFO L131 PetriNetUnfolder]: For 231965/414348 co-relation queries the response was YES. [2022-12-06 05:22:48,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182365 conditions, 22536 events. 15569/22536 cut-off events. For 231965/414348 co-relation queries the response was YES. Maximal size of possible extension queue 1912. Compared 149474 event pairs, 1079 based on Foata normal form. 54/22253 useless extension candidates. Maximal degree in co-relation 181023. Up to 12613 conditions per place. [2022-12-06 05:22:48,516 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 1211 transitions, 25076 flow [2022-12-06 05:22:48,516 INFO L188 LiptonReduction]: Number of co-enabled transitions 7566 [2022-12-06 05:22:48,525 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:22:48,526 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3685 [2022-12-06 05:22:48,526 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 1211 transitions, 25076 flow [2022-12-06 05:22:48,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:22:48,526 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:48,526 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:48,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:22:48,526 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:22:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1713389144, now seen corresponding path program 2 times [2022-12-06 05:22:48,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:48,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820237642] [2022-12-06 05:22:48,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:48,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:48,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820237642] [2022-12-06 05:22:48,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820237642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:22:48,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:22:48,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:22:48,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346428332] [2022-12-06 05:22:48,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:22:48,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:22:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:22:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:22:48,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 79 [2022-12-06 05:22:48,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 1211 transitions, 25076 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:22:48,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:48,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 79 [2022-12-06 05:22:48,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:01,537 INFO L130 PetriNetUnfolder]: 55521/73448 cut-off events. [2022-12-06 05:23:01,538 INFO L131 PetriNetUnfolder]: For 798805/798805 co-relation queries the response was YES. [2022-12-06 05:23:01,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595747 conditions, 73448 events. 55521/73448 cut-off events. For 798805/798805 co-relation queries the response was YES. Maximal size of possible extension queue 3089. Compared 425049 event pairs, 5985 based on Foata normal form. 1024/74472 useless extension candidates. Maximal degree in co-relation 516194. Up to 71307 conditions per place. [2022-12-06 05:23:02,467 INFO L137 encePairwiseOnDemand]: 49/79 looper letters, 990 selfloop transitions, 378 changer transitions 1/1369 dead transitions. [2022-12-06 05:23:02,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 1369 transitions, 30379 flow [2022-12-06 05:23:02,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:23:02,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:23:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2022-12-06 05:23:02,468 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3128390596745027 [2022-12-06 05:23:02,468 INFO L175 Difference]: Start difference. First operand has 105 places, 1211 transitions, 25076 flow. Second operand 7 states and 173 transitions. [2022-12-06 05:23:02,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 1369 transitions, 30379 flow [2022-12-06 05:23:18,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 1369 transitions, 30363 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:23:18,215 INFO L231 Difference]: Finished difference. Result has 113 places, 1299 transitions, 28610 flow [2022-12-06 05:23:18,216 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=22381, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=28610, PETRI_PLACES=113, PETRI_TRANSITIONS=1299} [2022-12-06 05:23:18,217 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 56 predicate places. [2022-12-06 05:23:18,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:18,217 INFO L89 Accepts]: Start accepts. Operand has 113 places, 1299 transitions, 28610 flow [2022-12-06 05:23:18,222 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:18,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:18,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 1299 transitions, 28610 flow [2022-12-06 05:23:18,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 1299 transitions, 28610 flow [2022-12-06 05:23:21,531 INFO L130 PetriNetUnfolder]: 15133/21992 cut-off events. [2022-12-06 05:23:21,532 INFO L131 PetriNetUnfolder]: For 242706/380791 co-relation queries the response was YES. [2022-12-06 05:23:21,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180904 conditions, 21992 events. 15133/21992 cut-off events. For 242706/380791 co-relation queries the response was YES. Maximal size of possible extension queue 1893. Compared 146214 event pairs, 1096 based on Foata normal form. 43/21711 useless extension candidates. Maximal degree in co-relation 179608. Up to 12273 conditions per place. [2022-12-06 05:23:21,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 1299 transitions, 28610 flow [2022-12-06 05:23:21,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 7642 [2022-12-06 05:23:21,871 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:23:21,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3655 [2022-12-06 05:23:21,872 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 1299 transitions, 28610 flow [2022-12-06 05:23:21,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:23:21,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:21,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:21,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:23:21,872 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:23:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash -710715718, now seen corresponding path program 1 times [2022-12-06 05:23:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:21,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738575211] [2022-12-06 05:23:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:22,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:22,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738575211] [2022-12-06 05:23:22,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738575211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:22,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:22,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:23:22,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568324144] [2022-12-06 05:23:22,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:22,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:23:22,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:22,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:23:22,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:23:22,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 71 [2022-12-06 05:23:22,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 1299 transitions, 28610 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:23:22,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:22,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 71 [2022-12-06 05:23:22,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:23:35,854 INFO L130 PetriNetUnfolder]: 55762/73957 cut-off events. [2022-12-06 05:23:35,854 INFO L131 PetriNetUnfolder]: For 849368/849368 co-relation queries the response was YES. [2022-12-06 05:23:36,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611368 conditions, 73957 events. 55762/73957 cut-off events. For 849368/849368 co-relation queries the response was YES. Maximal size of possible extension queue 3177. Compared 432006 event pairs, 6196 based on Foata normal form. 564/74521 useless extension candidates. Maximal degree in co-relation 560154. Up to 71723 conditions per place. [2022-12-06 05:23:36,814 INFO L137 encePairwiseOnDemand]: 39/71 looper letters, 1114 selfloop transitions, 382 changer transitions 0/1496 dead transitions. [2022-12-06 05:23:36,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 1496 transitions, 35891 flow [2022-12-06 05:23:36,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:23:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:23:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2022-12-06 05:23:36,815 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2837022132796781 [2022-12-06 05:23:36,815 INFO L175 Difference]: Start difference. First operand has 113 places, 1299 transitions, 28610 flow. Second operand 7 states and 141 transitions. [2022-12-06 05:23:36,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 1496 transitions, 35891 flow [2022-12-06 05:23:54,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 1496 transitions, 35665 flow, removed 105 selfloop flow, removed 1 redundant places. [2022-12-06 05:23:54,236 INFO L231 Difference]: Finished difference. Result has 120 places, 1448 transitions, 33791 flow [2022-12-06 05:23:54,237 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=28438, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=917, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=33791, PETRI_PLACES=120, PETRI_TRANSITIONS=1448} [2022-12-06 05:23:54,238 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 63 predicate places. [2022-12-06 05:23:54,238 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:23:54,238 INFO L89 Accepts]: Start accepts. Operand has 120 places, 1448 transitions, 33791 flow [2022-12-06 05:23:54,243 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:23:54,243 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:23:54,243 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 1448 transitions, 33791 flow [2022-12-06 05:23:54,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 1448 transitions, 33791 flow [2022-12-06 05:23:57,851 INFO L130 PetriNetUnfolder]: 15174/22149 cut-off events. [2022-12-06 05:23:57,851 INFO L131 PetriNetUnfolder]: For 260322/400223 co-relation queries the response was YES. [2022-12-06 05:23:58,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184912 conditions, 22149 events. 15174/22149 cut-off events. For 260322/400223 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 148757 event pairs, 1144 based on Foata normal form. 42/21861 useless extension candidates. Maximal degree in co-relation 183609. Up to 12349 conditions per place. [2022-12-06 05:23:58,217 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 1448 transitions, 33791 flow [2022-12-06 05:23:58,217 INFO L188 LiptonReduction]: Number of co-enabled transitions 8104 [2022-12-06 05:23:58,226 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [737] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_323 1) v_~m5~0_116) (= v_~t~0_321 (+ v_~t~0_323 2)) (= v_~t~0_323 v_~m2~0_138)) InVars {~t~0=v_~t~0_323} OutVars{thread5Thread1of1ForFork4_#t~post9#1=|v_thread5Thread1of1ForFork4_#t~post9#1_26|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_40|, ~m5~0=v_~m5~0_116, ~m2~0=v_~m2~0_138, ~t~0=v_~t~0_321} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_#t~post9#1, thread2Thread1of1ForFork3_#t~post3#1, ~m5~0, ~m2~0, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:23:58,293 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:23:58,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4056 [2022-12-06 05:23:58,294 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 1448 transitions, 33797 flow [2022-12-06 05:23:58,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:23:58,294 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:23:58,294 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:23:58,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:23:58,295 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:23:58,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:23:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1624452635, now seen corresponding path program 1 times [2022-12-06 05:23:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:23:58,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65733834] [2022-12-06 05:23:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:23:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:58,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:58,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65733834] [2022-12-06 05:23:58,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65733834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:23:58,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:23:58,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:23:58,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135501886] [2022-12-06 05:23:58,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:23:58,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:23:58,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:23:58,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:23:58,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:23:58,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 72 [2022-12-06 05:23:58,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 1448 transitions, 33797 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:23:58,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:23:58,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 72 [2022-12-06 05:23:58,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:07,641 INFO L130 PetriNetUnfolder]: 32417/42956 cut-off events. [2022-12-06 05:24:07,641 INFO L131 PetriNetUnfolder]: For 516216/516216 co-relation queries the response was YES. [2022-12-06 05:24:07,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353513 conditions, 42956 events. 32417/42956 cut-off events. For 516216/516216 co-relation queries the response was YES. Maximal size of possible extension queue 1987. Compared 234630 event pairs, 2749 based on Foata normal form. 1378/44334 useless extension candidates. Maximal degree in co-relation 325800. Up to 39280 conditions per place. [2022-12-06 05:24:08,093 INFO L137 encePairwiseOnDemand]: 39/72 looper letters, 966 selfloop transitions, 458 changer transitions 0/1424 dead transitions. [2022-12-06 05:24:08,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 1424 transitions, 34327 flow [2022-12-06 05:24:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:24:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:24:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-06 05:24:08,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2022-12-06 05:24:08,094 INFO L175 Difference]: Start difference. First operand has 120 places, 1448 transitions, 33797 flow. Second operand 5 states and 129 transitions. [2022-12-06 05:24:08,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 1424 transitions, 34327 flow [2022-12-06 05:24:14,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 1424 transitions, 33960 flow, removed 62 selfloop flow, removed 2 redundant places. [2022-12-06 05:24:14,452 INFO L231 Difference]: Finished difference. Result has 123 places, 1352 transitions, 32017 flow [2022-12-06 05:24:14,453 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=25059, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=819, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=32017, PETRI_PLACES=123, PETRI_TRANSITIONS=1352} [2022-12-06 05:24:14,453 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 66 predicate places. [2022-12-06 05:24:14,453 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:14,453 INFO L89 Accepts]: Start accepts. Operand has 123 places, 1352 transitions, 32017 flow [2022-12-06 05:24:14,459 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:14,459 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:14,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 1352 transitions, 32017 flow [2022-12-06 05:24:14,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 1352 transitions, 32017 flow [2022-12-06 05:24:16,842 INFO L130 PetriNetUnfolder]: 9858/14176 cut-off events. [2022-12-06 05:24:16,842 INFO L131 PetriNetUnfolder]: For 194723/277777 co-relation queries the response was YES. [2022-12-06 05:24:16,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121105 conditions, 14176 events. 9858/14176 cut-off events. For 194723/277777 co-relation queries the response was YES. Maximal size of possible extension queue 1187. Compared 85746 event pairs, 773 based on Foata normal form. 48/13994 useless extension candidates. Maximal degree in co-relation 120350. Up to 7429 conditions per place. [2022-12-06 05:24:17,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 1352 transitions, 32017 flow [2022-12-06 05:24:17,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 6112 [2022-12-06 05:24:17,026 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [734] $Ultimate##0-->L105: Formula: (and (= (+ v_~m4~0_105 1) v_~t~0_303) (= (+ v_~t~0_305 1) v_~m4~0_105) (= v_~t~0_305 v_~m2~0_132)) InVars {~t~0=v_~t~0_305} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_13|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_34|, ~m4~0=v_~m4~0_105, ~m2~0=v_~m2~0_132, ~t~0=v_~t~0_303} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork3_#t~post3#1, ~m4~0, ~m2~0, ~t~0] and [668] L67-->thread2EXIT: Formula: (and (= (ite (<= v_~m2~0_57 v_~s~0_629) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|) (= |v_thread2Thread1of1ForFork3_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork3_#res#1.base_41| 0) (= v_~s~0_628 (+ v_~s~0_629 1)) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27| |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|) (= (ite (= (ite (or (not (= (mod v_~b~0_232 256) 0)) (= v_~x~0_158 1)) 1 0) 0) 0 1) v_~b~0_231) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27| 0))) InVars {~b~0=v_~b~0_232, ~m2~0=v_~m2~0_57, ~x~0=v_~x~0_158, ~s~0=v_~s~0_629} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_53|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_27|, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_41|, ~b~0=v_~b~0_231, ~m2~0=v_~m2~0_57, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_27|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_41|, ~x~0=v_~x~0_158, ~s~0=v_~s~0_628} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#res#1.offset, ~b~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base, ~s~0] [2022-12-06 05:24:17,093 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:24:17,094 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2641 [2022-12-06 05:24:17,094 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 1352 transitions, 32023 flow [2022-12-06 05:24:17,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:24:17,094 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:17,094 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:17,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:24:17,094 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:24:17,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:17,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1785562257, now seen corresponding path program 1 times [2022-12-06 05:24:17,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:17,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846755953] [2022-12-06 05:24:17,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:17,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:17,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846755953] [2022-12-06 05:24:17,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846755953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:17,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:17,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:24:17,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177989414] [2022-12-06 05:24:17,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:17,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:24:17,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:17,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:24:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:24:17,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:24:17,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 1352 transitions, 32023 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:24:17,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:17,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:24:17,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:26,332 INFO L130 PetriNetUnfolder]: 33260/44599 cut-off events. [2022-12-06 05:24:26,332 INFO L131 PetriNetUnfolder]: For 591661/591661 co-relation queries the response was YES. [2022-12-06 05:24:26,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375582 conditions, 44599 events. 33260/44599 cut-off events. For 591661/591661 co-relation queries the response was YES. Maximal size of possible extension queue 2159. Compared 253552 event pairs, 2806 based on Foata normal form. 2188/46787 useless extension candidates. Maximal degree in co-relation 345956. Up to 24441 conditions per place. [2022-12-06 05:24:26,818 INFO L137 encePairwiseOnDemand]: 35/61 looper letters, 249 selfloop transitions, 1443 changer transitions 1/1693 dead transitions. [2022-12-06 05:24:26,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 1693 transitions, 42671 flow [2022-12-06 05:24:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:24:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:24:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2022-12-06 05:24:26,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3907103825136612 [2022-12-06 05:24:26,819 INFO L175 Difference]: Start difference. First operand has 123 places, 1352 transitions, 32023 flow. Second operand 6 states and 143 transitions. [2022-12-06 05:24:26,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 1693 transitions, 42671 flow [2022-12-06 05:24:33,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 1693 transitions, 42561 flow, removed 46 selfloop flow, removed 1 redundant places. [2022-12-06 05:24:33,829 INFO L231 Difference]: Finished difference. Result has 129 places, 1628 transitions, 43363 flow [2022-12-06 05:24:33,830 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=30726, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=43363, PETRI_PLACES=129, PETRI_TRANSITIONS=1628} [2022-12-06 05:24:33,830 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 72 predicate places. [2022-12-06 05:24:33,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:24:33,831 INFO L89 Accepts]: Start accepts. Operand has 129 places, 1628 transitions, 43363 flow [2022-12-06 05:24:33,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:24:33,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:24:33,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 1628 transitions, 43363 flow [2022-12-06 05:24:33,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 1628 transitions, 43363 flow [2022-12-06 05:24:36,678 INFO L130 PetriNetUnfolder]: 10068/14763 cut-off events. [2022-12-06 05:24:36,679 INFO L131 PetriNetUnfolder]: For 248175/351457 co-relation queries the response was YES. [2022-12-06 05:24:36,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139043 conditions, 14763 events. 10068/14763 cut-off events. For 248175/351457 co-relation queries the response was YES. Maximal size of possible extension queue 1305. Compared 93914 event pairs, 813 based on Foata normal form. 50/14566 useless extension candidates. Maximal degree in co-relation 138233. Up to 7516 conditions per place. [2022-12-06 05:24:36,938 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 1628 transitions, 43363 flow [2022-12-06 05:24:36,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 6860 [2022-12-06 05:24:36,948 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:24:36,948 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3117 [2022-12-06 05:24:36,948 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 1628 transitions, 43363 flow [2022-12-06 05:24:36,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:24:36,949 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:24:36,949 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:24:36,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:24:36,949 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:24:36,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:24:36,949 INFO L85 PathProgramCache]: Analyzing trace with hash -12207345, now seen corresponding path program 1 times [2022-12-06 05:24:36,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:24:36,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237293433] [2022-12-06 05:24:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:24:36,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:24:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:24:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:24:37,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:24:37,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237293433] [2022-12-06 05:24:37,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237293433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:24:37,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:24:37,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:24:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82528145] [2022-12-06 05:24:37,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:24:37,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:24:37,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:24:37,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:24:37,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:24:37,235 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:24:37,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 1628 transitions, 43363 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:24:37,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:24:37,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:24:37,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:24:50,455 INFO L130 PetriNetUnfolder]: 39057/52416 cut-off events. [2022-12-06 05:24:50,455 INFO L131 PetriNetUnfolder]: For 716563/716563 co-relation queries the response was YES. [2022-12-06 05:24:50,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464218 conditions, 52416 events. 39057/52416 cut-off events. For 716563/716563 co-relation queries the response was YES. Maximal size of possible extension queue 2652. Compared 307487 event pairs, 2327 based on Foata normal form. 406/52822 useless extension candidates. Maximal degree in co-relation 432479. Up to 24717 conditions per place. [2022-12-06 05:24:51,119 INFO L137 encePairwiseOnDemand]: 34/61 looper letters, 257 selfloop transitions, 1625 changer transitions 1/1883 dead transitions. [2022-12-06 05:24:51,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 1883 transitions, 52207 flow [2022-12-06 05:24:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:24:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:24:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2022-12-06 05:24:51,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3879781420765027 [2022-12-06 05:24:51,120 INFO L175 Difference]: Start difference. First operand has 129 places, 1628 transitions, 43363 flow. Second operand 6 states and 142 transitions. [2022-12-06 05:24:51,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 1883 transitions, 52207 flow [2022-12-06 05:25:00,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 1883 transitions, 51130 flow, removed 182 selfloop flow, removed 3 redundant places. [2022-12-06 05:25:00,895 INFO L231 Difference]: Finished difference. Result has 132 places, 1816 transitions, 51217 flow [2022-12-06 05:25:00,896 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=42499, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1448, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=51217, PETRI_PLACES=132, PETRI_TRANSITIONS=1816} [2022-12-06 05:25:00,896 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 75 predicate places. [2022-12-06 05:25:00,896 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:00,896 INFO L89 Accepts]: Start accepts. Operand has 132 places, 1816 transitions, 51217 flow [2022-12-06 05:25:00,905 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:00,906 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:00,906 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 1816 transitions, 51217 flow [2022-12-06 05:25:00,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 1816 transitions, 51217 flow [2022-12-06 05:25:05,003 INFO L130 PetriNetUnfolder]: 12239/17667 cut-off events. [2022-12-06 05:25:05,003 INFO L131 PetriNetUnfolder]: For 356014/483901 co-relation queries the response was YES. [2022-12-06 05:25:05,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172257 conditions, 17667 events. 12239/17667 cut-off events. For 356014/483901 co-relation queries the response was YES. Maximal size of possible extension queue 1548. Compared 112698 event pairs, 1035 based on Foata normal form. 38/17491 useless extension candidates. Maximal degree in co-relation 171517. Up to 9004 conditions per place. [2022-12-06 05:25:05,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 1816 transitions, 51217 flow [2022-12-06 05:25:05,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 7590 [2022-12-06 05:25:05,251 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:25:05,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4356 [2022-12-06 05:25:05,252 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 1816 transitions, 51217 flow [2022-12-06 05:25:05,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:25:05,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:05,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:05,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:25:05,252 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:25:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:05,252 INFO L85 PathProgramCache]: Analyzing trace with hash -991197884, now seen corresponding path program 1 times [2022-12-06 05:25:05,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:05,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145215855] [2022-12-06 05:25:05,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:05,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:05,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145215855] [2022-12-06 05:25:05,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145215855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:05,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:05,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:25:05,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764540264] [2022-12-06 05:25:05,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:05,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:25:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:25:05,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:25:05,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 61 [2022-12-06 05:25:05,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 1816 transitions, 51217 flow. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:25:05,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:05,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 61 [2022-12-06 05:25:05,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:25:22,426 INFO L130 PetriNetUnfolder]: 43540/58607 cut-off events. [2022-12-06 05:25:22,427 INFO L131 PetriNetUnfolder]: For 875988/875988 co-relation queries the response was YES. [2022-12-06 05:25:22,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553550 conditions, 58607 events. 43540/58607 cut-off events. For 875988/875988 co-relation queries the response was YES. Maximal size of possible extension queue 2998. Compared 351216 event pairs, 2667 based on Foata normal form. 238/58845 useless extension candidates. Maximal degree in co-relation 511123. Up to 36202 conditions per place. [2022-12-06 05:25:23,251 INFO L137 encePairwiseOnDemand]: 26/61 looper letters, 580 selfloop transitions, 1609 changer transitions 0/2189 dead transitions. [2022-12-06 05:25:23,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 2189 transitions, 62209 flow [2022-12-06 05:25:23,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:25:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:25:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 212 transitions. [2022-12-06 05:25:23,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3475409836065574 [2022-12-06 05:25:23,252 INFO L175 Difference]: Start difference. First operand has 132 places, 1816 transitions, 51217 flow. Second operand 10 states and 212 transitions. [2022-12-06 05:25:23,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 2189 transitions, 62209 flow [2022-12-06 05:25:40,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 2189 transitions, 61997 flow, removed 99 selfloop flow, removed 1 redundant places. [2022-12-06 05:25:40,511 INFO L231 Difference]: Finished difference. Result has 143 places, 2078 transitions, 62856 flow [2022-12-06 05:25:40,512 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=51039, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1816, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1378, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=62856, PETRI_PLACES=143, PETRI_TRANSITIONS=2078} [2022-12-06 05:25:40,513 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 86 predicate places. [2022-12-06 05:25:40,513 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:25:40,513 INFO L89 Accepts]: Start accepts. Operand has 143 places, 2078 transitions, 62856 flow [2022-12-06 05:25:40,525 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:25:40,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:25:40,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 2078 transitions, 62856 flow [2022-12-06 05:25:40,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 2078 transitions, 62856 flow [2022-12-06 05:25:45,681 INFO L130 PetriNetUnfolder]: 13773/19958 cut-off events. [2022-12-06 05:25:45,681 INFO L131 PetriNetUnfolder]: For 451334/652967 co-relation queries the response was YES. [2022-12-06 05:25:45,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210520 conditions, 19958 events. 13773/19958 cut-off events. For 451334/652967 co-relation queries the response was YES. Maximal size of possible extension queue 1770. Compared 130132 event pairs, 1039 based on Foata normal form. 76/19830 useless extension candidates. Maximal degree in co-relation 209706. Up to 10212 conditions per place. [2022-12-06 05:25:45,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 2078 transitions, 62856 flow [2022-12-06 05:25:45,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 8730 [2022-12-06 05:25:46,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [734] $Ultimate##0-->L105: Formula: (and (= (+ v_~m4~0_105 1) v_~t~0_303) (= (+ v_~t~0_305 1) v_~m4~0_105) (= v_~t~0_305 v_~m2~0_132)) InVars {~t~0=v_~t~0_305} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_13|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_34|, ~m4~0=v_~m4~0_105, ~m2~0=v_~m2~0_132, ~t~0=v_~t~0_303} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork3_#t~post3#1, ~m4~0, ~m2~0, ~t~0] and [541] $Ultimate##0-->L124: Formula: (and (= (+ v_~t~0_69 1) v_~t~0_68) (= v_~m5~0_9 v_~t~0_69)) InVars {~t~0=v_~t~0_69} OutVars{thread5Thread1of1ForFork4_#t~post9#1=|v_thread5Thread1of1ForFork4_#t~post9#1_1|, ~m5~0=v_~m5~0_9, ~t~0=v_~t~0_68} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_#t~post9#1, ~m5~0, ~t~0] [2022-12-06 05:25:46,027 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [734] $Ultimate##0-->L105: Formula: (and (= (+ v_~m4~0_105 1) v_~t~0_303) (= (+ v_~t~0_305 1) v_~m4~0_105) (= v_~t~0_305 v_~m2~0_132)) InVars {~t~0=v_~t~0_305} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_13|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_34|, ~m4~0=v_~m4~0_105, ~m2~0=v_~m2~0_132, ~t~0=v_~t~0_303} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork3_#t~post3#1, ~m4~0, ~m2~0, ~t~0] and [516] $Ultimate##0-->L45: Formula: (and (= v_~m1~0_9 v_~t~0_73) (= v_~t~0_72 (+ v_~t~0_73 1))) InVars {~t~0=v_~t~0_73} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|, ~m1~0=v_~m1~0_9, ~t~0=v_~t~0_72} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1, ~m1~0, ~t~0] [2022-12-06 05:25:46,049 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [734] $Ultimate##0-->L105: Formula: (and (= (+ v_~m4~0_105 1) v_~t~0_303) (= (+ v_~t~0_305 1) v_~m4~0_105) (= v_~t~0_305 v_~m2~0_132)) InVars {~t~0=v_~t~0_305} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_13|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_34|, ~m4~0=v_~m4~0_105, ~m2~0=v_~m2~0_132, ~t~0=v_~t~0_303} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork3_#t~post3#1, ~m4~0, ~m2~0, ~t~0] and [547] $Ultimate##0-->L143: Formula: (and (= v_~m6~0_9 v_~t~0_81) (= (+ v_~t~0_81 1) v_~t~0_80)) InVars {~t~0=v_~t~0_81} OutVars{~m6~0=v_~m6~0_9, thread6Thread1of1ForFork0_#t~post11#1=|v_thread6Thread1of1ForFork0_#t~post11#1_1|, ~t~0=v_~t~0_80} AuxVars[] AssignedVars[~m6~0, thread6Thread1of1ForFork0_#t~post11#1, ~t~0] [2022-12-06 05:25:46,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [734] $Ultimate##0-->L105: Formula: (and (= (+ v_~m4~0_105 1) v_~t~0_303) (= (+ v_~t~0_305 1) v_~m4~0_105) (= v_~t~0_305 v_~m2~0_132)) InVars {~t~0=v_~t~0_305} OutVars{thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_13|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_34|, ~m4~0=v_~m4~0_105, ~m2~0=v_~m2~0_132, ~t~0=v_~t~0_303} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#t~post7#1, thread2Thread1of1ForFork3_#t~post3#1, ~m4~0, ~m2~0, ~t~0] and [529] $Ultimate##0-->L86: Formula: (and (= v_~t~0_60 (+ v_~t~0_61 1)) (= v_~m3~0_9 v_~t~0_61)) InVars {~t~0=v_~t~0_61} OutVars{~m3~0=v_~m3~0_9, thread3Thread1of1ForFork5_#t~post5#1=|v_thread3Thread1of1ForFork5_#t~post5#1_1|, ~t~0=v_~t~0_60} AuxVars[] AssignedVars[~m3~0, thread3Thread1of1ForFork5_#t~post5#1, ~t~0] [2022-12-06 05:25:46,102 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:25:46,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5590 [2022-12-06 05:25:46,103 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 2077 transitions, 62907 flow [2022-12-06 05:25:46,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:25:46,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:25:46,103 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:25:46,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:25:46,103 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:25:46,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:25:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash 411805903, now seen corresponding path program 1 times [2022-12-06 05:25:46,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:25:46,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347051080] [2022-12-06 05:25:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:25:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:25:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:25:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:25:46,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:25:46,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347051080] [2022-12-06 05:25:46,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347051080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:25:46,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:25:46,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:25:46,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102901611] [2022-12-06 05:25:46,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:25:46,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:25:46,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:25:46,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:25:46,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:25:46,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 05:25:46,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 2077 transitions, 62907 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:25:46,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:25:46,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 05:25:46,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:06,241 INFO L130 PetriNetUnfolder]: 44651/60192 cut-off events. [2022-12-06 05:26:06,241 INFO L131 PetriNetUnfolder]: For 1169714/1169714 co-relation queries the response was YES. [2022-12-06 05:26:06,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614550 conditions, 60192 events. 44651/60192 cut-off events. For 1169714/1169714 co-relation queries the response was YES. Maximal size of possible extension queue 3135. Compared 363690 event pairs, 2811 based on Foata normal form. 794/60986 useless extension candidates. Maximal degree in co-relation 558156. Up to 38866 conditions per place. [2022-12-06 05:26:07,228 INFO L137 encePairwiseOnDemand]: 35/64 looper letters, 644 selfloop transitions, 1609 changer transitions 0/2253 dead transitions. [2022-12-06 05:26:07,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 2253 transitions, 71781 flow [2022-12-06 05:26:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:26:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:26:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2022-12-06 05:26:07,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2022-12-06 05:26:07,229 INFO L175 Difference]: Start difference. First operand has 142 places, 2077 transitions, 62907 flow. Second operand 6 states and 143 transitions. [2022-12-06 05:26:07,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 2253 transitions, 71781 flow [2022-12-06 05:26:24,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 2253 transitions, 71418 flow, removed 78 selfloop flow, removed 3 redundant places. [2022-12-06 05:26:24,759 INFO L231 Difference]: Finished difference. Result has 145 places, 2200 transitions, 70706 flow [2022-12-06 05:26:24,760 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=62394, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2073, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1482, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70706, PETRI_PLACES=145, PETRI_TRANSITIONS=2200} [2022-12-06 05:26:24,761 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 88 predicate places. [2022-12-06 05:26:24,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:26:24,761 INFO L89 Accepts]: Start accepts. Operand has 145 places, 2200 transitions, 70706 flow [2022-12-06 05:26:24,773 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:26:24,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:26:24,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 2200 transitions, 70706 flow [2022-12-06 05:26:24,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 2200 transitions, 70706 flow [2022-12-06 05:26:30,439 INFO L130 PetriNetUnfolder]: 14218/20596 cut-off events. [2022-12-06 05:26:30,439 INFO L131 PetriNetUnfolder]: For 508787/741914 co-relation queries the response was YES. [2022-12-06 05:26:30,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231022 conditions, 20596 events. 14218/20596 cut-off events. For 508787/741914 co-relation queries the response was YES. Maximal size of possible extension queue 1859. Compared 135275 event pairs, 1081 based on Foata normal form. 63/20451 useless extension candidates. Maximal degree in co-relation 230252. Up to 10535 conditions per place. [2022-12-06 05:26:30,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 2200 transitions, 70706 flow [2022-12-06 05:26:30,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 8966 [2022-12-06 05:26:30,775 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:26:30,776 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6015 [2022-12-06 05:26:30,776 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 2200 transitions, 70706 flow [2022-12-06 05:26:30,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-06 05:26:30,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:26:30,776 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:26:30,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:26:30,776 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:26:30,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:26:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2101968725, now seen corresponding path program 1 times [2022-12-06 05:26:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:26:30,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275593761] [2022-12-06 05:26:30,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:26:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:26:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:26:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:26:30,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:26:30,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275593761] [2022-12-06 05:26:30,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275593761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:26:30,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:26:30,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:26:30,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802692949] [2022-12-06 05:26:30,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:26:30,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:26:30,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:26:30,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:26:30,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:26:30,901 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 05:26:30,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 2200 transitions, 70706 flow. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-06 05:26:30,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:26:30,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 05:26:30,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:26:55,526 INFO L130 PetriNetUnfolder]: 48721/66040 cut-off events. [2022-12-06 05:26:55,526 INFO L131 PetriNetUnfolder]: For 1320428/1320428 co-relation queries the response was YES. [2022-12-06 05:26:56,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712762 conditions, 66040 events. 48721/66040 cut-off events. For 1320428/1320428 co-relation queries the response was YES. Maximal size of possible extension queue 3559. Compared 409909 event pairs, 2562 based on Foata normal form. 1792/67832 useless extension candidates. Maximal degree in co-relation 659548. Up to 29053 conditions per place. [2022-12-06 05:26:56,438 INFO L137 encePairwiseOnDemand]: 28/64 looper letters, 221 selfloop transitions, 2364 changer transitions 5/2590 dead transitions. [2022-12-06 05:26:56,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 2590 transitions, 83854 flow [2022-12-06 05:26:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:26:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:26:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 259 transitions. [2022-12-06 05:26:56,439 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4496527777777778 [2022-12-06 05:26:56,439 INFO L175 Difference]: Start difference. First operand has 145 places, 2200 transitions, 70706 flow. Second operand 9 states and 259 transitions. [2022-12-06 05:26:56,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 2590 transitions, 83854 flow [2022-12-06 05:27:19,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 2590 transitions, 83147 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 05:27:19,124 INFO L231 Difference]: Finished difference. Result has 156 places, 2467 transitions, 85703 flow [2022-12-06 05:27:19,126 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=69775, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2092, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=85703, PETRI_PLACES=156, PETRI_TRANSITIONS=2467} [2022-12-06 05:27:19,126 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 99 predicate places. [2022-12-06 05:27:19,126 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:27:19,126 INFO L89 Accepts]: Start accepts. Operand has 156 places, 2467 transitions, 85703 flow [2022-12-06 05:27:19,142 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:27:19,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:27:19,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 2467 transitions, 85703 flow [2022-12-06 05:27:19,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 2467 transitions, 85703 flow [2022-12-06 05:27:26,107 INFO L130 PetriNetUnfolder]: 15456/22518 cut-off events. [2022-12-06 05:27:26,107 INFO L131 PetriNetUnfolder]: For 717845/1019448 co-relation queries the response was YES. [2022-12-06 05:27:26,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283442 conditions, 22518 events. 15456/22518 cut-off events. For 717845/1019448 co-relation queries the response was YES. Maximal size of possible extension queue 2091. Compared 151568 event pairs, 1082 based on Foata normal form. 84/22390 useless extension candidates. Maximal degree in co-relation 282645. Up to 11583 conditions per place. [2022-12-06 05:27:26,659 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 2467 transitions, 85703 flow [2022-12-06 05:27:26,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 10220 [2022-12-06 05:27:26,669 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:27:26,670 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7544 [2022-12-06 05:27:26,670 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 2467 transitions, 85703 flow [2022-12-06 05:27:26,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-06 05:27:26,670 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:27:26,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:27:26,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 05:27:26,670 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:27:26,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:27:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2091389930, now seen corresponding path program 1 times [2022-12-06 05:27:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:27:26,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931055946] [2022-12-06 05:27:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:27:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:27:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:27:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:27:26,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:27:26,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931055946] [2022-12-06 05:27:26,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931055946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:27:26,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:27:26,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:27:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65134090] [2022-12-06 05:27:26,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:27:26,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:27:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:27:26,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:27:26,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:27:26,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 05:27:26,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 2467 transitions, 85703 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-06 05:27:26,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:27:26,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 05:27:26,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:27:56,468 INFO L130 PetriNetUnfolder]: 51481/70122 cut-off events. [2022-12-06 05:27:56,469 INFO L131 PetriNetUnfolder]: For 1724242/1724242 co-relation queries the response was YES. [2022-12-06 05:27:57,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823932 conditions, 70122 events. 51481/70122 cut-off events. For 1724242/1724242 co-relation queries the response was YES. Maximal size of possible extension queue 3833. Compared 442577 event pairs, 2775 based on Foata normal form. 894/71016 useless extension candidates. Maximal degree in co-relation 763385. Up to 30869 conditions per place. [2022-12-06 05:27:57,514 INFO L137 encePairwiseOnDemand]: 24/64 looper letters, 545 selfloop transitions, 2139 changer transitions 6/2690 dead transitions. [2022-12-06 05:27:57,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 2690 transitions, 95404 flow [2022-12-06 05:27:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:27:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:27:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 196 transitions. [2022-12-06 05:27:57,515 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-06 05:27:57,515 INFO L175 Difference]: Start difference. First operand has 156 places, 2467 transitions, 85703 flow. Second operand 7 states and 196 transitions. [2022-12-06 05:27:57,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 2690 transitions, 95404 flow [2022-12-06 05:28:44,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 2690 transitions, 92093 flow, removed 351 selfloop flow, removed 4 redundant places. [2022-12-06 05:28:44,126 INFO L231 Difference]: Finished difference. Result has 162 places, 2600 transitions, 94578 flow [2022-12-06 05:28:44,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=82226, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1996, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=94578, PETRI_PLACES=162, PETRI_TRANSITIONS=2600} [2022-12-06 05:28:44,128 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 105 predicate places. [2022-12-06 05:28:44,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:28:44,128 INFO L89 Accepts]: Start accepts. Operand has 162 places, 2600 transitions, 94578 flow [2022-12-06 05:28:44,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:28:44,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:28:44,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 2600 transitions, 94578 flow [2022-12-06 05:28:44,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 2600 transitions, 94578 flow [2022-12-06 05:28:52,287 INFO L130 PetriNetUnfolder]: 16131/23723 cut-off events. [2022-12-06 05:28:52,287 INFO L131 PetriNetUnfolder]: For 815560/1131858 co-relation queries the response was YES. [2022-12-06 05:28:52,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315396 conditions, 23723 events. 16131/23723 cut-off events. For 815560/1131858 co-relation queries the response was YES. Maximal size of possible extension queue 2210. Compared 163184 event pairs, 1091 based on Foata normal form. 100/23606 useless extension candidates. Maximal degree in co-relation 314453. Up to 12186 conditions per place. [2022-12-06 05:28:52,712 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 2600 transitions, 94578 flow [2022-12-06 05:28:52,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 11174 [2022-12-06 05:28:52,724 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:28:52,725 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8597 [2022-12-06 05:28:52,725 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 2600 transitions, 94578 flow [2022-12-06 05:28:52,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-06 05:28:52,725 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:28:52,725 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:28:52,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 05:28:52,725 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:28:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:28:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash -542953665, now seen corresponding path program 1 times [2022-12-06 05:28:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:28:52,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022388018] [2022-12-06 05:28:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:28:52,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:28:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:28:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:28:52,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:28:52,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022388018] [2022-12-06 05:28:52,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022388018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:28:52,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:28:52,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:28:52,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002325354] [2022-12-06 05:28:52,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:28:52,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:28:52,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:28:52,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:28:52,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:28:52,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 05:28:52,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 2600 transitions, 94578 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-06 05:28:52,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:28:52,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 05:28:52,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:29:27,598 INFO L130 PetriNetUnfolder]: 53182/73341 cut-off events. [2022-12-06 05:29:27,598 INFO L131 PetriNetUnfolder]: For 2163971/2163971 co-relation queries the response was YES. [2022-12-06 05:29:28,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908784 conditions, 73341 events. 53182/73341 cut-off events. For 2163971/2163971 co-relation queries the response was YES. Maximal size of possible extension queue 4215. Compared 482735 event pairs, 2444 based on Foata normal form. 3778/77119 useless extension candidates. Maximal degree in co-relation 829118. Up to 33071 conditions per place. [2022-12-06 05:29:28,723 INFO L137 encePairwiseOnDemand]: 27/64 looper letters, 201 selfloop transitions, 2841 changer transitions 11/3053 dead transitions. [2022-12-06 05:29:28,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 3053 transitions, 113595 flow [2022-12-06 05:29:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:29:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:29:28,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2022-12-06 05:29:28,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.455078125 [2022-12-06 05:29:28,724 INFO L175 Difference]: Start difference. First operand has 162 places, 2600 transitions, 94578 flow. Second operand 8 states and 233 transitions. [2022-12-06 05:29:28,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 3053 transitions, 113595 flow [2022-12-06 05:30:12,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 3053 transitions, 113314 flow, removed 132 selfloop flow, removed 1 redundant places. [2022-12-06 05:30:12,983 INFO L231 Difference]: Finished difference. Result has 170 places, 2945 transitions, 114288 flow [2022-12-06 05:30:12,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=92828, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2435, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114288, PETRI_PLACES=170, PETRI_TRANSITIONS=2945} [2022-12-06 05:30:12,985 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 113 predicate places. [2022-12-06 05:30:12,985 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:30:12,985 INFO L89 Accepts]: Start accepts. Operand has 170 places, 2945 transitions, 114288 flow [2022-12-06 05:30:13,005 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:30:13,005 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:30:13,005 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 2945 transitions, 114288 flow [2022-12-06 05:30:13,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 2945 transitions, 114288 flow [2022-12-06 05:30:23,260 INFO L130 PetriNetUnfolder]: 16669/24937 cut-off events. [2022-12-06 05:30:23,261 INFO L131 PetriNetUnfolder]: For 934181/1276094 co-relation queries the response was YES. [2022-12-06 05:30:23,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357996 conditions, 24937 events. 16669/24937 cut-off events. For 934181/1276094 co-relation queries the response was YES. Maximal size of possible extension queue 2431. Compared 179674 event pairs, 1109 based on Foata normal form. 83/24817 useless extension candidates. Maximal degree in co-relation 357066. Up to 13212 conditions per place. [2022-12-06 05:30:23,804 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 2945 transitions, 114288 flow [2022-12-06 05:30:23,804 INFO L188 LiptonReduction]: Number of co-enabled transitions 12236 [2022-12-06 05:30:23,816 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:30:23,816 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10831 [2022-12-06 05:30:23,816 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 2945 transitions, 114288 flow [2022-12-06 05:30:23,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-06 05:30:23,817 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:30:23,817 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:30:23,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 05:30:23,817 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:30:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:30:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1773758992, now seen corresponding path program 1 times [2022-12-06 05:30:23,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:30:23,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521216580] [2022-12-06 05:30:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:30:23,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:30:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:30:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:30:23,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:30:23,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521216580] [2022-12-06 05:30:23,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521216580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:30:23,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:30:23,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:30:23,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462169042] [2022-12-06 05:30:23,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:30:23,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:30:23,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:30:23,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:30:23,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:30:23,950 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 05:30:23,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 2945 transitions, 114288 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-06 05:30:23,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:30:23,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 05:30:23,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:31:06,070 INFO L130 PetriNetUnfolder]: 54472/76603 cut-off events. [2022-12-06 05:31:06,070 INFO L131 PetriNetUnfolder]: For 2738507/2738507 co-relation queries the response was YES. [2022-12-06 05:31:06,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006593 conditions, 76603 events. 54472/76603 cut-off events. For 2738507/2738507 co-relation queries the response was YES. Maximal size of possible extension queue 4809. Compared 530951 event pairs, 3425 based on Foata normal form. 4542/81145 useless extension candidates. Maximal degree in co-relation 928788. Up to 44508 conditions per place. [2022-12-06 05:31:07,377 INFO L137 encePairwiseOnDemand]: 28/64 looper letters, 1069 selfloop transitions, 2246 changer transitions 2/3317 dead transitions. [2022-12-06 05:31:07,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 3317 transitions, 133214 flow [2022-12-06 05:31:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:31:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:31:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2022-12-06 05:31:07,378 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3359375 [2022-12-06 05:31:07,378 INFO L175 Difference]: Start difference. First operand has 170 places, 2945 transitions, 114288 flow. Second operand 8 states and 172 transitions. [2022-12-06 05:31:07,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 3317 transitions, 133214 flow [2022-12-06 05:32:06,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 3317 transitions, 130850 flow, removed 337 selfloop flow, removed 4 redundant places. [2022-12-06 05:32:06,354 INFO L231 Difference]: Finished difference. Result has 176 places, 3230 transitions, 131675 flow [2022-12-06 05:32:06,356 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=103380, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1769, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=883, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=131675, PETRI_PLACES=176, PETRI_TRANSITIONS=3230} [2022-12-06 05:32:06,357 INFO L294 CegarLoopForPetriNet]: 57 programPoint places, 119 predicate places. [2022-12-06 05:32:06,357 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:32:06,357 INFO L89 Accepts]: Start accepts. Operand has 176 places, 3230 transitions, 131675 flow [2022-12-06 05:32:06,383 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:32:06,383 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:32:06,384 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 3230 transitions, 131675 flow [2022-12-06 05:32:06,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 3230 transitions, 131675 flow [2022-12-06 05:32:20,576 INFO L130 PetriNetUnfolder]: 16840/26025 cut-off events. [2022-12-06 05:32:20,576 INFO L131 PetriNetUnfolder]: For 1078313/1481244 co-relation queries the response was YES. [2022-12-06 05:32:20,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388076 conditions, 26025 events. 16840/26025 cut-off events. For 1078313/1481244 co-relation queries the response was YES. Maximal size of possible extension queue 2721. Compared 200901 event pairs, 1181 based on Foata normal form. 114/25932 useless extension candidates. Maximal degree in co-relation 387100. Up to 13829 conditions per place. [2022-12-06 05:32:21,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 3230 transitions, 131675 flow [2022-12-06 05:32:21,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 13026 [2022-12-06 05:32:21,294 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:32:21,295 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14938 [2022-12-06 05:32:21,295 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 3230 transitions, 131675 flow [2022-12-06 05:32:21,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-06 05:32:21,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:32:21,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:32:21,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 05:32:21,296 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 05:32:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:32:21,296 INFO L85 PathProgramCache]: Analyzing trace with hash 484068333, now seen corresponding path program 1 times [2022-12-06 05:32:21,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:32:21,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593095169] [2022-12-06 05:32:21,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:32:21,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:32:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:32:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:32:21,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:32:21,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593095169] [2022-12-06 05:32:21,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593095169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:32:21,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:32:21,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:32:21,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166649950] [2022-12-06 05:32:21,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:32:21,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:32:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:32:21,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:32:21,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:32:21,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 64 [2022-12-06 05:32:21,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 3230 transitions, 131675 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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-12-06 05:32:21,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:32:21,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 64 [2022-12-06 05:32:21,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:33:14,416 INFO L130 PetriNetUnfolder]: 54410/76551 cut-off events. [2022-12-06 05:33:14,416 INFO L131 PetriNetUnfolder]: For 2468648/2468648 co-relation queries the response was YES. [2022-12-06 05:33:15,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037942 conditions, 76551 events. 54410/76551 cut-off events. For 2468648/2468648 co-relation queries the response was YES. Maximal size of possible extension queue 4803. Compared 531390 event pairs, 3819 based on Foata normal form. 106/76657 useless extension candidates. Maximal degree in co-relation 959442. Up to 76107 conditions per place. [2022-12-06 05:33:15,657 INFO L137 encePairwiseOnDemand]: 41/64 looper letters, 3196 selfloop transitions, 77 changer transitions 13/3286 dead transitions. [2022-12-06 05:33:15,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 3286 transitions, 139767 flow [2022-12-06 05:33:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:33:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:33:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-06 05:33:15,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.325 [2022-12-06 05:33:15,658 INFO L175 Difference]: Start difference. First operand has 176 places, 3230 transitions, 131675 flow. Second operand 5 states and 104 transitions. [2022-12-06 05:33:15,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 3286 transitions, 139767 flow Received shutdown request... [2022-12-06 05:33:16,402 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 05:33:16,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 05:33:16,403 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-12-06 05:33:16,405 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2022-12-06 05:33:16,405 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 05:33:16,405 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 05:33:16,405 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 05:33:16,405 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 05:33:16,405 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2022-12-06 05:33:16,405 INFO L458 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:33:16,408 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:33:16,408 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:33:16,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:33:16 BasicIcfg [2022-12-06 05:33:16,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:33:16,410 INFO L158 Benchmark]: Toolchain (without parser) took 797060.77ms. Allocated memory was 179.3MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 154.9MB in the beginning and 4.0GB in the end (delta: -3.8GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2022-12-06 05:33:16,410 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:33:16,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.71ms. Allocated memory is still 179.3MB. Free memory was 154.9MB in the beginning and 137.5MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 05:33:16,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.37ms. Allocated memory is still 179.3MB. Free memory was 137.5MB in the beginning and 135.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:33:16,410 INFO L158 Benchmark]: Boogie Preprocessor took 39.70ms. Allocated memory is still 179.3MB. Free memory was 135.0MB in the beginning and 133.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:33:16,410 INFO L158 Benchmark]: RCFGBuilder took 531.20ms. Allocated memory is still 179.3MB. Free memory was 133.4MB in the beginning and 143.9MB in the end (delta: -10.6MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. [2022-12-06 05:33:16,410 INFO L158 Benchmark]: TraceAbstraction took 796209.34ms. Allocated memory was 179.3MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 142.9MB in the beginning and 4.0GB in the end (delta: -3.8GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2022-12-06 05:33:16,411 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.71ms. Allocated memory is still 179.3MB. Free memory was 154.9MB in the beginning and 137.5MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.37ms. Allocated memory is still 179.3MB. Free memory was 137.5MB in the beginning and 135.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.70ms. Allocated memory is still 179.3MB. Free memory was 135.0MB in the beginning and 133.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 531.20ms. Allocated memory is still 179.3MB. Free memory was 133.4MB in the beginning and 143.9MB in the end (delta: -10.6MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. * TraceAbstraction took 796209.34ms. Allocated memory was 179.3MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 142.9MB in the beginning and 4.0GB in the end (delta: -3.8GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 176 PlacesBefore, 57 PlacesAfterwards, 159 TransitionsBefore, 38 TransitionsAfterwards, 3042 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 68 TrivialYvCompositions, 51 ConcurrentYvCompositions, 2 ChoiceCompositions, 121 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1562, independent: 1519, independent conditional: 1519, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1562, independent: 1519, independent conditional: 0, independent unconditional: 1519, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1562, independent: 1519, independent conditional: 0, independent unconditional: 1519, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1562, independent: 1519, independent conditional: 0, independent unconditional: 1519, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1521, independent: 1485, independent conditional: 0, independent unconditional: 1485, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1521, independent: 1397, independent conditional: 0, independent unconditional: 1397, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 124, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 191, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1562, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1521, unknown conditional: 0, unknown unconditional: 1521] , Statistics on independence cache: Total cache size (in pairs): 2139, Positive cache size: 2103, Positive conditional cache size: 0, Positive unconditional cache size: 2103, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 52 PlacesBefore, 51 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 241, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 241, independent: 192, independent conditional: 70, independent unconditional: 122, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 241, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 241, independent: 192, independent conditional: 0, independent unconditional: 192, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 241, independent: 159, independent conditional: 0, independent unconditional: 159, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 39, unknown conditional: 0, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 56 PlacesBefore, 56 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188, independent: 131, independent conditional: 131, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 188, independent: 131, independent conditional: 80, independent unconditional: 51, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, independent: 131, independent conditional: 0, independent unconditional: 131, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, independent: 131, independent conditional: 0, independent unconditional: 131, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, independent: 129, independent conditional: 0, independent unconditional: 129, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 80, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 56 PlacesBefore, 56 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 900 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 32, independent unconditional: 14, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, independent: 46, independent conditional: 32, independent unconditional: 14, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 46, independent conditional: 32, independent unconditional: 14, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, independent: 44, independent conditional: 30, independent unconditional: 14, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 37, Positive conditional cache size: 2, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 66 PlacesBefore, 65 PlacesAfterwards, 168 TransitionsBefore, 167 TransitionsAfterwards, 1238 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 11, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 208 TransitionsBefore, 208 TransitionsAfterwards, 1298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 11, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 301 TransitionsBefore, 301 TransitionsAfterwards, 1954 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 11, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 526 TransitionsBefore, 526 TransitionsAfterwards, 2900 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 11, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 628 TransitionsBefore, 628 TransitionsAfterwards, 3224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 11, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 662 TransitionsBefore, 662 TransitionsAfterwards, 3324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 11, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 611 TransitionsBefore, 611 TransitionsAfterwards, 3126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 11, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 557 TransitionsBefore, 557 TransitionsAfterwards, 2854 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 11, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 743 TransitionsBefore, 743 TransitionsAfterwards, 3626 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 11, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 505 TransitionsBefore, 505 TransitionsAfterwards, 2470 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 11, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 589 TransitionsBefore, 589 TransitionsAfterwards, 2690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 46, Positive conditional cache size: 11, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 92 PlacesBefore, 91 PlacesAfterwards, 385 TransitionsBefore, 384 TransitionsAfterwards, 1674 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 12, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 586 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 47, Positive conditional cache size: 12, Positive unconditional cache size: 35, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 62 PlacesAfterwards, 109 TransitionsBefore, 108 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 54, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 64, Positive conditional cache size: 21, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 257 TransitionsBefore, 257 TransitionsAfterwards, 2162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 64, Positive conditional cache size: 21, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 77 PlacesBefore, 77 PlacesAfterwards, 419 TransitionsBefore, 419 TransitionsAfterwards, 3446 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 69, Positive conditional cache size: 26, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 88 PlacesBefore, 88 PlacesAfterwards, 702 TransitionsBefore, 702 TransitionsAfterwards, 5104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 69, Positive conditional cache size: 26, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 95 PlacesBefore, 95 PlacesAfterwards, 846 TransitionsBefore, 846 TransitionsAfterwards, 5692 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 76, Positive conditional cache size: 33, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 99 PlacesBefore, 99 PlacesAfterwards, 891 TransitionsBefore, 891 TransitionsAfterwards, 5850 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 76, Positive conditional cache size: 33, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 1211 TransitionsBefore, 1211 TransitionsAfterwards, 7566 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 76, Positive conditional cache size: 33, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 1299 TransitionsBefore, 1299 TransitionsAfterwards, 7642 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 76, Positive conditional cache size: 33, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 120 PlacesBefore, 120 PlacesAfterwards, 1448 TransitionsBefore, 1448 TransitionsAfterwards, 8104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 79, Positive conditional cache size: 36, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 123 PlacesBefore, 123 PlacesAfterwards, 1352 TransitionsBefore, 1352 TransitionsAfterwards, 6112 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 84, Positive conditional cache size: 41, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 1628 TransitionsBefore, 1628 TransitionsAfterwards, 6860 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 84, Positive conditional cache size: 41, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 132 PlacesBefore, 132 PlacesAfterwards, 1816 TransitionsBefore, 1816 TransitionsAfterwards, 7590 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 84, Positive conditional cache size: 41, Positive unconditional cache size: 43, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 143 PlacesBefore, 142 PlacesAfterwards, 2078 TransitionsBefore, 2077 TransitionsAfterwards, 8730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 95, Positive conditional cache size: 46, Positive unconditional cache size: 49, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 145 PlacesBefore, 145 PlacesAfterwards, 2200 TransitionsBefore, 2200 TransitionsAfterwards, 8966 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 95, Positive conditional cache size: 46, Positive unconditional cache size: 49, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 156 PlacesBefore, 156 PlacesAfterwards, 2467 TransitionsBefore, 2467 TransitionsAfterwards, 10220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 95, Positive conditional cache size: 46, Positive unconditional cache size: 49, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 162 PlacesBefore, 162 PlacesAfterwards, 2600 TransitionsBefore, 2600 TransitionsAfterwards, 11174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 95, Positive conditional cache size: 46, Positive unconditional cache size: 49, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 170 PlacesBefore, 170 PlacesAfterwards, 2945 TransitionsBefore, 2945 TransitionsAfterwards, 12236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 95, Positive conditional cache size: 46, Positive unconditional cache size: 49, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 176 PlacesBefore, 176 PlacesAfterwards, 3230 TransitionsBefore, 3230 TransitionsAfterwards, 13026 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 95, Positive conditional cache size: 46, Positive unconditional cache size: 49, Negative cache size: 7, Negative conditional cache size: 1, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 190]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 180]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 178]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 181]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 176]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 179]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 177]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 229 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 796.1s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 682.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1521 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1521 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1361 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16007 IncrementalHoareTripleChecker+Invalid, 17368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1361 mSolverCounterUnsat, 0 mSDtfsCounter, 16007 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131675occurred in iteration=34, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1202 NumberOfCodeBlocks, 1202 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1167 ConstructedInterpolants, 0 QuantifiedInterpolants, 4799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available [2022-12-06 05:33:16,429 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown