/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:42:13,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:42:13,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:42:13,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:42:13,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:42:13,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:42:13,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:42:13,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:42:13,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:42:13,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:42:13,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:42:13,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:42:13,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:42:13,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:42:13,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:42:13,595 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:42:13,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:42:13,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:42:13,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:42:13,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:42:13,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:42:13,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:42:13,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:42:13,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:42:13,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:42:13,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:42:13,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:42:13,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:42:13,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:42:13,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:42:13,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:42:13,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:42:13,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:42:13,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:42:13,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:42:13,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:42:13,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:42:13,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:42:13,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:42:13,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:42:13,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:42:13,618 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-RepeatedSemanticLbe.epf [2022-12-13 01:42:13,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:42:13,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:42:13,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:42:13,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:42:13,644 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:42:13,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:42:13,644 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:42:13,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:42:13,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:42:13,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:42:13,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:42:13,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:42:13,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:42:13,645 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:42:13,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:42:13,645 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:42:13,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:42:13,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:42:13,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:42:13,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:42:13,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:42:13,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:42:13,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:42:13,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:42:13,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:42:13,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:42:13,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:42:13,647 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:42:13,647 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-13 01:42:13,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:42:13,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:42:13,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:42:13,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:42:13,920 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:42:13,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2022-12-13 01:42:14,780 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:42:14,925 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:42:14,926 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2022-12-13 01:42:14,935 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943754b32/fc2fff173be548938814dbf405888980/FLAG51878d47d [2022-12-13 01:42:14,945 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/943754b32/fc2fff173be548938814dbf405888980 [2022-12-13 01:42:14,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:42:14,950 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:42:14,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:42:14,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:42:14,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:42:14,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:42:14" (1/1) ... [2022-12-13 01:42:14,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d25f135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:14, skipping insertion in model container [2022-12-13 01:42:14,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:42:14" (1/1) ... [2022-12-13 01:42:14,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:42:14,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:42:15,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,138 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-lamport.wvr.c[4210,4223] [2022-12-13 01:42:15,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:42:15,156 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:42:15,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:15,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:15,201 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-lamport.wvr.c[4210,4223] [2022-12-13 01:42:15,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:42:15,213 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:42:15,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15 WrapperNode [2022-12-13 01:42:15,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:42:15,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:42:15,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:42:15,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:42:15,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (1/1) ... [2022-12-13 01:42:15,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (1/1) ... [2022-12-13 01:42:15,261 INFO L138 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 235 [2022-12-13 01:42:15,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:42:15,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:42:15,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:42:15,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:42:15,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (1/1) ... [2022-12-13 01:42:15,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (1/1) ... [2022-12-13 01:42:15,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (1/1) ... [2022-12-13 01:42:15,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (1/1) ... [2022-12-13 01:42:15,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (1/1) ... [2022-12-13 01:42:15,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (1/1) ... [2022-12-13 01:42:15,291 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (1/1) ... [2022-12-13 01:42:15,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (1/1) ... [2022-12-13 01:42:15,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:42:15,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:42:15,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:42:15,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:42:15,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (1/1) ... [2022-12-13 01:42:15,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:42:15,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:42:15,328 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-13 01:42:15,335 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-13 01:42:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:42:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:42:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:42:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:42:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:42:15,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:42:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:42:15,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:42:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 01:42:15,357 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 01:42:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:42:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 01:42:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 01:42:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 01:42:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:42:15,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:42:15,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:42:15,359 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:42:15,448 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:42:15,449 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:42:15,684 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:42:15,731 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:42:15,731 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 01:42:15,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:42:15 BoogieIcfgContainer [2022-12-13 01:42:15,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:42:15,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:42:15,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:42:15,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:42:15,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:42:14" (1/3) ... [2022-12-13 01:42:15,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cff0e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:42:15, skipping insertion in model container [2022-12-13 01:42:15,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:15" (2/3) ... [2022-12-13 01:42:15,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cff0e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:42:15, skipping insertion in model container [2022-12-13 01:42:15,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:42:15" (3/3) ... [2022-12-13 01:42:15,738 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2022-12-13 01:42:15,756 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:42:15,757 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:42:15,757 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:42:15,820 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 01:42:15,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 172 transitions, 368 flow [2022-12-13 01:42:15,941 INFO L130 PetriNetUnfolder]: 7/169 cut-off events. [2022-12-13 01:42:15,941 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:42:15,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 169 events. 7/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-13 01:42:15,945 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 172 transitions, 368 flow [2022-12-13 01:42:15,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 159 transitions, 336 flow [2022-12-13 01:42:15,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:15,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 159 transitions, 336 flow [2022-12-13 01:42:15,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 159 transitions, 336 flow [2022-12-13 01:42:16,015 INFO L130 PetriNetUnfolder]: 7/159 cut-off events. [2022-12-13 01:42:16,015 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:42:16,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 7/159 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-13 01:42:16,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 159 transitions, 336 flow [2022-12-13 01:42:16,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 1266 [2022-12-13 01:42:21,200 INFO L241 LiptonReduction]: Total number of compositions: 127 [2022-12-13 01:42:21,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:42:21,246 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;@56c3ac96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:42:21,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 01:42:21,253 INFO L130 PetriNetUnfolder]: 1/31 cut-off events. [2022-12-13 01:42:21,253 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 01:42:21,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:21,254 INFO L214 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] [2022-12-13 01:42:21,254 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 1 more)] === [2022-12-13 01:42:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash -694790440, now seen corresponding path program 1 times [2022-12-13 01:42:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:21,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055626605] [2022-12-13 01:42:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:21,881 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-13 01:42:21,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:21,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055626605] [2022-12-13 01:42:21,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055626605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:21,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:21,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:42:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291481236] [2022-12-13 01:42:21,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:21,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:42:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:21,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:42:21,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:42:21,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 01:42:21,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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-13 01:42:21,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:21,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 01:42:21,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:22,051 INFO L130 PetriNetUnfolder]: 934/1483 cut-off events. [2022-12-13 01:42:22,052 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 01:42:22,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 1483 events. 934/1483 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5866 event pairs, 933 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 2948. Up to 1483 conditions per place. [2022-12-13 01:42:22,066 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 31 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-13 01:42:22,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 150 flow [2022-12-13 01:42:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:42:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:42:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 01:42:22,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-13 01:42:22,078 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 82 flow. Second operand 3 states and 34 transitions. [2022-12-13 01:42:22,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 150 flow [2022-12-13 01:42:22,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 01:42:22,086 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 82 flow [2022-12-13 01:42:22,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2022-12-13 01:42:22,091 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-12-13 01:42:22,091 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:22,092 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 82 flow [2022-12-13 01:42:22,094 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:22,095 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:22,095 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 82 flow [2022-12-13 01:42:22,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 82 flow [2022-12-13 01:42:22,102 INFO L130 PetriNetUnfolder]: 1/33 cut-off events. [2022-12-13 01:42:22,102 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:42:22,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-12-13 01:42:22,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 82 flow [2022-12-13 01:42:22,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-13 01:42:23,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:42:23,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1716 [2022-12-13 01:42:23,807 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 78 flow [2022-12-13 01:42:23,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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-13 01:42:23,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:23,808 INFO L214 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] [2022-12-13 01:42:23,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:42:23,811 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 1 more)] === [2022-12-13 01:42:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash 274489270, now seen corresponding path program 1 times [2022-12-13 01:42:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:23,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217046357] [2022-12-13 01:42:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:23,998 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-13 01:42:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:23,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217046357] [2022-12-13 01:42:23,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217046357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:23,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:23,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:42:23,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786262554] [2022-12-13 01:42:23,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:24,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:42:24,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:24,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:42:24,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:42:24,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 01:42:24,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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-13 01:42:24,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:24,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 01:42:24,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:24,345 INFO L130 PetriNetUnfolder]: 1344/2264 cut-off events. [2022-12-13 01:42:24,345 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-13 01:42:24,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4558 conditions, 2264 events. 1344/2264 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11797 event pairs, 243 based on Foata normal form. 30/2287 useless extension candidates. Maximal degree in co-relation 4550. Up to 695 conditions per place. [2022-12-13 01:42:24,354 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 101 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2022-12-13 01:42:24,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 119 transitions, 500 flow [2022-12-13 01:42:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:42:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:42:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2022-12-13 01:42:24,357 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 01:42:24,357 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 78 flow. Second operand 9 states and 136 transitions. [2022-12-13 01:42:24,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 119 transitions, 500 flow [2022-12-13 01:42:24,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 119 transitions, 492 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:42:24,360 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 166 flow [2022-12-13 01:42:24,360 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=166, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2022-12-13 01:42:24,361 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-13 01:42:24,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:24,361 INFO L89 Accepts]: Start accepts. Operand has 48 places, 46 transitions, 166 flow [2022-12-13 01:42:24,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:24,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:24,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions, 166 flow [2022-12-13 01:42:24,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions, 166 flow [2022-12-13 01:42:24,374 INFO L130 PetriNetUnfolder]: 10/89 cut-off events. [2022-12-13 01:42:24,375 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 01:42:24,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 89 events. 10/89 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 312 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 126. Up to 8 conditions per place. [2022-12-13 01:42:24,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 46 transitions, 166 flow [2022-12-13 01:42:24,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-13 01:42:24,407 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] $Ultimate##0-->L88: Formula: (and (= v_~e2~0_17 1) (= v_~tmp2~0_5 v_~n1~0_22)) InVars {~n1~0=v_~n1~0_22} OutVars{~n1~0=v_~n1~0_22, ~tmp2~0=v_~tmp2~0_5, ~e2~0=v_~e2~0_17} AuxVars[] AssignedVars[~tmp2~0, ~e2~0] and [602] L74-->thread1EXIT: Formula: (and (= v_~n1~0_58 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_9| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_9| 0)) InVars {} OutVars{~n1~0=v_~n1~0_58, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_9|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_9|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] [2022-12-13 01:42:24,508 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:42:24,509 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 01:42:24,509 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 163 flow [2022-12-13 01:42:24,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 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-13 01:42:24,509 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:24,510 INFO L214 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] [2022-12-13 01:42:24,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:42:24,510 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 1 more)] === [2022-12-13 01:42:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1483630388, now seen corresponding path program 1 times [2022-12-13 01:42:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:24,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367774489] [2022-12-13 01:42:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:25,160 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-13 01:42:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:25,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367774489] [2022-12-13 01:42:25,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367774489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:25,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:25,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:42:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193142079] [2022-12-13 01:42:25,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:25,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:42:25,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:25,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:42:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:42:25,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 01:42:25,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 163 flow. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:42:25,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:25,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 01:42:25,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:26,215 INFO L130 PetriNetUnfolder]: 3654/5896 cut-off events. [2022-12-13 01:42:26,215 INFO L131 PetriNetUnfolder]: For 2113/2113 co-relation queries the response was YES. [2022-12-13 01:42:26,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14178 conditions, 5896 events. 3654/5896 cut-off events. For 2113/2113 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 33693 event pairs, 951 based on Foata normal form. 2/5896 useless extension candidates. Maximal degree in co-relation 6846. Up to 1855 conditions per place. [2022-12-13 01:42:26,250 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 212 selfloop transitions, 32 changer transitions 25/269 dead transitions. [2022-12-13 01:42:26,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 269 transitions, 1498 flow [2022-12-13 01:42:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:42:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:42:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 203 transitions. [2022-12-13 01:42:26,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2022-12-13 01:42:26,254 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 163 flow. Second operand 14 states and 203 transitions. [2022-12-13 01:42:26,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 269 transitions, 1498 flow [2022-12-13 01:42:26,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 269 transitions, 1498 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 01:42:26,270 INFO L231 Difference]: Finished difference. Result has 65 places, 80 transitions, 367 flow [2022-12-13 01:42:26,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=367, PETRI_PLACES=65, PETRI_TRANSITIONS=80} [2022-12-13 01:42:26,271 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2022-12-13 01:42:26,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:26,271 INFO L89 Accepts]: Start accepts. Operand has 65 places, 80 transitions, 367 flow [2022-12-13 01:42:26,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:26,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:26,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 80 transitions, 367 flow [2022-12-13 01:42:26,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 80 transitions, 367 flow [2022-12-13 01:42:26,306 INFO L130 PetriNetUnfolder]: 184/703 cut-off events. [2022-12-13 01:42:26,306 INFO L131 PetriNetUnfolder]: For 259/259 co-relation queries the response was YES. [2022-12-13 01:42:26,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 703 events. 184/703 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5374 event pairs, 20 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 1459. Up to 134 conditions per place. [2022-12-13 01:42:26,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 80 transitions, 367 flow [2022-12-13 01:42:26,312 INFO L226 LiptonReduction]: Number of co-enabled transitions 1012 [2022-12-13 01:42:26,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [505] L68-->L71: Formula: (= v_~i~0_24 (select (select |v_#memory_int_30| v_~f~0.base_19) (+ v_~f~0.offset_19 (* v_~i1~0_7 4)))) InVars {#memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.base=v_~f~0.base_19, ~f~0.offset=v_~f~0.offset_19} OutVars{~i~0=v_~i~0_24, ~f~0.base=v_~f~0.base_19, #memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~f~0.offset=v_~f~0.offset_19} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~mem1#1] [2022-12-13 01:42:26,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [505] L68-->L71: Formula: (= v_~i~0_24 (select (select |v_#memory_int_30| v_~f~0.base_19) (+ v_~f~0.offset_19 (* v_~i1~0_7 4)))) InVars {#memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.base=v_~f~0.base_19, ~f~0.offset=v_~f~0.offset_19} OutVars{~i~0=v_~i~0_24, ~f~0.base=v_~f~0.base_19, #memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~f~0.offset=v_~f~0.offset_19} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~mem1#1] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:42:26,448 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [505] L68-->L71: Formula: (= v_~i~0_24 (select (select |v_#memory_int_30| v_~f~0.base_19) (+ v_~f~0.offset_19 (* v_~i1~0_7 4)))) InVars {#memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.base=v_~f~0.base_19, ~f~0.offset=v_~f~0.offset_19} OutVars{~i~0=v_~i~0_24, ~f~0.base=v_~f~0.base_19, #memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~f~0.offset=v_~f~0.offset_19} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~mem1#1] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:42:26,476 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:42:26,524 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:42:26,543 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [505] L68-->L71: Formula: (= v_~i~0_24 (select (select |v_#memory_int_30| v_~f~0.base_19) (+ v_~f~0.offset_19 (* v_~i1~0_7 4)))) InVars {#memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.base=v_~f~0.base_19, ~f~0.offset=v_~f~0.offset_19} OutVars{~i~0=v_~i~0_24, ~f~0.base=v_~f~0.base_19, #memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~f~0.offset=v_~f~0.offset_19} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~mem1#1] [2022-12-13 01:42:26,559 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:42:26,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-13 01:42:26,560 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 77 transitions, 370 flow [2022-12-13 01:42:26,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:42:26,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:26,561 INFO L214 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] [2022-12-13 01:42:26,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:42:26,561 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 1 more)] === [2022-12-13 01:42:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:26,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1665845322, now seen corresponding path program 1 times [2022-12-13 01:42:26,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:26,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997133782] [2022-12-13 01:42:26,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:26,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:27,268 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-13 01:42:27,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:27,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997133782] [2022-12-13 01:42:27,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997133782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:27,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:27,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 01:42:27,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807997812] [2022-12-13 01:42:27,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:27,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 01:42:27,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:27,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 01:42:27,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-12-13 01:42:27,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 01:42:27,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 77 transitions, 370 flow. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 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-13 01:42:27,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:27,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 01:42:27,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:28,188 INFO L130 PetriNetUnfolder]: 4225/6817 cut-off events. [2022-12-13 01:42:28,189 INFO L131 PetriNetUnfolder]: For 5486/5486 co-relation queries the response was YES. [2022-12-13 01:42:28,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20404 conditions, 6817 events. 4225/6817 cut-off events. For 5486/5486 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 40577 event pairs, 1588 based on Foata normal form. 4/6821 useless extension candidates. Maximal degree in co-relation 20383. Up to 2351 conditions per place. [2022-12-13 01:42:28,213 INFO L137 encePairwiseOnDemand]: 26/41 looper letters, 47 selfloop transitions, 2 changer transitions 197/246 dead transitions. [2022-12-13 01:42:28,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 246 transitions, 1571 flow [2022-12-13 01:42:28,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:42:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:42:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2022-12-13 01:42:28,214 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2022-12-13 01:42:28,214 INFO L175 Difference]: Start difference. First operand has 60 places, 77 transitions, 370 flow. Second operand 11 states and 187 transitions. [2022-12-13 01:42:28,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 246 transitions, 1571 flow [2022-12-13 01:42:28,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 246 transitions, 1539 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-13 01:42:28,288 INFO L231 Difference]: Finished difference. Result has 74 places, 49 transitions, 235 flow [2022-12-13 01:42:28,288 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=235, PETRI_PLACES=74, PETRI_TRANSITIONS=49} [2022-12-13 01:42:28,289 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2022-12-13 01:42:28,290 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:28,290 INFO L89 Accepts]: Start accepts. Operand has 74 places, 49 transitions, 235 flow [2022-12-13 01:42:28,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:28,292 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:28,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 49 transitions, 235 flow [2022-12-13 01:42:28,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 235 flow [2022-12-13 01:42:28,304 INFO L130 PetriNetUnfolder]: 59/227 cut-off events. [2022-12-13 01:42:28,304 INFO L131 PetriNetUnfolder]: For 257/287 co-relation queries the response was YES. [2022-12-13 01:42:28,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 227 events. 59/227 cut-off events. For 257/287 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1143 event pairs, 9 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 573. Up to 60 conditions per place. [2022-12-13 01:42:28,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 49 transitions, 235 flow [2022-12-13 01:42:28,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-13 01:42:29,560 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:42:29,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1275 [2022-12-13 01:42:29,565 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 229 flow [2022-12-13 01:42:29,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 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-13 01:42:29,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:29,565 INFO L214 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] [2022-12-13 01:42:29,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:42:29,565 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 1 more)] === [2022-12-13 01:42:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:29,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1751110330, now seen corresponding path program 1 times [2022-12-13 01:42:29,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:29,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146673006] [2022-12-13 01:42:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:29,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:31,322 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-13 01:42:31,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:31,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146673006] [2022-12-13 01:42:31,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146673006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:31,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:31,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:42:31,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499047154] [2022-12-13 01:42:31,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:31,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:42:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:42:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:42:31,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 01:42:31,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 229 flow. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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-13 01:42:31,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:31,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 01:42:31,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:32,458 INFO L130 PetriNetUnfolder]: 3719/6030 cut-off events. [2022-12-13 01:42:32,459 INFO L131 PetriNetUnfolder]: For 9205/9205 co-relation queries the response was YES. [2022-12-13 01:42:32,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19688 conditions, 6030 events. 3719/6030 cut-off events. For 9205/9205 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 35238 event pairs, 731 based on Foata normal form. 2/6032 useless extension candidates. Maximal degree in co-relation 19662. Up to 1887 conditions per place. [2022-12-13 01:42:32,493 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 187 selfloop transitions, 21 changer transitions 31/239 dead transitions. [2022-12-13 01:42:32,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 239 transitions, 1583 flow [2022-12-13 01:42:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:42:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:42:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2022-12-13 01:42:32,495 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5041322314049587 [2022-12-13 01:42:32,495 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 229 flow. Second operand 11 states and 183 transitions. [2022-12-13 01:42:32,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 239 transitions, 1583 flow [2022-12-13 01:42:32,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 239 transitions, 1435 flow, removed 74 selfloop flow, removed 10 redundant places. [2022-12-13 01:42:32,519 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 351 flow [2022-12-13 01:42:32,519 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=351, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2022-12-13 01:42:32,520 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2022-12-13 01:42:32,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:32,520 INFO L89 Accepts]: Start accepts. Operand has 66 places, 64 transitions, 351 flow [2022-12-13 01:42:32,521 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:32,521 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:32,522 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 64 transitions, 351 flow [2022-12-13 01:42:32,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 64 transitions, 351 flow [2022-12-13 01:42:32,557 INFO L130 PetriNetUnfolder]: 149/613 cut-off events. [2022-12-13 01:42:32,558 INFO L131 PetriNetUnfolder]: For 486/526 co-relation queries the response was YES. [2022-12-13 01:42:32,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 613 events. 149/613 cut-off events. For 486/526 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4597 event pairs, 24 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 1499. Up to 158 conditions per place. [2022-12-13 01:42:32,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 64 transitions, 351 flow [2022-12-13 01:42:32,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-13 01:42:32,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [504] L65-->L68: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:42:32,616 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [504] L65-->L68: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:42:32,630 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:42:32,675 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:42:32,675 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 01:42:32,675 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 349 flow [2022-12-13 01:42:32,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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-13 01:42:32,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:32,676 INFO L214 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] [2022-12-13 01:42:32,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:42:32,676 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 1 more)] === [2022-12-13 01:42:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:32,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2036132419, now seen corresponding path program 1 times [2022-12-13 01:42:32,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:32,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099008542] [2022-12-13 01:42:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:32,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:33,228 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-13 01:42:33,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:33,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099008542] [2022-12-13 01:42:33,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099008542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:33,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:33,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:42:33,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965765089] [2022-12-13 01:42:33,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:33,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:42:33,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:33,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:42:33,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:42:33,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 01:42:33,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 349 flow. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:33,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:33,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 01:42:33,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:34,036 INFO L130 PetriNetUnfolder]: 3527/5716 cut-off events. [2022-12-13 01:42:34,036 INFO L131 PetriNetUnfolder]: For 9314/9314 co-relation queries the response was YES. [2022-12-13 01:42:34,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19291 conditions, 5716 events. 3527/5716 cut-off events. For 9314/9314 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 33040 event pairs, 662 based on Foata normal form. 2/5718 useless extension candidates. Maximal degree in co-relation 19261. Up to 2367 conditions per place. [2022-12-13 01:42:34,062 INFO L137 encePairwiseOnDemand]: 18/37 looper letters, 175 selfloop transitions, 39 changer transitions 16/230 dead transitions. [2022-12-13 01:42:34,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 230 transitions, 1587 flow [2022-12-13 01:42:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:42:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:42:34,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2022-12-13 01:42:34,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44963144963144963 [2022-12-13 01:42:34,064 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 349 flow. Second operand 11 states and 183 transitions. [2022-12-13 01:42:34,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 230 transitions, 1587 flow [2022-12-13 01:42:34,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 230 transitions, 1525 flow, removed 31 selfloop flow, removed 3 redundant places. [2022-12-13 01:42:34,094 INFO L231 Difference]: Finished difference. Result has 74 places, 86 transitions, 625 flow [2022-12-13 01:42:34,094 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=625, PETRI_PLACES=74, PETRI_TRANSITIONS=86} [2022-12-13 01:42:34,096 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places. [2022-12-13 01:42:34,096 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:34,096 INFO L89 Accepts]: Start accepts. Operand has 74 places, 86 transitions, 625 flow [2022-12-13 01:42:34,098 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:34,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:34,099 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 86 transitions, 625 flow [2022-12-13 01:42:34,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 86 transitions, 625 flow [2022-12-13 01:42:34,137 INFO L130 PetriNetUnfolder]: 232/811 cut-off events. [2022-12-13 01:42:34,138 INFO L131 PetriNetUnfolder]: For 1203/1238 co-relation queries the response was YES. [2022-12-13 01:42:34,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2377 conditions, 811 events. 232/811 cut-off events. For 1203/1238 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6238 event pairs, 20 based on Foata normal form. 2/753 useless extension candidates. Maximal degree in co-relation 2182. Up to 165 conditions per place. [2022-12-13 01:42:34,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 86 transitions, 625 flow [2022-12-13 01:42:34,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 852 [2022-12-13 01:42:34,159 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:42:34,193 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:42:34,194 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 01:42:34,194 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 85 transitions, 624 flow [2022-12-13 01:42:34,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:34,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:34,194 INFO L214 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] [2022-12-13 01:42:34,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 01:42:34,195 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 1 more)] === [2022-12-13 01:42:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:34,196 INFO L85 PathProgramCache]: Analyzing trace with hash 532466081, now seen corresponding path program 1 times [2022-12-13 01:42:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:34,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283696095] [2022-12-13 01:42:34,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:34,261 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-13 01:42:34,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:34,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283696095] [2022-12-13 01:42:34,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283696095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:34,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:34,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:42:34,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022377634] [2022-12-13 01:42:34,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:34,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:42:34,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:34,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:42:34,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:42:34,263 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 39 [2022-12-13 01:42:34,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 85 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 11.0) 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-13 01:42:34,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:34,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 39 [2022-12-13 01:42:34,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:34,569 INFO L130 PetriNetUnfolder]: 2801/4686 cut-off events. [2022-12-13 01:42:34,570 INFO L131 PetriNetUnfolder]: For 9780/9838 co-relation queries the response was YES. [2022-12-13 01:42:34,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16955 conditions, 4686 events. 2801/4686 cut-off events. For 9780/9838 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 27933 event pairs, 1697 based on Foata normal form. 16/4682 useless extension candidates. Maximal degree in co-relation 15485. Up to 4415 conditions per place. [2022-12-13 01:42:34,592 INFO L137 encePairwiseOnDemand]: 35/39 looper letters, 84 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2022-12-13 01:42:34,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 94 transitions, 840 flow [2022-12-13 01:42:34,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:42:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:42:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-13 01:42:34,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 01:42:34,593 INFO L175 Difference]: Start difference. First operand has 73 places, 85 transitions, 624 flow. Second operand 3 states and 52 transitions. [2022-12-13 01:42:34,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 94 transitions, 840 flow [2022-12-13 01:42:34,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 94 transitions, 808 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 01:42:34,632 INFO L231 Difference]: Finished difference. Result has 73 places, 82 transitions, 583 flow [2022-12-13 01:42:34,632 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=73, PETRI_TRANSITIONS=82} [2022-12-13 01:42:34,632 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2022-12-13 01:42:34,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:34,633 INFO L89 Accepts]: Start accepts. Operand has 73 places, 82 transitions, 583 flow [2022-12-13 01:42:34,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:34,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:34,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 82 transitions, 583 flow [2022-12-13 01:42:34,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 82 transitions, 583 flow [2022-12-13 01:42:34,674 INFO L130 PetriNetUnfolder]: 219/786 cut-off events. [2022-12-13 01:42:34,674 INFO L131 PetriNetUnfolder]: For 1039/1066 co-relation queries the response was YES. [2022-12-13 01:42:34,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2278 conditions, 786 events. 219/786 cut-off events. For 1039/1066 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6135 event pairs, 23 based on Foata normal form. 1/727 useless extension candidates. Maximal degree in co-relation 2075. Up to 154 conditions per place. [2022-12-13 01:42:34,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 82 transitions, 583 flow [2022-12-13 01:42:34,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 798 [2022-12-13 01:42:34,683 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:34,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 01:42:34,684 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 82 transitions, 583 flow [2022-12-13 01:42:34,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) 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-13 01:42:34,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:34,684 INFO L214 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] [2022-12-13 01:42:34,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 01:42:34,684 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 1 more)] === [2022-12-13 01:42:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:34,685 INFO L85 PathProgramCache]: Analyzing trace with hash 282524016, now seen corresponding path program 1 times [2022-12-13 01:42:34,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:34,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679194544] [2022-12-13 01:42:34,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:34,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:35,198 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-13 01:42:35,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:35,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679194544] [2022-12-13 01:42:35,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679194544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:35,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:35,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:42:35,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196381037] [2022-12-13 01:42:35,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:35,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:42:35,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:35,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:42:35,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:42:35,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 01:42:35,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 82 transitions, 583 flow. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:35,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:35,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 01:42:35,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:35,910 INFO L130 PetriNetUnfolder]: 3336/5439 cut-off events. [2022-12-13 01:42:35,910 INFO L131 PetriNetUnfolder]: For 10299/10299 co-relation queries the response was YES. [2022-12-13 01:42:35,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19729 conditions, 5439 events. 3336/5439 cut-off events. For 10299/10299 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 31435 event pairs, 792 based on Foata normal form. 2/5441 useless extension candidates. Maximal degree in co-relation 18131. Up to 2255 conditions per place. [2022-12-13 01:42:35,976 INFO L137 encePairwiseOnDemand]: 23/39 looper letters, 156 selfloop transitions, 29 changer transitions 21/206 dead transitions. [2022-12-13 01:42:35,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 206 transitions, 1608 flow [2022-12-13 01:42:35,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:42:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:42:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2022-12-13 01:42:35,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43304843304843305 [2022-12-13 01:42:35,978 INFO L175 Difference]: Start difference. First operand has 73 places, 82 transitions, 583 flow. Second operand 9 states and 152 transitions. [2022-12-13 01:42:35,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 206 transitions, 1608 flow [2022-12-13 01:42:36,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 206 transitions, 1566 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:42:36,079 INFO L231 Difference]: Finished difference. Result has 80 places, 81 transitions, 618 flow [2022-12-13 01:42:36,079 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=618, PETRI_PLACES=80, PETRI_TRANSITIONS=81} [2022-12-13 01:42:36,081 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2022-12-13 01:42:36,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:36,081 INFO L89 Accepts]: Start accepts. Operand has 80 places, 81 transitions, 618 flow [2022-12-13 01:42:36,081 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:36,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:36,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 81 transitions, 618 flow [2022-12-13 01:42:36,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 81 transitions, 618 flow [2022-12-13 01:42:36,171 INFO L130 PetriNetUnfolder]: 217/785 cut-off events. [2022-12-13 01:42:36,171 INFO L131 PetriNetUnfolder]: For 1143/1176 co-relation queries the response was YES. [2022-12-13 01:42:36,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 785 events. 217/785 cut-off events. For 1143/1176 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6125 event pairs, 24 based on Foata normal form. 1/726 useless extension candidates. Maximal degree in co-relation 2316. Up to 155 conditions per place. [2022-12-13 01:42:36,178 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 81 transitions, 618 flow [2022-12-13 01:42:36,178 INFO L226 LiptonReduction]: Number of co-enabled transitions 772 [2022-12-13 01:42:36,180 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:36,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:42:36,197 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 618 flow [2022-12-13 01:42:36,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:36,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:36,197 INFO L214 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] [2022-12-13 01:42:36,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 01:42:36,197 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 1 more)] === [2022-12-13 01:42:36,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1598212300, now seen corresponding path program 1 times [2022-12-13 01:42:36,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:36,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200197497] [2022-12-13 01:42:36,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:36,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:36,848 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-13 01:42:36,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:36,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200197497] [2022-12-13 01:42:36,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200197497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:36,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:36,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:42:36,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992853220] [2022-12-13 01:42:36,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:36,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:42:36,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:36,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:42:36,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:42:36,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 01:42:36,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 618 flow. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:36,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:36,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 01:42:36,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:37,733 INFO L130 PetriNetUnfolder]: 3527/5802 cut-off events. [2022-12-13 01:42:37,733 INFO L131 PetriNetUnfolder]: For 12075/12075 co-relation queries the response was YES. [2022-12-13 01:42:37,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21297 conditions, 5802 events. 3527/5802 cut-off events. For 12075/12075 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 34356 event pairs, 832 based on Foata normal form. 2/5804 useless extension candidates. Maximal degree in co-relation 21256. Up to 2113 conditions per place. [2022-12-13 01:42:37,765 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 185 selfloop transitions, 35 changer transitions 16/236 dead transitions. [2022-12-13 01:42:37,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 236 transitions, 1828 flow [2022-12-13 01:42:37,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:42:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:42:37,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2022-12-13 01:42:37,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40326340326340326 [2022-12-13 01:42:37,767 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 618 flow. Second operand 11 states and 173 transitions. [2022-12-13 01:42:37,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 236 transitions, 1828 flow [2022-12-13 01:42:37,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 236 transitions, 1764 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-12-13 01:42:37,814 INFO L231 Difference]: Finished difference. Result has 84 places, 91 transitions, 727 flow [2022-12-13 01:42:37,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=727, PETRI_PLACES=84, PETRI_TRANSITIONS=91} [2022-12-13 01:42:37,815 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2022-12-13 01:42:37,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:37,815 INFO L89 Accepts]: Start accepts. Operand has 84 places, 91 transitions, 727 flow [2022-12-13 01:42:37,817 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:37,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:37,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 91 transitions, 727 flow [2022-12-13 01:42:37,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 91 transitions, 727 flow [2022-12-13 01:42:37,862 INFO L130 PetriNetUnfolder]: 220/847 cut-off events. [2022-12-13 01:42:37,862 INFO L131 PetriNetUnfolder]: For 1436/1483 co-relation queries the response was YES. [2022-12-13 01:42:37,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2631 conditions, 847 events. 220/847 cut-off events. For 1436/1483 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6877 event pairs, 23 based on Foata normal form. 2/784 useless extension candidates. Maximal degree in co-relation 2595. Up to 162 conditions per place. [2022-12-13 01:42:37,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 91 transitions, 727 flow [2022-12-13 01:42:37,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-13 01:42:37,873 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] L100-->L155-3: Formula: (and (= v_~i2~0_125 v_~i~0_258) (= |v_ULTIMATE.start_main_#t~pre17#1_59| |v_#pthreadsForks_87|) (= |v_#pthreadsForks_86| (+ |v_#pthreadsForks_87| 1)) (= |v_#memory_int_236| (store |v_#memory_int_237| |v_ULTIMATE.start_main_~#t3~0#1.base_59| (store (select |v_#memory_int_237| |v_ULTIMATE.start_main_~#t3~0#1.base_59|) |v_ULTIMATE.start_main_~#t3~0#1.offset_55| |v_ULTIMATE.start_main_#t~pre17#1_59|)))) InVars {#pthreadsForks=|v_#pthreadsForks_87|, ~i~0=v_~i~0_258, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_55|, #memory_int=|v_#memory_int_237|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_59|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_49|, #pthreadsForks=|v_#pthreadsForks_86|, ~i~0=v_~i~0_258, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_55|, #memory_int=|v_#memory_int_236|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_59|, ~i2~0=v_~i2~0_125, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_61|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_59|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ~i2~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:42:37,917 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:42:37,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-13 01:42:37,918 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 725 flow [2022-12-13 01:42:37,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:37,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:37,918 INFO L214 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] [2022-12-13 01:42:37,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 01:42:37,918 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 1 more)] === [2022-12-13 01:42:37,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:37,919 INFO L85 PathProgramCache]: Analyzing trace with hash 202111508, now seen corresponding path program 2 times [2022-12-13 01:42:37,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:37,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257886232] [2022-12-13 01:42:37,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:37,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:38,513 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-13 01:42:38,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:38,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257886232] [2022-12-13 01:42:38,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257886232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:38,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:38,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:42:38,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374442120] [2022-12-13 01:42:38,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:38,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:42:38,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:42:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:42:38,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 01:42:38,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 725 flow. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:38,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:38,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 01:42:38,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:39,185 INFO L130 PetriNetUnfolder]: 3563/5860 cut-off events. [2022-12-13 01:42:39,185 INFO L131 PetriNetUnfolder]: For 15675/15675 co-relation queries the response was YES. [2022-12-13 01:42:39,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22861 conditions, 5860 events. 3563/5860 cut-off events. For 15675/15675 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 34788 event pairs, 901 based on Foata normal form. 4/5864 useless extension candidates. Maximal degree in co-relation 22824. Up to 2101 conditions per place. [2022-12-13 01:42:39,218 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 146 selfloop transitions, 27 changer transitions 33/206 dead transitions. [2022-12-13 01:42:39,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 206 transitions, 1708 flow [2022-12-13 01:42:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:42:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:42:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-12-13 01:42:39,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2022-12-13 01:42:39,220 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 725 flow. Second operand 7 states and 143 transitions. [2022-12-13 01:42:39,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 206 transitions, 1708 flow [2022-12-13 01:42:39,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 206 transitions, 1647 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-12-13 01:42:39,307 INFO L231 Difference]: Finished difference. Result has 86 places, 85 transitions, 692 flow [2022-12-13 01:42:39,307 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=692, PETRI_PLACES=86, PETRI_TRANSITIONS=85} [2022-12-13 01:42:39,308 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2022-12-13 01:42:39,308 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:39,308 INFO L89 Accepts]: Start accepts. Operand has 86 places, 85 transitions, 692 flow [2022-12-13 01:42:39,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:39,309 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:39,309 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 85 transitions, 692 flow [2022-12-13 01:42:39,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 85 transitions, 692 flow [2022-12-13 01:42:39,372 INFO L130 PetriNetUnfolder]: 209/767 cut-off events. [2022-12-13 01:42:39,372 INFO L131 PetriNetUnfolder]: For 1282/1329 co-relation queries the response was YES. [2022-12-13 01:42:39,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2426 conditions, 767 events. 209/767 cut-off events. For 1282/1329 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5957 event pairs, 24 based on Foata normal form. 2/706 useless extension candidates. Maximal degree in co-relation 2329. Up to 144 conditions per place. [2022-12-13 01:42:39,382 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 85 transitions, 692 flow [2022-12-13 01:42:39,382 INFO L226 LiptonReduction]: Number of co-enabled transitions 884 [2022-12-13 01:42:39,387 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:39,387 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 01:42:39,387 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 85 transitions, 692 flow [2022-12-13 01:42:39,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:39,388 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:39,388 INFO L214 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] [2022-12-13 01:42:39,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 01:42:39,388 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 1 more)] === [2022-12-13 01:42:39,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1372880832, now seen corresponding path program 1 times [2022-12-13 01:42:39,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:39,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105880984] [2022-12-13 01:42:39,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:39,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:39,906 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-13 01:42:39,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:39,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105880984] [2022-12-13 01:42:39,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105880984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:39,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:39,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:42:39,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506868721] [2022-12-13 01:42:39,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:39,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:42:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:39,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:42:39,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:42:39,908 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 01:42:39,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 85 transitions, 692 flow. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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-13 01:42:39,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:39,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 01:42:39,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:40,859 INFO L130 PetriNetUnfolder]: 3526/5863 cut-off events. [2022-12-13 01:42:40,860 INFO L131 PetriNetUnfolder]: For 14052/14052 co-relation queries the response was YES. [2022-12-13 01:42:40,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22502 conditions, 5863 events. 3526/5863 cut-off events. For 14052/14052 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 35128 event pairs, 1015 based on Foata normal form. 2/5865 useless extension candidates. Maximal degree in co-relation 21720. Up to 2657 conditions per place. [2022-12-13 01:42:40,899 INFO L137 encePairwiseOnDemand]: 24/37 looper letters, 182 selfloop transitions, 21 changer transitions 31/234 dead transitions. [2022-12-13 01:42:40,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 234 transitions, 1881 flow [2022-12-13 01:42:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:42:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:42:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2022-12-13 01:42:40,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44054054054054054 [2022-12-13 01:42:40,901 INFO L175 Difference]: Start difference. First operand has 82 places, 85 transitions, 692 flow. Second operand 10 states and 163 transitions. [2022-12-13 01:42:40,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 234 transitions, 1881 flow [2022-12-13 01:42:40,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 234 transitions, 1797 flow, removed 7 selfloop flow, removed 9 redundant places. [2022-12-13 01:42:40,943 INFO L231 Difference]: Finished difference. Result has 87 places, 89 transitions, 702 flow [2022-12-13 01:42:40,943 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=702, PETRI_PLACES=87, PETRI_TRANSITIONS=89} [2022-12-13 01:42:40,944 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2022-12-13 01:42:40,944 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:40,944 INFO L89 Accepts]: Start accepts. Operand has 87 places, 89 transitions, 702 flow [2022-12-13 01:42:40,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:40,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:40,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 89 transitions, 702 flow [2022-12-13 01:42:40,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 89 transitions, 702 flow [2022-12-13 01:42:40,991 INFO L130 PetriNetUnfolder]: 217/850 cut-off events. [2022-12-13 01:42:40,991 INFO L131 PetriNetUnfolder]: For 1586/1655 co-relation queries the response was YES. [2022-12-13 01:42:40,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 850 events. 217/850 cut-off events. For 1586/1655 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6861 event pairs, 28 based on Foata normal form. 2/786 useless extension candidates. Maximal degree in co-relation 2721. Up to 158 conditions per place. [2022-12-13 01:42:40,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 89 transitions, 702 flow [2022-12-13 01:42:40,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 916 [2022-12-13 01:42:41,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [518] L106-->L109: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (and (< v_~i~0_28 v_~n~0_18) (<= 0 v_~i~0_28)) 1 0))) InVars {~n~0=v_~n~0_18, ~i~0=v_~i~0_28} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n~0=v_~n~0_18, ~i~0=v_~i~0_28} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:42:41,043 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:42:41,044 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100 [2022-12-13 01:42:41,044 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 712 flow [2022-12-13 01:42:41,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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-13 01:42:41,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:41,044 INFO L214 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] [2022-12-13 01:42:41,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 01:42:41,044 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 1 more)] === [2022-12-13 01:42:41,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1962987594, now seen corresponding path program 1 times [2022-12-13 01:42:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:41,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869179059] [2022-12-13 01:42:41,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:42:41,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:41,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869179059] [2022-12-13 01:42:41,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869179059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:41,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:41,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:42:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563732394] [2022-12-13 01:42:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:41,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:42:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:41,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:42:41,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:42:41,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-13 01:42:41,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 712 flow. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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-13 01:42:41,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:41,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-13 01:42:41,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:42,528 INFO L130 PetriNetUnfolder]: 3597/6012 cut-off events. [2022-12-13 01:42:42,528 INFO L131 PetriNetUnfolder]: For 15397/15397 co-relation queries the response was YES. [2022-12-13 01:42:42,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23604 conditions, 6012 events. 3597/6012 cut-off events. For 15397/15397 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 36572 event pairs, 934 based on Foata normal form. 2/6014 useless extension candidates. Maximal degree in co-relation 23553. Up to 2429 conditions per place. [2022-12-13 01:42:42,552 INFO L137 encePairwiseOnDemand]: 24/38 looper letters, 150 selfloop transitions, 29 changer transitions 41/220 dead transitions. [2022-12-13 01:42:42,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 220 transitions, 1804 flow [2022-12-13 01:42:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:42:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:42:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions. [2022-12-13 01:42:42,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4236842105263158 [2022-12-13 01:42:42,554 INFO L175 Difference]: Start difference. First operand has 85 places, 89 transitions, 712 flow. Second operand 10 states and 161 transitions. [2022-12-13 01:42:42,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 220 transitions, 1804 flow [2022-12-13 01:42:42,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 220 transitions, 1756 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-13 01:42:42,606 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 733 flow [2022-12-13 01:42:42,607 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=733, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2022-12-13 01:42:42,607 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2022-12-13 01:42:42,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:42,607 INFO L89 Accepts]: Start accepts. Operand has 92 places, 89 transitions, 733 flow [2022-12-13 01:42:42,608 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:42,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:42,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 89 transitions, 733 flow [2022-12-13 01:42:42,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 733 flow [2022-12-13 01:42:42,653 INFO L130 PetriNetUnfolder]: 216/867 cut-off events. [2022-12-13 01:42:42,653 INFO L131 PetriNetUnfolder]: For 1761/1861 co-relation queries the response was YES. [2022-12-13 01:42:42,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 867 events. 216/867 cut-off events. For 1761/1861 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7120 event pairs, 29 based on Foata normal form. 4/802 useless extension candidates. Maximal degree in co-relation 2830. Up to 159 conditions per place. [2022-12-13 01:42:42,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 89 transitions, 733 flow [2022-12-13 01:42:42,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 922 [2022-12-13 01:42:42,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:42:42,709 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:42:42,709 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-13 01:42:42,709 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 742 flow [2022-12-13 01:42:42,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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-13 01:42:42,709 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:42,709 INFO L214 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] [2022-12-13 01:42:42,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 01:42:42,710 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 1 more)] === [2022-12-13 01:42:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:42,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2084494631, now seen corresponding path program 2 times [2022-12-13 01:42:42,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:42,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250525151] [2022-12-13 01:42:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:42,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:42,808 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-13 01:42:42,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:42,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250525151] [2022-12-13 01:42:42,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250525151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:42,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:42,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:42:42,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453052847] [2022-12-13 01:42:42,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:42,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:42:42,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:42,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:42:42,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:42:42,809 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-13 01:42:42,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 742 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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-13 01:42:42,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:42,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-13 01:42:42,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:43,635 INFO L130 PetriNetUnfolder]: 4298/7548 cut-off events. [2022-12-13 01:42:43,636 INFO L131 PetriNetUnfolder]: For 21344/21480 co-relation queries the response was YES. [2022-12-13 01:42:43,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29940 conditions, 7548 events. 4298/7548 cut-off events. For 21344/21480 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 52204 event pairs, 1327 based on Foata normal form. 64/7569 useless extension candidates. Maximal degree in co-relation 29864. Up to 4744 conditions per place. [2022-12-13 01:42:43,693 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 225 selfloop transitions, 20 changer transitions 9/256 dead transitions. [2022-12-13 01:42:43,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 256 transitions, 2569 flow [2022-12-13 01:42:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:42:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:42:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2022-12-13 01:42:43,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41812865497076024 [2022-12-13 01:42:43,695 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 742 flow. Second operand 9 states and 143 transitions. [2022-12-13 01:42:43,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 256 transitions, 2569 flow [2022-12-13 01:42:43,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 256 transitions, 2405 flow, removed 31 selfloop flow, removed 7 redundant places. [2022-12-13 01:42:43,802 INFO L231 Difference]: Finished difference. Result has 95 places, 104 transitions, 872 flow [2022-12-13 01:42:43,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=872, PETRI_PLACES=95, PETRI_TRANSITIONS=104} [2022-12-13 01:42:43,802 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2022-12-13 01:42:43,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:43,802 INFO L89 Accepts]: Start accepts. Operand has 95 places, 104 transitions, 872 flow [2022-12-13 01:42:43,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:43,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:43,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 104 transitions, 872 flow [2022-12-13 01:42:43,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 104 transitions, 872 flow [2022-12-13 01:42:43,878 INFO L130 PetriNetUnfolder]: 307/1335 cut-off events. [2022-12-13 01:42:43,878 INFO L131 PetriNetUnfolder]: For 2574/2726 co-relation queries the response was YES. [2022-12-13 01:42:43,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4472 conditions, 1335 events. 307/1335 cut-off events. For 2574/2726 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 12375 event pairs, 39 based on Foata normal form. 4/1246 useless extension candidates. Maximal degree in co-relation 3500. Up to 232 conditions per place. [2022-12-13 01:42:43,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 104 transitions, 872 flow [2022-12-13 01:42:43,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 1108 [2022-12-13 01:42:43,898 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:43,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 97 [2022-12-13 01:42:43,899 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 104 transitions, 872 flow [2022-12-13 01:42:43,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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-13 01:42:43,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:43,899 INFO L214 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] [2022-12-13 01:42:43,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 01:42:43,899 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 1 more)] === [2022-12-13 01:42:43,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1145394487, now seen corresponding path program 3 times [2022-12-13 01:42:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:43,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155671684] [2022-12-13 01:42:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:43,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:44,000 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-13 01:42:44,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:44,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155671684] [2022-12-13 01:42:44,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155671684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:44,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:44,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:42:44,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531515800] [2022-12-13 01:42:44,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:44,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:42:44,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:44,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:42:44,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:42:44,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-13 01:42:44,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 104 transitions, 872 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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-13 01:42:44,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:44,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-13 01:42:44,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:44,785 INFO L130 PetriNetUnfolder]: 4655/8336 cut-off events. [2022-12-13 01:42:44,785 INFO L131 PetriNetUnfolder]: For 22841/23015 co-relation queries the response was YES. [2022-12-13 01:42:44,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33696 conditions, 8336 events. 4655/8336 cut-off events. For 22841/23015 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 59860 event pairs, 1488 based on Foata normal form. 64/8351 useless extension candidates. Maximal degree in co-relation 27512. Up to 5640 conditions per place. [2022-12-13 01:42:44,833 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 238 selfloop transitions, 25 changer transitions 9/274 dead transitions. [2022-12-13 01:42:44,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 274 transitions, 2633 flow [2022-12-13 01:42:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:42:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:42:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-12-13 01:42:44,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3708133971291866 [2022-12-13 01:42:44,834 INFO L175 Difference]: Start difference. First operand has 95 places, 104 transitions, 872 flow. Second operand 11 states and 155 transitions. [2022-12-13 01:42:44,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 274 transitions, 2633 flow [2022-12-13 01:42:44,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 274 transitions, 2631 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 01:42:44,941 INFO L231 Difference]: Finished difference. Result has 111 places, 113 transitions, 1041 flow [2022-12-13 01:42:44,941 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1041, PETRI_PLACES=111, PETRI_TRANSITIONS=113} [2022-12-13 01:42:44,942 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:42:44,942 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:44,942 INFO L89 Accepts]: Start accepts. Operand has 111 places, 113 transitions, 1041 flow [2022-12-13 01:42:44,943 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:44,943 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:44,943 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 113 transitions, 1041 flow [2022-12-13 01:42:44,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 113 transitions, 1041 flow [2022-12-13 01:42:45,064 INFO L130 PetriNetUnfolder]: 300/1486 cut-off events. [2022-12-13 01:42:45,064 INFO L131 PetriNetUnfolder]: For 3791/3966 co-relation queries the response was YES. [2022-12-13 01:42:45,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5193 conditions, 1486 events. 300/1486 cut-off events. For 3791/3966 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14650 event pairs, 38 based on Foata normal form. 28/1426 useless extension candidates. Maximal degree in co-relation 4305. Up to 248 conditions per place. [2022-12-13 01:42:45,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 113 transitions, 1041 flow [2022-12-13 01:42:45,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 1204 [2022-12-13 01:42:45,097 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L53-->L59: Formula: (and (= v_~e1~0_17 0) (= v_~n1~0_41 (+ v_~tmp1~0_7 1))) InVars {~tmp1~0=v_~tmp1~0_7} OutVars{~n1~0=v_~n1~0_41, ~tmp1~0=v_~tmp1~0_7, ~e1~0=v_~e1~0_17} AuxVars[] AssignedVars[~n1~0, ~e1~0] and [611] L88-->L94: Formula: (and (= v_~e2~0_37 0) (= (+ v_~tmp2~0_19 1) v_~n2~0_53)) InVars {~tmp2~0=v_~tmp2~0_19} OutVars{~n2~0=v_~n2~0_53, ~tmp2~0=v_~tmp2~0_19, ~e2~0=v_~e2~0_37} AuxVars[] AssignedVars[~n2~0, ~e2~0] [2022-12-13 01:42:45,119 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L53-->L59: Formula: (and (= v_~e1~0_17 0) (= v_~n1~0_41 (+ v_~tmp1~0_7 1))) InVars {~tmp1~0=v_~tmp1~0_7} OutVars{~n1~0=v_~n1~0_41, ~tmp1~0=v_~tmp1~0_7, ~e1~0=v_~e1~0_17} AuxVars[] AssignedVars[~n1~0, ~e1~0] and [611] L88-->L94: Formula: (and (= v_~e2~0_37 0) (= (+ v_~tmp2~0_19 1) v_~n2~0_53)) InVars {~tmp2~0=v_~tmp2~0_19} OutVars{~n2~0=v_~n2~0_53, ~tmp2~0=v_~tmp2~0_19, ~e2~0=v_~e2~0_37} AuxVars[] AssignedVars[~n2~0, ~e2~0] [2022-12-13 01:42:45,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [584] L109-->thread2EXIT: Formula: (and (= v_~n2~0_44 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_9| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_9| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_9|, ~n2~0=v_~n2~0_44, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base] and [579] L53-->L59: Formula: (and (= v_~e1~0_17 0) (= v_~n1~0_41 (+ v_~tmp1~0_7 1))) InVars {~tmp1~0=v_~tmp1~0_7} OutVars{~n1~0=v_~n1~0_41, ~tmp1~0=v_~tmp1~0_7, ~e1~0=v_~e1~0_17} AuxVars[] AssignedVars[~n1~0, ~e1~0] [2022-12-13 01:42:45,197 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:42:45,198 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-13 01:42:45,199 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 110 transitions, 1022 flow [2022-12-13 01:42:45,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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-13 01:42:45,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:45,199 INFO L214 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] [2022-12-13 01:42:45,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 01:42:45,199 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 1 more)] === [2022-12-13 01:42:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash 502782101, now seen corresponding path program 4 times [2022-12-13 01:42:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:45,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235606018] [2022-12-13 01:42:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:45,294 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-13 01:42:45,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:45,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235606018] [2022-12-13 01:42:45,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235606018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:45,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:45,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:42:45,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842032342] [2022-12-13 01:42:45,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:45,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:42:45,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:45,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:42:45,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:42:45,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 41 [2022-12-13 01:42:45,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 1022 flow. Second operand has 3 states, 3 states have (on average 11.0) 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-13 01:42:45,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:45,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 41 [2022-12-13 01:42:45,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:45,942 INFO L130 PetriNetUnfolder]: 4341/7793 cut-off events. [2022-12-13 01:42:45,942 INFO L131 PetriNetUnfolder]: For 25554/25788 co-relation queries the response was YES. [2022-12-13 01:42:46,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32787 conditions, 7793 events. 4341/7793 cut-off events. For 25554/25788 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 55812 event pairs, 2775 based on Foata normal form. 68/7823 useless extension candidates. Maximal degree in co-relation 28776. Up to 7273 conditions per place. [2022-12-13 01:42:46,044 INFO L137 encePairwiseOnDemand]: 36/41 looper letters, 108 selfloop transitions, 11 changer transitions 5/126 dead transitions. [2022-12-13 01:42:46,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 126 transitions, 1379 flow [2022-12-13 01:42:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:42:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:42:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-13 01:42:46,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4634146341463415 [2022-12-13 01:42:46,046 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 1022 flow. Second operand 3 states and 57 transitions. [2022-12-13 01:42:46,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 126 transitions, 1379 flow [2022-12-13 01:42:46,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 126 transitions, 1346 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-13 01:42:46,122 INFO L231 Difference]: Finished difference. Result has 110 places, 103 transitions, 939 flow [2022-12-13 01:42:46,122 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=939, PETRI_PLACES=110, PETRI_TRANSITIONS=103} [2022-12-13 01:42:46,123 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2022-12-13 01:42:46,123 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:46,123 INFO L89 Accepts]: Start accepts. Operand has 110 places, 103 transitions, 939 flow [2022-12-13 01:42:46,124 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:46,124 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:46,124 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 103 transitions, 939 flow [2022-12-13 01:42:46,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 103 transitions, 939 flow [2022-12-13 01:42:46,204 INFO L130 PetriNetUnfolder]: 272/1364 cut-off events. [2022-12-13 01:42:46,205 INFO L131 PetriNetUnfolder]: For 3098/3257 co-relation queries the response was YES. [2022-12-13 01:42:46,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 1364 events. 272/1364 cut-off events. For 3098/3257 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13167 event pairs, 56 based on Foata normal form. 8/1274 useless extension candidates. Maximal degree in co-relation 4252. Up to 240 conditions per place. [2022-12-13 01:42:46,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 103 transitions, 939 flow [2022-12-13 01:42:46,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 1018 [2022-12-13 01:42:46,531 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] L88-->L94: Formula: (and (= v_~e2~0_37 0) (= (+ v_~tmp2~0_19 1) v_~n2~0_53)) InVars {~tmp2~0=v_~tmp2~0_19} OutVars{~n2~0=v_~n2~0_53, ~tmp2~0=v_~tmp2~0_19, ~e2~0=v_~e2~0_37} AuxVars[] AssignedVars[~n2~0, ~e2~0] and [579] L53-->L59: Formula: (and (= v_~e1~0_17 0) (= v_~n1~0_41 (+ v_~tmp1~0_7 1))) InVars {~tmp1~0=v_~tmp1~0_7} OutVars{~n1~0=v_~n1~0_41, ~tmp1~0=v_~tmp1~0_7, ~e1~0=v_~e1~0_17} AuxVars[] AssignedVars[~n1~0, ~e1~0] [2022-12-13 01:42:46,573 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [714] L88-->L59: Formula: (and (= (+ v_~tmp1~0_127 1) v_~n1~0_231) (= v_~e2~0_175 0) (= v_~n2~0_214 (+ v_~tmp2~0_129 1)) (= v_~e1~0_141 0)) InVars {~tmp2~0=v_~tmp2~0_129, ~tmp1~0=v_~tmp1~0_127} OutVars{~n2~0=v_~n2~0_214, ~n1~0=v_~n1~0_231, ~tmp2~0=v_~tmp2~0_129, ~tmp1~0=v_~tmp1~0_127, ~e2~0=v_~e2~0_175, ~e1~0=v_~e1~0_141} AuxVars[] AssignedVars[~n2~0, ~n1~0, ~e2~0, ~e1~0] and [514] L94-->L97: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (= (mod v_~e1~0_10 256) 0) 1 0))) InVars {~e1~0=v_~e1~0_10} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] [2022-12-13 01:42:46,648 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:42:46,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 526 [2022-12-13 01:42:46,649 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 104 transitions, 975 flow [2022-12-13 01:42:46,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) 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-13 01:42:46,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:46,649 INFO L214 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] [2022-12-13 01:42:46,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 01:42:46,650 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 1 more)] === [2022-12-13 01:42:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1341991599, now seen corresponding path program 5 times [2022-12-13 01:42:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:46,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500442426] [2022-12-13 01:42:46,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:46,875 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-13 01:42:46,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:46,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500442426] [2022-12-13 01:42:46,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500442426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:46,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:46,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:42:46,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456437953] [2022-12-13 01:42:46,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:46,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:42:46,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:46,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:42:46,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:42:46,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 44 [2022-12-13 01:42:46,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 104 transitions, 975 flow. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 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-13 01:42:46,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:46,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 44 [2022-12-13 01:42:46,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:47,521 INFO L130 PetriNetUnfolder]: 2946/5435 cut-off events. [2022-12-13 01:42:47,521 INFO L131 PetriNetUnfolder]: For 18398/18506 co-relation queries the response was YES. [2022-12-13 01:42:47,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23608 conditions, 5435 events. 2946/5435 cut-off events. For 18398/18506 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 37544 event pairs, 1101 based on Foata normal form. 64/5469 useless extension candidates. Maximal degree in co-relation 21610. Up to 4396 conditions per place. [2022-12-13 01:42:47,548 INFO L137 encePairwiseOnDemand]: 32/44 looper letters, 140 selfloop transitions, 18 changer transitions 11/171 dead transitions. [2022-12-13 01:42:47,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 171 transitions, 1731 flow [2022-12-13 01:42:47,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:42:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:42:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2022-12-13 01:42:47,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29545454545454547 [2022-12-13 01:42:47,549 INFO L175 Difference]: Start difference. First operand has 110 places, 104 transitions, 975 flow. Second operand 9 states and 117 transitions. [2022-12-13 01:42:47,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 171 transitions, 1731 flow [2022-12-13 01:42:47,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 171 transitions, 1666 flow, removed 11 selfloop flow, removed 7 redundant places. [2022-12-13 01:42:47,612 INFO L231 Difference]: Finished difference. Result has 112 places, 101 transitions, 924 flow [2022-12-13 01:42:47,612 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=924, PETRI_PLACES=112, PETRI_TRANSITIONS=101} [2022-12-13 01:42:47,612 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2022-12-13 01:42:47,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:47,612 INFO L89 Accepts]: Start accepts. Operand has 112 places, 101 transitions, 924 flow [2022-12-13 01:42:47,613 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:47,613 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:47,613 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 101 transitions, 924 flow [2022-12-13 01:42:47,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 101 transitions, 924 flow [2022-12-13 01:42:47,674 INFO L130 PetriNetUnfolder]: 209/1061 cut-off events. [2022-12-13 01:42:47,674 INFO L131 PetriNetUnfolder]: For 2323/2478 co-relation queries the response was YES. [2022-12-13 01:42:47,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 1061 events. 209/1061 cut-off events. For 2323/2478 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9662 event pairs, 44 based on Foata normal form. 10/996 useless extension candidates. Maximal degree in co-relation 3264. Up to 196 conditions per place. [2022-12-13 01:42:47,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 101 transitions, 924 flow [2022-12-13 01:42:47,684 INFO L226 LiptonReduction]: Number of co-enabled transitions 930 [2022-12-13 01:42:47,733 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [611] L88-->L94: Formula: (and (= v_~e2~0_37 0) (= (+ v_~tmp2~0_19 1) v_~n2~0_53)) InVars {~tmp2~0=v_~tmp2~0_19} OutVars{~n2~0=v_~n2~0_53, ~tmp2~0=v_~tmp2~0_19, ~e2~0=v_~e2~0_37} AuxVars[] AssignedVars[~n2~0, ~e2~0] and [579] L53-->L59: Formula: (and (= v_~e1~0_17 0) (= v_~n1~0_41 (+ v_~tmp1~0_7 1))) InVars {~tmp1~0=v_~tmp1~0_7} OutVars{~n1~0=v_~n1~0_41, ~tmp1~0=v_~tmp1~0_7, ~e1~0=v_~e1~0_17} AuxVars[] AssignedVars[~n1~0, ~e1~0] [2022-12-13 01:42:47,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [717] L88-->L59: Formula: (and (= v_~e1~0_147 0) (= v_~e2~0_181 0) (= v_~n1~0_249 (+ v_~tmp1~0_135 1)) (= (+ v_~tmp2~0_137 1) v_~n2~0_226)) InVars {~tmp2~0=v_~tmp2~0_137, ~tmp1~0=v_~tmp1~0_135} OutVars{~n2~0=v_~n2~0_226, ~n1~0=v_~n1~0_249, ~tmp2~0=v_~tmp2~0_137, ~tmp1~0=v_~tmp1~0_135, ~e2~0=v_~e2~0_181, ~e1~0=v_~e1~0_147} AuxVars[] AssignedVars[~n2~0, ~n1~0, ~e2~0, ~e1~0] and [514] L94-->L97: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (not (= 0 |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (= (mod v_~e1~0_10 256) 0) 1 0))) InVars {~e1~0=v_~e1~0_10} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] [2022-12-13 01:42:47,846 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:42:47,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-13 01:42:47,847 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 101 transitions, 941 flow [2022-12-13 01:42:47,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 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-13 01:42:47,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:47,848 INFO L214 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] [2022-12-13 01:42:47,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 01:42:47,848 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 1 more)] === [2022-12-13 01:42:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:47,849 INFO L85 PathProgramCache]: Analyzing trace with hash -363404874, now seen corresponding path program 1 times [2022-12-13 01:42:47,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:47,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653368564] [2022-12-13 01:42:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:47,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:48,514 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-13 01:42:48,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:48,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653368564] [2022-12-13 01:42:48,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653368564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:48,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:48,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:42:48,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255434349] [2022-12-13 01:42:48,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:48,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:42:48,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:48,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:42:48,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:42:48,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:42:48,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 101 transitions, 941 flow. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:48,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:48,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:42:48,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:49,642 INFO L130 PetriNetUnfolder]: 3336/5919 cut-off events. [2022-12-13 01:42:49,642 INFO L131 PetriNetUnfolder]: For 18579/18579 co-relation queries the response was YES. [2022-12-13 01:42:49,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25235 conditions, 5919 events. 3336/5919 cut-off events. For 18579/18579 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 38954 event pairs, 925 based on Foata normal form. 1/5916 useless extension candidates. Maximal degree in co-relation 23278. Up to 2424 conditions per place. [2022-12-13 01:42:49,682 INFO L137 encePairwiseOnDemand]: 30/45 looper letters, 189 selfloop transitions, 33 changer transitions 19/241 dead transitions. [2022-12-13 01:42:49,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 241 transitions, 2446 flow [2022-12-13 01:42:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:42:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:42:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2022-12-13 01:42:49,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37555555555555553 [2022-12-13 01:42:49,684 INFO L175 Difference]: Start difference. First operand has 110 places, 101 transitions, 941 flow. Second operand 10 states and 169 transitions. [2022-12-13 01:42:49,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 241 transitions, 2446 flow [2022-12-13 01:42:49,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 241 transitions, 2308 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-13 01:42:49,743 INFO L231 Difference]: Finished difference. Result has 116 places, 107 transitions, 1039 flow [2022-12-13 01:42:49,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1039, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-12-13 01:42:49,743 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2022-12-13 01:42:49,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:49,744 INFO L89 Accepts]: Start accepts. Operand has 116 places, 107 transitions, 1039 flow [2022-12-13 01:42:49,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:49,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:49,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 107 transitions, 1039 flow [2022-12-13 01:42:49,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 107 transitions, 1039 flow [2022-12-13 01:42:49,812 INFO L130 PetriNetUnfolder]: 205/1057 cut-off events. [2022-12-13 01:42:49,813 INFO L131 PetriNetUnfolder]: For 2724/2849 co-relation queries the response was YES. [2022-12-13 01:42:49,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3869 conditions, 1057 events. 205/1057 cut-off events. For 2724/2849 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9696 event pairs, 37 based on Foata normal form. 9/994 useless extension candidates. Maximal degree in co-relation 3808. Up to 193 conditions per place. [2022-12-13 01:42:49,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 107 transitions, 1039 flow [2022-12-13 01:42:49,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-13 01:42:49,830 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L100-->L103: Formula: (= v_~i2~0_1 v_~i~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:42:49,887 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:42:49,888 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:42:49,888 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 1041 flow [2022-12-13 01:42:49,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:49,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:49,888 INFO L214 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] [2022-12-13 01:42:49,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 01:42:49,888 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 1 more)] === [2022-12-13 01:42:49,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:49,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1209257517, now seen corresponding path program 1 times [2022-12-13 01:42:49,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:49,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111624366] [2022-12-13 01:42:49,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:49,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:50,053 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-13 01:42:50,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:50,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111624366] [2022-12-13 01:42:50,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111624366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:50,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:50,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:42:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769960230] [2022-12-13 01:42:50,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:50,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:42:50,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:50,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:42:50,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:42:50,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 46 [2022-12-13 01:42:50,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 1041 flow. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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-13 01:42:50,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:50,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 46 [2022-12-13 01:42:50,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:50,515 INFO L130 PetriNetUnfolder]: 2232/4161 cut-off events. [2022-12-13 01:42:50,516 INFO L131 PetriNetUnfolder]: For 15220/15292 co-relation queries the response was YES. [2022-12-13 01:42:50,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18252 conditions, 4161 events. 2232/4161 cut-off events. For 15220/15292 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 27553 event pairs, 795 based on Foata normal form. 64/4204 useless extension candidates. Maximal degree in co-relation 18190. Up to 3801 conditions per place. [2022-12-13 01:42:50,542 INFO L137 encePairwiseOnDemand]: 36/46 looper letters, 101 selfloop transitions, 10 changer transitions 30/143 dead transitions. [2022-12-13 01:42:50,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 143 transitions, 1612 flow [2022-12-13 01:42:50,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:42:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:42:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2022-12-13 01:42:50,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30434782608695654 [2022-12-13 01:42:50,543 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 1041 flow. Second operand 6 states and 84 transitions. [2022-12-13 01:42:50,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 143 transitions, 1612 flow [2022-12-13 01:42:50,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 143 transitions, 1539 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-13 01:42:50,596 INFO L231 Difference]: Finished difference. Result has 112 places, 101 transitions, 945 flow [2022-12-13 01:42:50,596 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=969, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=945, PETRI_PLACES=112, PETRI_TRANSITIONS=101} [2022-12-13 01:42:50,596 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2022-12-13 01:42:50,597 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:50,597 INFO L89 Accepts]: Start accepts. Operand has 112 places, 101 transitions, 945 flow [2022-12-13 01:42:50,597 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:50,597 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:50,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 101 transitions, 945 flow [2022-12-13 01:42:50,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 945 flow [2022-12-13 01:42:50,647 INFO L130 PetriNetUnfolder]: 143/823 cut-off events. [2022-12-13 01:42:50,647 INFO L131 PetriNetUnfolder]: For 1717/1806 co-relation queries the response was YES. [2022-12-13 01:42:50,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 823 events. 143/823 cut-off events. For 1717/1806 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7307 event pairs, 20 based on Foata normal form. 1/774 useless extension candidates. Maximal degree in co-relation 2599. Up to 138 conditions per place. [2022-12-13 01:42:50,655 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 945 flow [2022-12-13 01:42:50,655 INFO L226 LiptonReduction]: Number of co-enabled transitions 888 [2022-12-13 01:42:50,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [632] $Ultimate##0-->L53: Formula: (and (= v_~e1~0_35 1) (= v_~n2~0_64 v_~tmp1~0_17)) InVars {~n2~0=v_~n2~0_64} OutVars{~n2~0=v_~n2~0_64, ~tmp1~0=v_~tmp1~0_17, ~e1~0=v_~e1~0_35} AuxVars[] AssignedVars[~tmp1~0, ~e1~0] and [538] $Ultimate##0-->L88: Formula: (and (= v_~e2~0_17 1) (= v_~tmp2~0_5 v_~n1~0_22)) InVars {~n1~0=v_~n1~0_22} OutVars{~n1~0=v_~n1~0_22, ~tmp2~0=v_~tmp2~0_5, ~e2~0=v_~e2~0_17} AuxVars[] AssignedVars[~tmp2~0, ~e2~0] [2022-12-13 01:42:50,689 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:42:50,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 01:42:50,692 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 948 flow [2022-12-13 01:42:50,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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-13 01:42:50,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:50,692 INFO L214 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] [2022-12-13 01:42:50,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 01:42:50,692 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 1 more)] === [2022-12-13 01:42:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1071456435, now seen corresponding path program 1 times [2022-12-13 01:42:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:50,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608960950] [2022-12-13 01:42:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:51,110 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-13 01:42:51,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:51,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608960950] [2022-12-13 01:42:51,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608960950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:51,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:51,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:42:51,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50596508] [2022-12-13 01:42:51,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:51,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:42:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:51,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:42:51,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:42:51,112 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:42:51,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 100 transitions, 948 flow. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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-13 01:42:51,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:51,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:42:51,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:51,728 INFO L130 PetriNetUnfolder]: 2509/4470 cut-off events. [2022-12-13 01:42:51,728 INFO L131 PetriNetUnfolder]: For 15339/15339 co-relation queries the response was YES. [2022-12-13 01:42:51,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19278 conditions, 4470 events. 2509/4470 cut-off events. For 15339/15339 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 27900 event pairs, 739 based on Foata normal form. 1/4471 useless extension candidates. Maximal degree in co-relation 17412. Up to 1742 conditions per place. [2022-12-13 01:42:51,767 INFO L137 encePairwiseOnDemand]: 32/46 looper letters, 164 selfloop transitions, 27 changer transitions 15/206 dead transitions. [2022-12-13 01:42:51,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 206 transitions, 2117 flow [2022-12-13 01:42:51,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:42:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:42:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2022-12-13 01:42:51,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4048913043478261 [2022-12-13 01:42:51,768 INFO L175 Difference]: Start difference. First operand has 107 places, 100 transitions, 948 flow. Second operand 8 states and 149 transitions. [2022-12-13 01:42:51,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 206 transitions, 2117 flow [2022-12-13 01:42:51,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 206 transitions, 1972 flow, removed 34 selfloop flow, removed 7 redundant places. [2022-12-13 01:42:51,834 INFO L231 Difference]: Finished difference. Result has 109 places, 99 transitions, 936 flow [2022-12-13 01:42:51,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=936, PETRI_PLACES=109, PETRI_TRANSITIONS=99} [2022-12-13 01:42:51,834 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2022-12-13 01:42:51,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:51,834 INFO L89 Accepts]: Start accepts. Operand has 109 places, 99 transitions, 936 flow [2022-12-13 01:42:51,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:51,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:51,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 99 transitions, 936 flow [2022-12-13 01:42:51,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 936 flow [2022-12-13 01:42:51,884 INFO L130 PetriNetUnfolder]: 139/783 cut-off events. [2022-12-13 01:42:51,884 INFO L131 PetriNetUnfolder]: For 1695/1765 co-relation queries the response was YES. [2022-12-13 01:42:51,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2721 conditions, 783 events. 139/783 cut-off events. For 1695/1765 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6727 event pairs, 21 based on Foata normal form. 3/736 useless extension candidates. Maximal degree in co-relation 2672. Up to 137 conditions per place. [2022-12-13 01:42:51,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 936 flow [2022-12-13 01:42:51,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 868 [2022-12-13 01:42:51,896 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:51,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 01:42:51,897 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 99 transitions, 936 flow [2022-12-13 01:42:51,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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-13 01:42:51,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:51,897 INFO L214 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] [2022-12-13 01:42:51,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 01:42:51,898 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 1 more)] === [2022-12-13 01:42:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1971114131, now seen corresponding path program 1 times [2022-12-13 01:42:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:51,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633235935] [2022-12-13 01:42:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:51,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:52,589 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-13 01:42:52,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:52,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633235935] [2022-12-13 01:42:52,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633235935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:52,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:52,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:42:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544301255] [2022-12-13 01:42:52,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:52,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:42:52,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:52,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:42:52,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:42:52,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:42:52,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 99 transitions, 936 flow. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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-13 01:42:52,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:52,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:42:52,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:53,278 INFO L130 PetriNetUnfolder]: 2507/4471 cut-off events. [2022-12-13 01:42:53,279 INFO L131 PetriNetUnfolder]: For 14898/14898 co-relation queries the response was YES. [2022-12-13 01:42:53,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19175 conditions, 4471 events. 2507/4471 cut-off events. For 14898/14898 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 27929 event pairs, 723 based on Foata normal form. 1/4472 useless extension candidates. Maximal degree in co-relation 19117. Up to 1681 conditions per place. [2022-12-13 01:42:53,306 INFO L137 encePairwiseOnDemand]: 32/45 looper letters, 163 selfloop transitions, 26 changer transitions 21/210 dead transitions. [2022-12-13 01:42:53,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 210 transitions, 2047 flow [2022-12-13 01:42:53,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:42:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:42:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2022-12-13 01:42:53,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2022-12-13 01:42:53,308 INFO L175 Difference]: Start difference. First operand has 107 places, 99 transitions, 936 flow. Second operand 8 states and 154 transitions. [2022-12-13 01:42:53,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 210 transitions, 2047 flow [2022-12-13 01:42:53,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 210 transitions, 1987 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-12-13 01:42:53,358 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 917 flow [2022-12-13 01:42:53,359 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=917, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2022-12-13 01:42:53,359 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2022-12-13 01:42:53,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:53,359 INFO L89 Accepts]: Start accepts. Operand has 109 places, 97 transitions, 917 flow [2022-12-13 01:42:53,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:53,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:53,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 97 transitions, 917 flow [2022-12-13 01:42:53,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 97 transitions, 917 flow [2022-12-13 01:42:53,421 INFO L130 PetriNetUnfolder]: 137/767 cut-off events. [2022-12-13 01:42:53,421 INFO L131 PetriNetUnfolder]: For 1614/1670 co-relation queries the response was YES. [2022-12-13 01:42:53,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 767 events. 137/767 cut-off events. For 1614/1670 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6541 event pairs, 21 based on Foata normal form. 3/721 useless extension candidates. Maximal degree in co-relation 2629. Up to 134 conditions per place. [2022-12-13 01:42:53,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 97 transitions, 917 flow [2022-12-13 01:42:53,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 854 [2022-12-13 01:42:53,432 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:53,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 01:42:53,433 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 97 transitions, 917 flow [2022-12-13 01:42:53,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 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-13 01:42:53,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:53,433 INFO L214 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] [2022-12-13 01:42:53,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 01:42:53,433 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 1 more)] === [2022-12-13 01:42:53,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:53,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2036756724, now seen corresponding path program 1 times [2022-12-13 01:42:53,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:53,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105644303] [2022-12-13 01:42:53,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:53,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:53,856 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-13 01:42:53,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:53,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105644303] [2022-12-13 01:42:53,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105644303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:53,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:53,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:42:53,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229011373] [2022-12-13 01:42:53,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:53,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:42:53,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:53,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:42:53,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:42:53,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 01:42:53,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 97 transitions, 917 flow. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:42:53,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:53,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 01:42:53,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:54,588 INFO L130 PetriNetUnfolder]: 2496/4451 cut-off events. [2022-12-13 01:42:54,588 INFO L131 PetriNetUnfolder]: For 14829/14829 co-relation queries the response was YES. [2022-12-13 01:42:54,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19107 conditions, 4451 events. 2496/4451 cut-off events. For 14829/14829 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 27642 event pairs, 686 based on Foata normal form. 1/4452 useless extension candidates. Maximal degree in co-relation 19049. Up to 1506 conditions per place. [2022-12-13 01:42:54,607 INFO L137 encePairwiseOnDemand]: 30/44 looper letters, 156 selfloop transitions, 26 changer transitions 44/226 dead transitions. [2022-12-13 01:42:54,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 226 transitions, 2171 flow [2022-12-13 01:42:54,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:42:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:42:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2022-12-13 01:42:54,609 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3886363636363636 [2022-12-13 01:42:54,609 INFO L175 Difference]: Start difference. First operand has 106 places, 97 transitions, 917 flow. Second operand 10 states and 171 transitions. [2022-12-13 01:42:54,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 226 transitions, 2171 flow [2022-12-13 01:42:54,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 226 transitions, 2105 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-12-13 01:42:54,645 INFO L231 Difference]: Finished difference. Result has 110 places, 91 transitions, 845 flow [2022-12-13 01:42:54,645 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=845, PETRI_PLACES=110, PETRI_TRANSITIONS=91} [2022-12-13 01:42:54,645 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2022-12-13 01:42:54,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:54,646 INFO L89 Accepts]: Start accepts. Operand has 110 places, 91 transitions, 845 flow [2022-12-13 01:42:54,647 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:54,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:54,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 91 transitions, 845 flow [2022-12-13 01:42:54,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 91 transitions, 845 flow [2022-12-13 01:42:54,700 INFO L130 PetriNetUnfolder]: 125/717 cut-off events. [2022-12-13 01:42:54,700 INFO L131 PetriNetUnfolder]: For 1515/1573 co-relation queries the response was YES. [2022-12-13 01:42:54,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2515 conditions, 717 events. 125/717 cut-off events. For 1515/1573 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6061 event pairs, 21 based on Foata normal form. 3/676 useless extension candidates. Maximal degree in co-relation 2466. Up to 127 conditions per place. [2022-12-13 01:42:54,705 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 91 transitions, 845 flow [2022-12-13 01:42:54,705 INFO L226 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-13 01:42:54,713 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:54,714 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-13 01:42:54,714 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 91 transitions, 845 flow [2022-12-13 01:42:54,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:42:54,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:54,714 INFO L214 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] [2022-12-13 01:42:54,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 01:42:54,714 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 1 more)] === [2022-12-13 01:42:54,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:54,714 INFO L85 PathProgramCache]: Analyzing trace with hash 384603799, now seen corresponding path program 1 times [2022-12-13 01:42:54,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:54,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449026280] [2022-12-13 01:42:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:54,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:55,127 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-13 01:42:55,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:55,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449026280] [2022-12-13 01:42:55,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449026280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:55,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:55,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:42:55,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675940066] [2022-12-13 01:42:55,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:55,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:42:55,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:55,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:42:55,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:42:55,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 01:42:55,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 91 transitions, 845 flow. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:55,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:55,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 01:42:55,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:56,066 INFO L130 PetriNetUnfolder]: 2427/4380 cut-off events. [2022-12-13 01:42:56,066 INFO L131 PetriNetUnfolder]: For 13470/13470 co-relation queries the response was YES. [2022-12-13 01:42:56,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18501 conditions, 4380 events. 2427/4380 cut-off events. For 13470/13470 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 27289 event pairs, 688 based on Foata normal form. 4/4384 useless extension candidates. Maximal degree in co-relation 18440. Up to 1502 conditions per place. [2022-12-13 01:42:56,091 INFO L137 encePairwiseOnDemand]: 32/44 looper letters, 162 selfloop transitions, 25 changer transitions 50/237 dead transitions. [2022-12-13 01:42:56,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 237 transitions, 2210 flow [2022-12-13 01:42:56,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:42:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:42:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2022-12-13 01:42:56,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3677685950413223 [2022-12-13 01:42:56,093 INFO L175 Difference]: Start difference. First operand has 108 places, 91 transitions, 845 flow. Second operand 11 states and 178 transitions. [2022-12-13 01:42:56,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 237 transitions, 2210 flow [2022-12-13 01:42:56,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 237 transitions, 2080 flow, removed 19 selfloop flow, removed 14 redundant places. [2022-12-13 01:42:56,132 INFO L231 Difference]: Finished difference. Result has 109 places, 94 transitions, 845 flow [2022-12-13 01:42:56,132 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=845, PETRI_PLACES=109, PETRI_TRANSITIONS=94} [2022-12-13 01:42:56,133 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2022-12-13 01:42:56,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:56,133 INFO L89 Accepts]: Start accepts. Operand has 109 places, 94 transitions, 845 flow [2022-12-13 01:42:56,134 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:56,134 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:56,134 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 94 transitions, 845 flow [2022-12-13 01:42:56,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 94 transitions, 845 flow [2022-12-13 01:42:56,182 INFO L130 PetriNetUnfolder]: 112/640 cut-off events. [2022-12-13 01:42:56,182 INFO L131 PetriNetUnfolder]: For 1377/1423 co-relation queries the response was YES. [2022-12-13 01:42:56,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 640 events. 112/640 cut-off events. For 1377/1423 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5163 event pairs, 28 based on Foata normal form. 3/605 useless extension candidates. Maximal degree in co-relation 2086. Up to 109 conditions per place. [2022-12-13 01:42:56,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 94 transitions, 845 flow [2022-12-13 01:42:56,188 INFO L226 LiptonReduction]: Number of co-enabled transitions 788 [2022-12-13 01:42:56,236 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [687] L59-->L65: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79| (ite (or (<= v_~n1~0_183 v_~n2~0_175) (= v_~n2~0_175 0)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_79|) (not (= (ite (= (mod v_~e2~0_147 256) 0) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_79| 0))) InVars {~n2~0=v_~n2~0_175, ~n1~0=v_~n1~0_183, ~e2~0=v_~e2~0_147} OutVars{~n2~0=v_~n2~0_175, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, ~n1~0=v_~n1~0_183, ~e2~0=v_~e2~0_147, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_79|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:42:56,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [687] L59-->L65: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79| (ite (or (<= v_~n1~0_183 v_~n2~0_175) (= v_~n2~0_175 0)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_79|) (not (= (ite (= (mod v_~e2~0_147 256) 0) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_79| 0))) InVars {~n2~0=v_~n2~0_175, ~n1~0=v_~n1~0_183, ~e2~0=v_~e2~0_147} OutVars{~n2~0=v_~n2~0_175, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_79|, ~n1~0=v_~n1~0_183, ~e2~0=v_~e2~0_147, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_79|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:42:56,466 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:42:56,467 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 334 [2022-12-13 01:42:56,467 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 849 flow [2022-12-13 01:42:56,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-13 01:42:56,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:56,467 INFO L214 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] [2022-12-13 01:42:56,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 01:42:56,467 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 1 more)] === [2022-12-13 01:42:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:56,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1267651019, now seen corresponding path program 1 times [2022-12-13 01:42:56,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:56,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043590077] [2022-12-13 01:42:56,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:56,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:42:56,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:56,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043590077] [2022-12-13 01:42:56,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043590077] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:42:56,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690089244] [2022-12-13 01:42:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:56,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:42:56,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:42:56,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:42:56,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 01:42:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:57,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 01:42:57,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:42:57,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:42:57,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:42:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:42:57,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:42:57,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690089244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:57,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:42:57,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2022-12-13 01:42:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161234418] [2022-12-13 01:42:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:57,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:42:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:57,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:42:57,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-12-13 01:42:57,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 01:42:57,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 849 flow. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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-13 01:42:57,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:57,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 01:42:57,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:58,091 INFO L130 PetriNetUnfolder]: 2799/4936 cut-off events. [2022-12-13 01:42:58,091 INFO L131 PetriNetUnfolder]: For 16557/16557 co-relation queries the response was YES. [2022-12-13 01:42:58,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20617 conditions, 4936 events. 2799/4936 cut-off events. For 16557/16557 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 31011 event pairs, 422 based on Foata normal form. 3/4939 useless extension candidates. Maximal degree in co-relation 20549. Up to 2443 conditions per place. [2022-12-13 01:42:58,117 INFO L137 encePairwiseOnDemand]: 28/44 looper letters, 156 selfloop transitions, 36 changer transitions 30/222 dead transitions. [2022-12-13 01:42:58,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 222 transitions, 2073 flow [2022-12-13 01:42:58,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:42:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:42:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2022-12-13 01:42:58,118 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 01:42:58,118 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 849 flow. Second operand 9 states and 154 transitions. [2022-12-13 01:42:58,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 222 transitions, 2073 flow [2022-12-13 01:42:58,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 222 transitions, 1986 flow, removed 27 selfloop flow, removed 5 redundant places. [2022-12-13 01:42:58,165 INFO L231 Difference]: Finished difference. Result has 115 places, 105 transitions, 1017 flow [2022-12-13 01:42:58,166 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1017, PETRI_PLACES=115, PETRI_TRANSITIONS=105} [2022-12-13 01:42:58,166 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2022-12-13 01:42:58,166 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:58,166 INFO L89 Accepts]: Start accepts. Operand has 115 places, 105 transitions, 1017 flow [2022-12-13 01:42:58,167 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:58,167 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:58,167 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 105 transitions, 1017 flow [2022-12-13 01:42:58,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 1017 flow [2022-12-13 01:42:58,216 INFO L130 PetriNetUnfolder]: 131/799 cut-off events. [2022-12-13 01:42:58,216 INFO L131 PetriNetUnfolder]: For 2061/2144 co-relation queries the response was YES. [2022-12-13 01:42:58,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2788 conditions, 799 events. 131/799 cut-off events. For 2061/2144 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7153 event pairs, 30 based on Foata normal form. 6/759 useless extension candidates. Maximal degree in co-relation 2727. Up to 126 conditions per place. [2022-12-13 01:42:58,223 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 1017 flow [2022-12-13 01:42:58,223 INFO L226 LiptonReduction]: Number of co-enabled transitions 954 [2022-12-13 01:42:58,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:42:58,262 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:42:58,350 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [504] L65-->L68: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:42:58,392 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [504] L65-->L68: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:42:58,420 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:42:58,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-13 01:42:58,422 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 1024 flow [2022-12-13 01:42:58,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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-13 01:42:58,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:58,422 INFO L214 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] [2022-12-13 01:42:58,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 01:42:58,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 01:42:58,628 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 1 more)] === [2022-12-13 01:42:58,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:58,628 INFO L85 PathProgramCache]: Analyzing trace with hash -291639132, now seen corresponding path program 1 times [2022-12-13 01:42:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:58,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094708489] [2022-12-13 01:42:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:58,741 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-13 01:42:58,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:58,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094708489] [2022-12-13 01:42:58,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094708489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:58,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:58,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:42:58,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553532564] [2022-12-13 01:42:58,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:58,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:42:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:42:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:42:58,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 49 [2022-12-13 01:42:58,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 1024 flow. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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-13 01:42:58,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:58,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 49 [2022-12-13 01:42:58,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:59,108 INFO L130 PetriNetUnfolder]: 1083/2111 cut-off events. [2022-12-13 01:42:59,109 INFO L131 PetriNetUnfolder]: For 10637/10669 co-relation queries the response was YES. [2022-12-13 01:42:59,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9834 conditions, 2111 events. 1083/2111 cut-off events. For 10637/10669 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 12518 event pairs, 154 based on Foata normal form. 82/2188 useless extension candidates. Maximal degree in co-relation 9794. Up to 502 conditions per place. [2022-12-13 01:42:59,121 INFO L137 encePairwiseOnDemand]: 31/49 looper letters, 132 selfloop transitions, 27 changer transitions 4/165 dead transitions. [2022-12-13 01:42:59,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 165 transitions, 1711 flow [2022-12-13 01:42:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:42:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:42:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2022-12-13 01:42:59,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2673469387755102 [2022-12-13 01:42:59,122 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 1024 flow. Second operand 10 states and 131 transitions. [2022-12-13 01:42:59,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 165 transitions, 1711 flow [2022-12-13 01:42:59,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 165 transitions, 1338 flow, removed 144 selfloop flow, removed 18 redundant places. [2022-12-13 01:42:59,144 INFO L231 Difference]: Finished difference. Result has 94 places, 72 transitions, 587 flow [2022-12-13 01:42:59,144 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=587, PETRI_PLACES=94, PETRI_TRANSITIONS=72} [2022-12-13 01:42:59,145 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2022-12-13 01:42:59,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:59,145 INFO L89 Accepts]: Start accepts. Operand has 94 places, 72 transitions, 587 flow [2022-12-13 01:42:59,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:59,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:59,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 72 transitions, 587 flow [2022-12-13 01:42:59,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 72 transitions, 587 flow [2022-12-13 01:42:59,167 INFO L130 PetriNetUnfolder]: 52/404 cut-off events. [2022-12-13 01:42:59,167 INFO L131 PetriNetUnfolder]: For 899/942 co-relation queries the response was YES. [2022-12-13 01:42:59,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 404 events. 52/404 cut-off events. For 899/942 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2801 event pairs, 3 based on Foata normal form. 10/407 useless extension candidates. Maximal degree in co-relation 1008. Up to 64 conditions per place. [2022-12-13 01:42:59,170 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 72 transitions, 587 flow [2022-12-13 01:42:59,170 INFO L226 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-13 01:42:59,345 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [731] L65-->thread3EXIT: Formula: (let ((.cse0 (select |v_#memory_int_334| v_~f~0.base_257))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_263 (* v_~j~0_208 4))))) (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_35| 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_31| 0) (= v_~i1~0_193 v_~i~0_423) (= v_~j~0_207 (select .cse0 (+ v_~f~0.offset_263 (* .cse1 4)))) (= |v_thread3Thread1of1ForFork0_#res#1.base_31| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (< .cse1 v_~n~0_168) (<= 0 .cse1)) 1 0))))) InVars {~j~0=v_~j~0_208, ~i~0=v_~i~0_423, ~f~0.base=v_~f~0.base_257, #memory_int=|v_#memory_int_334|, ~n~0=v_~n~0_168, ~f~0.offset=v_~f~0.offset_263} OutVars{~j~0=v_~j~0_207, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_35|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_35|, ~i~0=v_~i~0_423, ~f~0.base=v_~f~0.base_257, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_31|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_35|, ~i1~0=v_~i1~0_193, ~f~0.offset=v_~f~0.offset_263, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_31|, #memory_int=|v_#memory_int_334|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_33|, ~n~0=v_~n~0_168} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem3#1, thread3Thread1of1ForFork0_#t~mem4#1, ~i1~0] and [505] L68-->L71: Formula: (= v_~i~0_24 (select (select |v_#memory_int_30| v_~f~0.base_19) (+ v_~f~0.offset_19 (* v_~i1~0_7 4)))) InVars {#memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.base=v_~f~0.base_19, ~f~0.offset=v_~f~0.offset_19} OutVars{~i~0=v_~i~0_24, ~f~0.base=v_~f~0.base_19, #memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, ~f~0.offset=v_~f~0.offset_19} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~mem1#1] [2022-12-13 01:42:59,991 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L53-->L59: Formula: (and (= v_~e1~0_17 0) (= v_~n1~0_41 (+ v_~tmp1~0_7 1))) InVars {~tmp1~0=v_~tmp1~0_7} OutVars{~n1~0=v_~n1~0_41, ~tmp1~0=v_~tmp1~0_7, ~e1~0=v_~e1~0_17} AuxVars[] AssignedVars[~n1~0, ~e1~0] and [745] L106-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_123| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_123| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_123|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_31| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_31| 0) (= (ite (and (<= 0 v_~i~0_505) (< v_~i~0_505 v_~n~0_201)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_123|) (= v_~n2~0_295 0)) InVars {~i~0=v_~i~0_505, ~n~0=v_~n~0_201} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_123|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_31|, ~n2~0=v_~n2~0_295, ~i~0=v_~i~0_505, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_123|, ~n~0=v_~n~0_201, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_31|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 01:43:00,169 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [632] $Ultimate##0-->L53: Formula: (and (= v_~e1~0_35 1) (= v_~n2~0_64 v_~tmp1~0_17)) InVars {~n2~0=v_~n2~0_64} OutVars{~n2~0=v_~n2~0_64, ~tmp1~0=v_~tmp1~0_17, ~e1~0=v_~e1~0_35} AuxVars[] AssignedVars[~tmp1~0, ~e1~0] and [746] L106-->thread2EXIT: Formula: (and (= v_~n2~0_297 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_33| 0) (= (ite (and (<= 0 v_~i~0_507) (< v_~i~0_507 v_~n~0_203)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_125|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_125| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_125| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_125|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_33| 0)) InVars {~i~0=v_~i~0_507, ~n~0=v_~n~0_203} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_125|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_33|, ~n2~0=v_~n2~0_297, ~i~0=v_~i~0_507, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_125|, ~n~0=v_~n~0_203, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_33|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 01:43:00,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:43:00,335 INFO L241 LiptonReduction]: Total number of compositions: 9 [2022-12-13 01:43:00,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1190 [2022-12-13 01:43:00,336 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 67 transitions, 622 flow [2022-12-13 01:43:00,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 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-13 01:43:00,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:00,337 INFO L214 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] [2022-12-13 01:43:00,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 01:43:00,337 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 1 more)] === [2022-12-13 01:43:00,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:00,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1930040879, now seen corresponding path program 1 times [2022-12-13 01:43:00,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:00,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487180846] [2022-12-13 01:43:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:43:00,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:00,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487180846] [2022-12-13 01:43:00,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487180846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:43:00,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956350935] [2022-12-13 01:43:00,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:00,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:00,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:43:00,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:43:00,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 01:43:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:00,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 01:43:00,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:43:00,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:43:00,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:43:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:43:00,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:43:00,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956350935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:00,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:43:00,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 01:43:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418671442] [2022-12-13 01:43:00,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:00,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:43:00,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:01,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:43:01,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:43:01,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:43:01,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 67 transitions, 622 flow. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-13 01:43:01,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:01,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:43:01,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:01,219 INFO L130 PetriNetUnfolder]: 800/1555 cut-off events. [2022-12-13 01:43:01,219 INFO L131 PetriNetUnfolder]: For 8201/8201 co-relation queries the response was YES. [2022-12-13 01:43:01,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 1555 events. 800/1555 cut-off events. For 8201/8201 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8790 event pairs, 157 based on Foata normal form. 3/1558 useless extension candidates. Maximal degree in co-relation 5941. Up to 1059 conditions per place. [2022-12-13 01:43:01,227 INFO L137 encePairwiseOnDemand]: 35/48 looper letters, 93 selfloop transitions, 18 changer transitions 11/122 dead transitions. [2022-12-13 01:43:01,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 122 transitions, 1269 flow [2022-12-13 01:43:01,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:43:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:43:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-13 01:43:01,227 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 01:43:01,228 INFO L175 Difference]: Start difference. First operand has 86 places, 67 transitions, 622 flow. Second operand 6 states and 108 transitions. [2022-12-13 01:43:01,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 122 transitions, 1269 flow [2022-12-13 01:43:01,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 122 transitions, 1134 flow, removed 34 selfloop flow, removed 9 redundant places. [2022-12-13 01:43:01,245 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 640 flow [2022-12-13 01:43:01,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=640, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2022-12-13 01:43:01,245 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2022-12-13 01:43:01,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:01,245 INFO L89 Accepts]: Start accepts. Operand has 85 places, 71 transitions, 640 flow [2022-12-13 01:43:01,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:01,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:01,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 71 transitions, 640 flow [2022-12-13 01:43:01,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 71 transitions, 640 flow [2022-12-13 01:43:01,268 INFO L130 PetriNetUnfolder]: 59/367 cut-off events. [2022-12-13 01:43:01,268 INFO L131 PetriNetUnfolder]: For 1144/1170 co-relation queries the response was YES. [2022-12-13 01:43:01,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 367 events. 59/367 cut-off events. For 1144/1170 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2591 event pairs, 1 based on Foata normal form. 6/362 useless extension candidates. Maximal degree in co-relation 1114. Up to 74 conditions per place. [2022-12-13 01:43:01,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 71 transitions, 640 flow [2022-12-13 01:43:01,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-13 01:43:01,362 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:01,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:43:01,364 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 644 flow [2022-12-13 01:43:01,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-13 01:43:01,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:01,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:01,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 01:43:01,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 01:43:01,573 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 1 more)] === [2022-12-13 01:43:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1467757319, now seen corresponding path program 1 times [2022-12-13 01:43:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:01,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046826364] [2022-12-13 01:43:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:01,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:02,003 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-13 01:43:02,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:02,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046826364] [2022-12-13 01:43:02,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046826364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:02,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:02,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:02,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280328598] [2022-12-13 01:43:02,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:02,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:02,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:02,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:02,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:43:02,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 644 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:02,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:02,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:43:02,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:02,484 INFO L130 PetriNetUnfolder]: 760/1500 cut-off events. [2022-12-13 01:43:02,484 INFO L131 PetriNetUnfolder]: For 6645/6645 co-relation queries the response was YES. [2022-12-13 01:43:02,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6785 conditions, 1500 events. 760/1500 cut-off events. For 6645/6645 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8715 event pairs, 162 based on Foata normal form. 2/1502 useless extension candidates. Maximal degree in co-relation 5485. Up to 1008 conditions per place. [2022-12-13 01:43:02,491 INFO L137 encePairwiseOnDemand]: 36/48 looper letters, 118 selfloop transitions, 13 changer transitions 29/160 dead transitions. [2022-12-13 01:43:02,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 160 transitions, 1601 flow [2022-12-13 01:43:02,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2022-12-13 01:43:02,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 01:43:02,492 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 644 flow. Second operand 9 states and 144 transitions. [2022-12-13 01:43:02,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 160 transitions, 1601 flow [2022-12-13 01:43:02,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 160 transitions, 1525 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-13 01:43:02,503 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 639 flow [2022-12-13 01:43:02,503 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=639, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2022-12-13 01:43:02,504 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2022-12-13 01:43:02,504 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:02,504 INFO L89 Accepts]: Start accepts. Operand has 91 places, 73 transitions, 639 flow [2022-12-13 01:43:02,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:02,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:02,504 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 73 transitions, 639 flow [2022-12-13 01:43:02,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 73 transitions, 639 flow [2022-12-13 01:43:02,527 INFO L130 PetriNetUnfolder]: 58/359 cut-off events. [2022-12-13 01:43:02,528 INFO L131 PetriNetUnfolder]: For 1069/1094 co-relation queries the response was YES. [2022-12-13 01:43:02,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 359 events. 58/359 cut-off events. For 1069/1094 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2565 event pairs, 5 based on Foata normal form. 6/351 useless extension candidates. Maximal degree in co-relation 1226. Up to 71 conditions per place. [2022-12-13 01:43:02,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 73 transitions, 639 flow [2022-12-13 01:43:02,530 INFO L226 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-13 01:43:02,635 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:43:02,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:43:02,636 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 647 flow [2022-12-13 01:43:02,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:02,636 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:02,636 INFO L214 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] [2022-12-13 01:43:02,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 01:43:02,636 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 1 more)] === [2022-12-13 01:43:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1436048023, now seen corresponding path program 1 times [2022-12-13 01:43:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:02,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295548590] [2022-12-13 01:43:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:43:03,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:03,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295548590] [2022-12-13 01:43:03,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295548590] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:43:03,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270088118] [2022-12-13 01:43:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:03,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:03,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:43:03,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:43:03,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 01:43:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:03,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 01:43:03,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:43:03,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:43:03,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:43:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:43:03,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:43:03,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270088118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:03,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:43:03,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 01:43:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157357647] [2022-12-13 01:43:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:03,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:43:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:43:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:43:03,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:43:03,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 72 transitions, 647 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:03,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:03,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:43:03,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:03,569 INFO L130 PetriNetUnfolder]: 796/1587 cut-off events. [2022-12-13 01:43:03,569 INFO L131 PetriNetUnfolder]: For 6941/6941 co-relation queries the response was YES. [2022-12-13 01:43:03,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7077 conditions, 1587 events. 796/1587 cut-off events. For 6941/6941 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9350 event pairs, 245 based on Foata normal form. 3/1590 useless extension candidates. Maximal degree in co-relation 7032. Up to 1316 conditions per place. [2022-12-13 01:43:03,575 INFO L137 encePairwiseOnDemand]: 38/48 looper letters, 76 selfloop transitions, 7 changer transitions 30/113 dead transitions. [2022-12-13 01:43:03,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 113 transitions, 1167 flow [2022-12-13 01:43:03,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:43:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:43:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-13 01:43:03,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2022-12-13 01:43:03,576 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 647 flow. Second operand 6 states and 93 transitions. [2022-12-13 01:43:03,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 113 transitions, 1167 flow [2022-12-13 01:43:03,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 113 transitions, 1136 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 01:43:03,585 INFO L231 Difference]: Finished difference. Result has 91 places, 70 transitions, 615 flow [2022-12-13 01:43:03,585 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=91, PETRI_TRANSITIONS=70} [2022-12-13 01:43:03,585 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2022-12-13 01:43:03,585 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:03,585 INFO L89 Accepts]: Start accepts. Operand has 91 places, 70 transitions, 615 flow [2022-12-13 01:43:03,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:03,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:03,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 70 transitions, 615 flow [2022-12-13 01:43:03,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 70 transitions, 615 flow [2022-12-13 01:43:03,606 INFO L130 PetriNetUnfolder]: 49/340 cut-off events. [2022-12-13 01:43:03,606 INFO L131 PetriNetUnfolder]: For 1051/1070 co-relation queries the response was YES. [2022-12-13 01:43:03,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 340 events. 49/340 cut-off events. For 1051/1070 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2414 event pairs, 5 based on Foata normal form. 6/337 useless extension candidates. Maximal degree in co-relation 1168. Up to 64 conditions per place. [2022-12-13 01:43:03,608 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 70 transitions, 615 flow [2022-12-13 01:43:03,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 506 [2022-12-13 01:43:03,615 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:03,616 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 01:43:03,616 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 615 flow [2022-12-13 01:43:03,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:03,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:03,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:03,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 01:43:03,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:03,821 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 1 more)] === [2022-12-13 01:43:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1818730255, now seen corresponding path program 1 times [2022-12-13 01:43:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:03,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946087052] [2022-12-13 01:43:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:04,222 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-13 01:43:04,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:04,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946087052] [2022-12-13 01:43:04,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946087052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:04,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:04,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102924097] [2022-12-13 01:43:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:04,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:04,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:04,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:43:04,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 615 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:04,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:04,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:43:04,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:04,753 INFO L130 PetriNetUnfolder]: 732/1452 cut-off events. [2022-12-13 01:43:04,753 INFO L131 PetriNetUnfolder]: For 6571/6571 co-relation queries the response was YES. [2022-12-13 01:43:04,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6469 conditions, 1452 events. 732/1452 cut-off events. For 6571/6571 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8352 event pairs, 258 based on Foata normal form. 2/1454 useless extension candidates. Maximal degree in co-relation 6423. Up to 998 conditions per place. [2022-12-13 01:43:04,760 INFO L137 encePairwiseOnDemand]: 33/46 looper letters, 108 selfloop transitions, 18 changer transitions 27/153 dead transitions. [2022-12-13 01:43:04,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 153 transitions, 1494 flow [2022-12-13 01:43:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-12-13 01:43:04,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 01:43:04,761 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 615 flow. Second operand 9 states and 138 transitions. [2022-12-13 01:43:04,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 153 transitions, 1494 flow [2022-12-13 01:43:04,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 153 transitions, 1455 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-13 01:43:04,772 INFO L231 Difference]: Finished difference. Result has 92 places, 77 transitions, 699 flow [2022-12-13 01:43:04,772 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=699, PETRI_PLACES=92, PETRI_TRANSITIONS=77} [2022-12-13 01:43:04,772 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2022-12-13 01:43:04,772 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:04,772 INFO L89 Accepts]: Start accepts. Operand has 92 places, 77 transitions, 699 flow [2022-12-13 01:43:04,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:04,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:04,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 77 transitions, 699 flow [2022-12-13 01:43:04,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 77 transitions, 699 flow [2022-12-13 01:43:04,793 INFO L130 PetriNetUnfolder]: 53/342 cut-off events. [2022-12-13 01:43:04,793 INFO L131 PetriNetUnfolder]: For 1018/1047 co-relation queries the response was YES. [2022-12-13 01:43:04,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 342 events. 53/342 cut-off events. For 1018/1047 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2426 event pairs, 1 based on Foata normal form. 6/338 useless extension candidates. Maximal degree in co-relation 1205. Up to 69 conditions per place. [2022-12-13 01:43:04,796 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 77 transitions, 699 flow [2022-12-13 01:43:04,796 INFO L226 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-13 01:43:04,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] L88-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176|) (= (select (select |v_#memory_int_390| v_~f~0.base_313) (+ v_~f~0.offset_320 (* v_~i2~0_225 4))) v_~i~0_564) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176| (ite (or (= v_~n1~0_363 0) (< v_~n2~0_359 v_~n1~0_363)) 1 0)) (= v_~e2~0_265 0) (not (= (ite (= (mod v_~e1~0_208 256) 0) 1 0) 0)) (= v_~i2~0_225 v_~i~0_565) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176| 0)) (= (+ v_~tmp2~0_180 1) v_~n2~0_359)) InVars {~i~0=v_~i~0_565, ~f~0.base=v_~f~0.base_313, ~n1~0=v_~n1~0_363, #memory_int=|v_#memory_int_390|, ~tmp2~0=v_~tmp2~0_180, ~f~0.offset=v_~f~0.offset_320, ~e1~0=v_~e1~0_208} OutVars{~n2~0=v_~n2~0_359, ~i~0=v_~i~0_564, ~f~0.base=v_~f~0.base_313, ~n1~0=v_~n1~0_363, ~i2~0=v_~i2~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176|, ~f~0.offset=v_~f~0.offset_320, ~e2~0=v_~e2~0_265, ~e1~0=v_~e1~0_208, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_77|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176|, #memory_int=|v_#memory_int_390|, ~tmp2~0=v_~tmp2~0_180} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:43:04,985 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] L88-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176|) (= (select (select |v_#memory_int_390| v_~f~0.base_313) (+ v_~f~0.offset_320 (* v_~i2~0_225 4))) v_~i~0_564) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176| (ite (or (= v_~n1~0_363 0) (< v_~n2~0_359 v_~n1~0_363)) 1 0)) (= v_~e2~0_265 0) (not (= (ite (= (mod v_~e1~0_208 256) 0) 1 0) 0)) (= v_~i2~0_225 v_~i~0_565) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176| 0)) (= (+ v_~tmp2~0_180 1) v_~n2~0_359)) InVars {~i~0=v_~i~0_565, ~f~0.base=v_~f~0.base_313, ~n1~0=v_~n1~0_363, #memory_int=|v_#memory_int_390|, ~tmp2~0=v_~tmp2~0_180, ~f~0.offset=v_~f~0.offset_320, ~e1~0=v_~e1~0_208} OutVars{~n2~0=v_~n2~0_359, ~i~0=v_~i~0_564, ~f~0.base=v_~f~0.base_313, ~n1~0=v_~n1~0_363, ~i2~0=v_~i2~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176|, ~f~0.offset=v_~f~0.offset_320, ~e2~0=v_~e2~0_265, ~e1~0=v_~e1~0_208, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_77|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176|, #memory_int=|v_#memory_int_390|, ~tmp2~0=v_~tmp2~0_180} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] and [756] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~n2~0_342 v_~tmp1~0_163) (= v_~n2~0_341 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_41| 0) (= v_~n1~0_353 (+ v_~tmp1~0_163 1)) (= (ite (and (<= 0 v_~i~0_541) (< v_~i~0_541 v_~n~0_220)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|) (= v_~e1~0_194 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|)) InVars {~n2~0=v_~n2~0_342, ~i~0=v_~i~0_541, ~n~0=v_~n~0_220} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_41|, ~n2~0=v_~n2~0_341, ~i~0=v_~i~0_541, ~n1~0=v_~n1~0_353, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|, ~n~0=v_~n~0_220, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_41|, ~tmp1~0=v_~tmp1~0_163, ~e1~0=v_~e1~0_194} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:43:05,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] L88-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176|) (= (select (select |v_#memory_int_390| v_~f~0.base_313) (+ v_~f~0.offset_320 (* v_~i2~0_225 4))) v_~i~0_564) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176| (ite (or (= v_~n1~0_363 0) (< v_~n2~0_359 v_~n1~0_363)) 1 0)) (= v_~e2~0_265 0) (not (= (ite (= (mod v_~e1~0_208 256) 0) 1 0) 0)) (= v_~i2~0_225 v_~i~0_565) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176| 0)) (= (+ v_~tmp2~0_180 1) v_~n2~0_359)) InVars {~i~0=v_~i~0_565, ~f~0.base=v_~f~0.base_313, ~n1~0=v_~n1~0_363, #memory_int=|v_#memory_int_390|, ~tmp2~0=v_~tmp2~0_180, ~f~0.offset=v_~f~0.offset_320, ~e1~0=v_~e1~0_208} OutVars{~n2~0=v_~n2~0_359, ~i~0=v_~i~0_564, ~f~0.base=v_~f~0.base_313, ~n1~0=v_~n1~0_363, ~i2~0=v_~i2~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176|, ~f~0.offset=v_~f~0.offset_320, ~e2~0=v_~e2~0_265, ~e1~0=v_~e1~0_208, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_77|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176|, #memory_int=|v_#memory_int_390|, ~tmp2~0=v_~tmp2~0_180} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:43:05,210 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [761] L88-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176|) (= (select (select |v_#memory_int_390| v_~f~0.base_313) (+ v_~f~0.offset_320 (* v_~i2~0_225 4))) v_~i~0_564) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176| (ite (or (= v_~n1~0_363 0) (< v_~n2~0_359 v_~n1~0_363)) 1 0)) (= v_~e2~0_265 0) (not (= (ite (= (mod v_~e1~0_208 256) 0) 1 0) 0)) (= v_~i2~0_225 v_~i~0_565) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176| 0)) (= (+ v_~tmp2~0_180 1) v_~n2~0_359)) InVars {~i~0=v_~i~0_565, ~f~0.base=v_~f~0.base_313, ~n1~0=v_~n1~0_363, #memory_int=|v_#memory_int_390|, ~tmp2~0=v_~tmp2~0_180, ~f~0.offset=v_~f~0.offset_320, ~e1~0=v_~e1~0_208} OutVars{~n2~0=v_~n2~0_359, ~i~0=v_~i~0_564, ~f~0.base=v_~f~0.base_313, ~n1~0=v_~n1~0_363, ~i2~0=v_~i2~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_176|, ~f~0.offset=v_~f~0.offset_320, ~e2~0=v_~e2~0_265, ~e1~0=v_~e1~0_208, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_77|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_176|, #memory_int=|v_#memory_int_390|, ~tmp2~0=v_~tmp2~0_180} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] and [754] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (= v_~e1~0_188 1) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| 0)) (= v_~n2~0_335 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|) (= v_~n2~0_336 v_~tmp1~0_159) (= (ite (and (<= 0 v_~i~0_539) (< v_~i~0_539 v_~n~0_218)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|)) InVars {~n2~0=v_~n2~0_336, ~i~0=v_~i~0_539, ~n~0=v_~n~0_218} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, ~n2~0=v_~n2~0_335, ~i~0=v_~i~0_539, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|, ~n~0=v_~n~0_218, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, ~tmp1~0=v_~tmp1~0_159, ~e1~0=v_~e1~0_188} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:43:05,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:05,319 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 547 [2022-12-13 01:43:05,320 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 76 transitions, 763 flow [2022-12-13 01:43:05,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:05,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:05,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:05,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 01:43:05,320 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 1 more)] === [2022-12-13 01:43:05,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1620938820, now seen corresponding path program 1 times [2022-12-13 01:43:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:05,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081090471] [2022-12-13 01:43:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:05,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:05,655 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-13 01:43:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:05,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081090471] [2022-12-13 01:43:05,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081090471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:05,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:05,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:43:05,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375698355] [2022-12-13 01:43:05,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:05,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:43:05,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:05,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:43:05,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:43:05,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:43:05,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 76 transitions, 763 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:43:05,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:05,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:43:05,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:06,062 INFO L130 PetriNetUnfolder]: 720/1448 cut-off events. [2022-12-13 01:43:06,063 INFO L131 PetriNetUnfolder]: For 7129/7129 co-relation queries the response was YES. [2022-12-13 01:43:06,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6588 conditions, 1448 events. 720/1448 cut-off events. For 7129/7129 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8447 event pairs, 290 based on Foata normal form. 2/1450 useless extension candidates. Maximal degree in co-relation 6543. Up to 998 conditions per place. [2022-12-13 01:43:06,069 INFO L137 encePairwiseOnDemand]: 36/50 looper letters, 103 selfloop transitions, 14 changer transitions 31/148 dead transitions. [2022-12-13 01:43:06,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 148 transitions, 1598 flow [2022-12-13 01:43:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2022-12-13 01:43:06,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33 [2022-12-13 01:43:06,070 INFO L175 Difference]: Start difference. First operand has 90 places, 76 transitions, 763 flow. Second operand 8 states and 132 transitions. [2022-12-13 01:43:06,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 148 transitions, 1598 flow [2022-12-13 01:43:06,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 148 transitions, 1511 flow, removed 31 selfloop flow, removed 6 redundant places. [2022-12-13 01:43:06,080 INFO L231 Difference]: Finished difference. Result has 93 places, 74 transitions, 691 flow [2022-12-13 01:43:06,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=691, PETRI_PLACES=93, PETRI_TRANSITIONS=74} [2022-12-13 01:43:06,082 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2022-12-13 01:43:06,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:06,082 INFO L89 Accepts]: Start accepts. Operand has 93 places, 74 transitions, 691 flow [2022-12-13 01:43:06,083 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:06,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:06,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 74 transitions, 691 flow [2022-12-13 01:43:06,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 74 transitions, 691 flow [2022-12-13 01:43:06,103 INFO L130 PetriNetUnfolder]: 47/335 cut-off events. [2022-12-13 01:43:06,103 INFO L131 PetriNetUnfolder]: For 1094/1120 co-relation queries the response was YES. [2022-12-13 01:43:06,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 335 events. 47/335 cut-off events. For 1094/1120 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2384 event pairs, 3 based on Foata normal form. 6/329 useless extension candidates. Maximal degree in co-relation 1178. Up to 61 conditions per place. [2022-12-13 01:43:06,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 74 transitions, 691 flow [2022-12-13 01:43:06,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 01:43:06,108 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:06,109 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 01:43:06,109 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 74 transitions, 691 flow [2022-12-13 01:43:06,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:43:06,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:06,109 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:06,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 01:43:06,109 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 1 more)] === [2022-12-13 01:43:06,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1369069353, now seen corresponding path program 1 times [2022-12-13 01:43:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:06,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977477031] [2022-12-13 01:43:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:06,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:06,495 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-13 01:43:06,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:06,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977477031] [2022-12-13 01:43:06,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977477031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:06,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:06,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986183815] [2022-12-13 01:43:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:06,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:06,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:06,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:06,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:06,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 74 transitions, 691 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:43:06,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:06,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:06,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:06,917 INFO L130 PetriNetUnfolder]: 723/1464 cut-off events. [2022-12-13 01:43:06,918 INFO L131 PetriNetUnfolder]: For 6823/6823 co-relation queries the response was YES. [2022-12-13 01:43:06,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6538 conditions, 1464 events. 723/1464 cut-off events. For 6823/6823 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8629 event pairs, 272 based on Foata normal form. 2/1466 useless extension candidates. Maximal degree in co-relation 6493. Up to 998 conditions per place. [2022-12-13 01:43:06,925 INFO L137 encePairwiseOnDemand]: 32/49 looper letters, 107 selfloop transitions, 19 changer transitions 30/156 dead transitions. [2022-12-13 01:43:06,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 156 transitions, 1596 flow [2022-12-13 01:43:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 139 transitions. [2022-12-13 01:43:06,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31519274376417233 [2022-12-13 01:43:06,930 INFO L175 Difference]: Start difference. First operand has 91 places, 74 transitions, 691 flow. Second operand 9 states and 139 transitions. [2022-12-13 01:43:06,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 156 transitions, 1596 flow [2022-12-13 01:43:06,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 156 transitions, 1547 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 01:43:06,945 INFO L231 Difference]: Finished difference. Result has 96 places, 79 transitions, 773 flow [2022-12-13 01:43:06,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=773, PETRI_PLACES=96, PETRI_TRANSITIONS=79} [2022-12-13 01:43:06,954 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2022-12-13 01:43:06,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:06,954 INFO L89 Accepts]: Start accepts. Operand has 96 places, 79 transitions, 773 flow [2022-12-13 01:43:06,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:06,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:06,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 79 transitions, 773 flow [2022-12-13 01:43:06,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 79 transitions, 773 flow [2022-12-13 01:43:06,977 INFO L130 PetriNetUnfolder]: 50/336 cut-off events. [2022-12-13 01:43:06,977 INFO L131 PetriNetUnfolder]: For 1242/1264 co-relation queries the response was YES. [2022-12-13 01:43:06,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 336 events. 50/336 cut-off events. For 1242/1264 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2393 event pairs, 1 based on Foata normal form. 4/328 useless extension candidates. Maximal degree in co-relation 1275. Up to 64 conditions per place. [2022-12-13 01:43:06,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 79 transitions, 773 flow [2022-12-13 01:43:06,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-13 01:43:06,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L88-->L155-3: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_196| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_196|) (= v_~e2~0_285 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_196| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_196| (ite (or (= v_~n1~0_380 0) (< v_~n2~0_383 v_~n1~0_380)) 1 0)) (= (+ v_~tmp2~0_196 1) v_~n2~0_383) (= |v_ULTIMATE.start_main_#t~pre17#1_63| |v_#pthreadsForks_95|) (= (store |v_#memory_int_407| |v_ULTIMATE.start_main_~#t3~0#1.base_75| (store (select |v_#memory_int_407| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) |v_ULTIMATE.start_main_~#t3~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre17#1_63|)) |v_#memory_int_406|) (not (= (ite (= (mod v_~e1~0_224 256) 0) 1 0) 0)) (= v_~i~0_600 (select (select |v_#memory_int_407| v_~f~0.base_329) (+ v_~f~0.offset_336 (* v_~i2~0_229 4)))) (= (+ |v_#pthreadsForks_95| 1) |v_#pthreadsForks_94|) (= v_~i2~0_229 v_~i~0_601)) InVars {#pthreadsForks=|v_#pthreadsForks_95|, ~i~0=v_~i~0_601, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_59|, ~f~0.base=v_~f~0.base_329, ~n1~0=v_~n1~0_380, #memory_int=|v_#memory_int_407|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~tmp2~0=v_~tmp2~0_196, ~f~0.offset=v_~f~0.offset_336, ~e1~0=v_~e1~0_224} OutVars{~n2~0=v_~n2~0_383, ~i~0=v_~i~0_600, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_59|, ~f~0.base=v_~f~0.base_329, ~n1~0=v_~n1~0_380, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~i2~0=v_~i2~0_229, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_196|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_65|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_63|, ~f~0.offset=v_~f~0.offset_336, ~e2~0=v_~e2~0_285, ~e1~0=v_~e1~0_224, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_53|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_81|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_196|, #pthreadsForks=|v_#pthreadsForks_94|, #memory_int=|v_#memory_int_406|, ~tmp2~0=v_~tmp2~0_196} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, #pthreadsForks, ~i~0, #memory_int, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1, ~e2~0] and [754] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (= v_~e1~0_188 1) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| 0)) (= v_~n2~0_335 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|) (= v_~n2~0_336 v_~tmp1~0_159) (= (ite (and (<= 0 v_~i~0_539) (< v_~i~0_539 v_~n~0_218)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|)) InVars {~n2~0=v_~n2~0_336, ~i~0=v_~i~0_539, ~n~0=v_~n~0_218} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, ~n2~0=v_~n2~0_335, ~i~0=v_~i~0_539, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|, ~n~0=v_~n~0_218, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, ~tmp1~0=v_~tmp1~0_159, ~e1~0=v_~e1~0_188} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:43:07,073 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L88-->L155-3: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_196| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_196|) (= v_~e2~0_285 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_196| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_196| (ite (or (= v_~n1~0_380 0) (< v_~n2~0_383 v_~n1~0_380)) 1 0)) (= (+ v_~tmp2~0_196 1) v_~n2~0_383) (= |v_ULTIMATE.start_main_#t~pre17#1_63| |v_#pthreadsForks_95|) (= (store |v_#memory_int_407| |v_ULTIMATE.start_main_~#t3~0#1.base_75| (store (select |v_#memory_int_407| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) |v_ULTIMATE.start_main_~#t3~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre17#1_63|)) |v_#memory_int_406|) (not (= (ite (= (mod v_~e1~0_224 256) 0) 1 0) 0)) (= v_~i~0_600 (select (select |v_#memory_int_407| v_~f~0.base_329) (+ v_~f~0.offset_336 (* v_~i2~0_229 4)))) (= (+ |v_#pthreadsForks_95| 1) |v_#pthreadsForks_94|) (= v_~i2~0_229 v_~i~0_601)) InVars {#pthreadsForks=|v_#pthreadsForks_95|, ~i~0=v_~i~0_601, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_59|, ~f~0.base=v_~f~0.base_329, ~n1~0=v_~n1~0_380, #memory_int=|v_#memory_int_407|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~tmp2~0=v_~tmp2~0_196, ~f~0.offset=v_~f~0.offset_336, ~e1~0=v_~e1~0_224} OutVars{~n2~0=v_~n2~0_383, ~i~0=v_~i~0_600, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_59|, ~f~0.base=v_~f~0.base_329, ~n1~0=v_~n1~0_380, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~i2~0=v_~i2~0_229, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_196|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_65|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_63|, ~f~0.offset=v_~f~0.offset_336, ~e2~0=v_~e2~0_285, ~e1~0=v_~e1~0_224, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_53|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_81|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_196|, #pthreadsForks=|v_#pthreadsForks_94|, #memory_int=|v_#memory_int_406|, ~tmp2~0=v_~tmp2~0_196} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, #pthreadsForks, ~i~0, #memory_int, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1, ~e2~0] and [747] L106-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_127| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_35| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127| (ite (and (<= 0 v_~i~0_509) (< v_~i~0_509 v_~n~0_205)) 1 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_35| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_127| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127|) (= v_~n2~0_299 0)) InVars {~i~0=v_~i~0_509, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_127|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_35|, ~n2~0=v_~n2~0_299, ~i~0=v_~i~0_509, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127|, ~n~0=v_~n~0_205, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 01:43:07,202 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] L88-->L155-3: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_196| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_196|) (= v_~e2~0_285 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_196| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_196| (ite (or (= v_~n1~0_380 0) (< v_~n2~0_383 v_~n1~0_380)) 1 0)) (= (+ v_~tmp2~0_196 1) v_~n2~0_383) (= |v_ULTIMATE.start_main_#t~pre17#1_63| |v_#pthreadsForks_95|) (= (store |v_#memory_int_407| |v_ULTIMATE.start_main_~#t3~0#1.base_75| (store (select |v_#memory_int_407| |v_ULTIMATE.start_main_~#t3~0#1.base_75|) |v_ULTIMATE.start_main_~#t3~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre17#1_63|)) |v_#memory_int_406|) (not (= (ite (= (mod v_~e1~0_224 256) 0) 1 0) 0)) (= v_~i~0_600 (select (select |v_#memory_int_407| v_~f~0.base_329) (+ v_~f~0.offset_336 (* v_~i2~0_229 4)))) (= (+ |v_#pthreadsForks_95| 1) |v_#pthreadsForks_94|) (= v_~i2~0_229 v_~i~0_601)) InVars {#pthreadsForks=|v_#pthreadsForks_95|, ~i~0=v_~i~0_601, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_59|, ~f~0.base=v_~f~0.base_329, ~n1~0=v_~n1~0_380, #memory_int=|v_#memory_int_407|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~tmp2~0=v_~tmp2~0_196, ~f~0.offset=v_~f~0.offset_336, ~e1~0=v_~e1~0_224} OutVars{~n2~0=v_~n2~0_383, ~i~0=v_~i~0_600, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_59|, ~f~0.base=v_~f~0.base_329, ~n1~0=v_~n1~0_380, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_75|, ~i2~0=v_~i2~0_229, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_196|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_65|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_63|, ~f~0.offset=v_~f~0.offset_336, ~e2~0=v_~e2~0_285, ~e1~0=v_~e1~0_224, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_53|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_81|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_196|, #pthreadsForks=|v_#pthreadsForks_94|, #memory_int=|v_#memory_int_406|, ~tmp2~0=v_~tmp2~0_196} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, #pthreadsForks, ~i~0, #memory_int, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1, ~e2~0] and [756] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~n2~0_342 v_~tmp1~0_163) (= v_~n2~0_341 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_41| 0) (= v_~n1~0_353 (+ v_~tmp1~0_163 1)) (= (ite (and (<= 0 v_~i~0_541) (< v_~i~0_541 v_~n~0_220)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|) (= v_~e1~0_194 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|)) InVars {~n2~0=v_~n2~0_342, ~i~0=v_~i~0_541, ~n~0=v_~n~0_220} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_41|, ~n2~0=v_~n2~0_341, ~i~0=v_~i~0_541, ~n1~0=v_~n1~0_353, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|, ~n~0=v_~n~0_220, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_41|, ~tmp1~0=v_~tmp1~0_163, ~e1~0=v_~e1~0_194} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:43:07,347 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:07,348 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 394 [2022-12-13 01:43:07,348 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 79 transitions, 829 flow [2022-12-13 01:43:07,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:43:07,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:07,348 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:07,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 01:43:07,348 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 1 more)] === [2022-12-13 01:43:07,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2084513949, now seen corresponding path program 1 times [2022-12-13 01:43:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:07,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153936440] [2022-12-13 01:43:07,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:07,752 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-13 01:43:07,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:07,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153936440] [2022-12-13 01:43:07,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153936440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:07,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:07,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:43:07,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419507622] [2022-12-13 01:43:07,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:07,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:43:07,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:07,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:43:07,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:43:07,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 01:43:07,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 79 transitions, 829 flow. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:43:07,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:07,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 01:43:07,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:08,139 INFO L130 PetriNetUnfolder]: 721/1472 cut-off events. [2022-12-13 01:43:08,140 INFO L131 PetriNetUnfolder]: For 7452/7452 co-relation queries the response was YES. [2022-12-13 01:43:08,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6747 conditions, 1472 events. 721/1472 cut-off events. For 7452/7452 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8794 event pairs, 265 based on Foata normal form. 2/1474 useless extension candidates. Maximal degree in co-relation 6699. Up to 998 conditions per place. [2022-12-13 01:43:08,146 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 105 selfloop transitions, 15 changer transitions 32/152 dead transitions. [2022-12-13 01:43:08,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 152 transitions, 1647 flow [2022-12-13 01:43:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2022-12-13 01:43:08,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3245192307692308 [2022-12-13 01:43:08,147 INFO L175 Difference]: Start difference. First operand has 94 places, 79 transitions, 829 flow. Second operand 8 states and 135 transitions. [2022-12-13 01:43:08,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 152 transitions, 1647 flow [2022-12-13 01:43:08,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 152 transitions, 1587 flow, removed 25 selfloop flow, removed 4 redundant places. [2022-12-13 01:43:08,159 INFO L231 Difference]: Finished difference. Result has 99 places, 75 transitions, 734 flow [2022-12-13 01:43:08,159 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=734, PETRI_PLACES=99, PETRI_TRANSITIONS=75} [2022-12-13 01:43:08,159 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-12-13 01:43:08,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:08,160 INFO L89 Accepts]: Start accepts. Operand has 99 places, 75 transitions, 734 flow [2022-12-13 01:43:08,160 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:08,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:08,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 75 transitions, 734 flow [2022-12-13 01:43:08,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 75 transitions, 734 flow [2022-12-13 01:43:08,180 INFO L130 PetriNetUnfolder]: 48/341 cut-off events. [2022-12-13 01:43:08,181 INFO L131 PetriNetUnfolder]: For 1301/1322 co-relation queries the response was YES. [2022-12-13 01:43:08,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 341 events. 48/341 cut-off events. For 1301/1322 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2451 event pairs, 1 based on Foata normal form. 3/331 useless extension candidates. Maximal degree in co-relation 1247. Up to 61 conditions per place. [2022-12-13 01:43:08,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 75 transitions, 734 flow [2022-12-13 01:43:08,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-13 01:43:08,183 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:08,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 01:43:08,184 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 75 transitions, 734 flow [2022-12-13 01:43:08,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:43:08,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:08,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:08,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 01:43:08,184 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 1 more)] === [2022-12-13 01:43:08,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:08,184 INFO L85 PathProgramCache]: Analyzing trace with hash -306175735, now seen corresponding path program 2 times [2022-12-13 01:43:08,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:08,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488086999] [2022-12-13 01:43:08,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:08,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:09,219 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-13 01:43:09,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:09,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488086999] [2022-12-13 01:43:09,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488086999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:09,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:09,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583275377] [2022-12-13 01:43:09,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:09,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:09,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:09,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:09,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:09,221 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:09,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 75 transitions, 734 flow. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:43:09,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:09,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:09,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:10,460 INFO L130 PetriNetUnfolder]: 698/1428 cut-off events. [2022-12-13 01:43:10,461 INFO L131 PetriNetUnfolder]: For 6836/6836 co-relation queries the response was YES. [2022-12-13 01:43:10,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6509 conditions, 1428 events. 698/1428 cut-off events. For 6836/6836 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8449 event pairs, 240 based on Foata normal form. 2/1430 useless extension candidates. Maximal degree in co-relation 6461. Up to 936 conditions per place. [2022-12-13 01:43:10,468 INFO L137 encePairwiseOnDemand]: 25/49 looper letters, 100 selfloop transitions, 37 changer transitions 31/168 dead transitions. [2022-12-13 01:43:10,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 168 transitions, 1720 flow [2022-12-13 01:43:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:43:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:43:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-12-13 01:43:10,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22011661807580174 [2022-12-13 01:43:10,469 INFO L175 Difference]: Start difference. First operand has 98 places, 75 transitions, 734 flow. Second operand 14 states and 151 transitions. [2022-12-13 01:43:10,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 168 transitions, 1720 flow [2022-12-13 01:43:10,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 168 transitions, 1656 flow, removed 9 selfloop flow, removed 10 redundant places. [2022-12-13 01:43:10,481 INFO L231 Difference]: Finished difference. Result has 105 places, 86 transitions, 906 flow [2022-12-13 01:43:10,481 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=906, PETRI_PLACES=105, PETRI_TRANSITIONS=86} [2022-12-13 01:43:10,481 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2022-12-13 01:43:10,481 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:10,482 INFO L89 Accepts]: Start accepts. Operand has 105 places, 86 transitions, 906 flow [2022-12-13 01:43:10,482 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:10,482 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:10,482 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 86 transitions, 906 flow [2022-12-13 01:43:10,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 86 transitions, 906 flow [2022-12-13 01:43:10,506 INFO L130 PetriNetUnfolder]: 58/371 cut-off events. [2022-12-13 01:43:10,506 INFO L131 PetriNetUnfolder]: For 1373/1379 co-relation queries the response was YES. [2022-12-13 01:43:10,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 371 events. 58/371 cut-off events. For 1373/1379 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2723 event pairs, 3 based on Foata normal form. 3/365 useless extension candidates. Maximal degree in co-relation 1418. Up to 70 conditions per place. [2022-12-13 01:43:10,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 86 transitions, 906 flow [2022-12-13 01:43:10,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-13 01:43:10,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [758] L88-->L97: Formula: (and (= v_~e2~0_257 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_167| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_167| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_167|) (= (+ v_~tmp2~0_173 1) v_~n2~0_349) (= (ite (= (mod v_~e1~0_201 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_167|)) InVars {~tmp2~0=v_~tmp2~0_173, ~e1~0=v_~e1~0_201} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_167|, ~n2~0=v_~n2~0_349, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_167|, ~tmp2~0=v_~tmp2~0_173, ~e2~0=v_~e2~0_257, ~e1~0=v_~e1~0_201} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] [2022-12-13 01:43:10,939 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] $Ultimate##0-->L88: Formula: (and (= v_~e2~0_17 1) (= v_~tmp2~0_5 v_~n1~0_22)) InVars {~n1~0=v_~n1~0_22} OutVars{~n1~0=v_~n1~0_22, ~tmp2~0=v_~tmp2~0_5, ~e2~0=v_~e2~0_17} AuxVars[] AssignedVars[~tmp2~0, ~e2~0] and [770] $Ultimate##0-->L97: Formula: (let ((.cse1 (select |v_#memory_int_440| v_~f~0.base_355))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_362 (* v_~j~0_290 4))))) (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_56| 0) (= (ite (= (mod v_~e1~0_258 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_232|) (= |v_thread3Thread1of1ForFork0_#res#1.base_56| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_60|) (= (+ v_~tmp2~0_222 1) v_~n2~0_425) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_60| 0)) (= v_~e2~0_315 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_232| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_232|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60| (ite (and (<= 0 .cse0) (< .cse0 v_~n~0_244)) 1 0)) (= v_~j~0_289 (select .cse1 (+ v_~f~0.offset_362 (* .cse0 4)))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_232| 0))))) InVars {~j~0=v_~j~0_290, ~f~0.base=v_~f~0.base_355, #memory_int=|v_#memory_int_440|, ~tmp2~0=v_~tmp2~0_222, ~n~0=v_~n~0_244, ~f~0.offset=v_~f~0.offset_362, ~e1~0=v_~e1~0_258} OutVars{~j~0=v_~j~0_289, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_60|, ~n2~0=v_~n2~0_425, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_60|, ~f~0.base=v_~f~0.base_355, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_56|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_60|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_232|, ~e2~0=v_~e2~0_315, ~f~0.offset=v_~f~0.offset_362, ~e1~0=v_~e1~0_258, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_56|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_232|, #memory_int=|v_#memory_int_440|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_58|, ~tmp2~0=v_~tmp2~0_222, ~n~0=v_~n~0_244} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem3#1, thread3Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] [2022-12-13 01:43:11,024 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [751] L88-->L103: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_154| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_154|) (= (+ v_~tmp2~0_166 1) v_~n2~0_329) (not (= (ite (= (mod v_~e1~0_184 256) 0) 1 0) 0)) (= v_~e2~0_249 0) (= (ite (or (= v_~n1~0_345 0) (< v_~n2~0_329 v_~n1~0_345)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_154|) (= v_~i2~0_215 v_~i~0_533) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_154| 0))) InVars {~i~0=v_~i~0_533, ~n1~0=v_~n1~0_345, ~tmp2~0=v_~tmp2~0_166, ~e1~0=v_~e1~0_184} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_154|, ~n2~0=v_~n2~0_329, ~i~0=v_~i~0_533, ~n1~0=v_~n1~0_345, ~i2~0=v_~i2~0_215, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_154|, ~tmp2~0=v_~tmp2~0_166, ~e2~0=v_~e2~0_249, ~e1~0=v_~e1~0_184} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] [2022-12-13 01:43:11,115 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [752] L88-->L103: Formula: (and (= v_~i2~0_217 v_~i~0_535) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_156| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_156|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_156| 0)) (= (ite (or (< v_~n2~0_331 v_~n1~0_347) (= v_~n1~0_347 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_156|) (= v_~n2~0_331 (+ v_~tmp2~0_168 1)) (= v_~e2~0_251 0) (not (= (ite (= (mod v_~e1~0_186 256) 0) 1 0) 0))) InVars {~i~0=v_~i~0_535, ~n1~0=v_~n1~0_347, ~tmp2~0=v_~tmp2~0_168, ~e1~0=v_~e1~0_186} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_156|, ~n2~0=v_~n2~0_331, ~i~0=v_~i~0_535, ~n1~0=v_~n1~0_347, ~i2~0=v_~i2~0_217, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_156|, ~tmp2~0=v_~tmp2~0_168, ~e2~0=v_~e2~0_251, ~e1~0=v_~e1~0_186} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] [2022-12-13 01:43:11,206 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:43:11,206 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 725 [2022-12-13 01:43:11,206 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 84 transitions, 932 flow [2022-12-13 01:43:11,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:43:11,207 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:11,207 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:11,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 01:43:11,207 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 1 more)] === [2022-12-13 01:43:11,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:11,207 INFO L85 PathProgramCache]: Analyzing trace with hash 984485723, now seen corresponding path program 1 times [2022-12-13 01:43:11,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:11,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768640140] [2022-12-13 01:43:11,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:11,998 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-13 01:43:11,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:11,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768640140] [2022-12-13 01:43:11,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768640140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:11,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:11,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:11,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229268907] [2022-12-13 01:43:11,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:11,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:11,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:11,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:11,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 01:43:12,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 84 transitions, 932 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:43:12,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:12,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 01:43:12,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:12,496 INFO L130 PetriNetUnfolder]: 695/1412 cut-off events. [2022-12-13 01:43:12,496 INFO L131 PetriNetUnfolder]: For 8275/8275 co-relation queries the response was YES. [2022-12-13 01:43:12,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6644 conditions, 1412 events. 695/1412 cut-off events. For 8275/8275 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8320 event pairs, 216 based on Foata normal form. 2/1414 useless extension candidates. Maximal degree in co-relation 6595. Up to 998 conditions per place. [2022-12-13 01:43:12,503 INFO L137 encePairwiseOnDemand]: 39/52 looper letters, 107 selfloop transitions, 16 changer transitions 22/145 dead transitions. [2022-12-13 01:43:12,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 145 transitions, 1582 flow [2022-12-13 01:43:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2022-12-13 01:43:12,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31009615384615385 [2022-12-13 01:43:12,504 INFO L175 Difference]: Start difference. First operand has 99 places, 84 transitions, 932 flow. Second operand 8 states and 129 transitions. [2022-12-13 01:43:12,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 145 transitions, 1582 flow [2022-12-13 01:43:12,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 145 transitions, 1470 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-12-13 01:43:12,521 INFO L231 Difference]: Finished difference. Result has 99 places, 84 transitions, 888 flow [2022-12-13 01:43:12,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=888, PETRI_PLACES=99, PETRI_TRANSITIONS=84} [2022-12-13 01:43:12,521 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-12-13 01:43:12,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:12,521 INFO L89 Accepts]: Start accepts. Operand has 99 places, 84 transitions, 888 flow [2022-12-13 01:43:12,522 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:12,522 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:12,522 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 84 transitions, 888 flow [2022-12-13 01:43:12,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 84 transitions, 888 flow [2022-12-13 01:43:12,544 INFO L130 PetriNetUnfolder]: 54/348 cut-off events. [2022-12-13 01:43:12,545 INFO L131 PetriNetUnfolder]: For 1627/1661 co-relation queries the response was YES. [2022-12-13 01:43:12,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 348 events. 54/348 cut-off events. For 1627/1661 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2479 event pairs, 1 based on Foata normal form. 5/345 useless extension candidates. Maximal degree in co-relation 1338. Up to 68 conditions per place. [2022-12-13 01:43:12,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 84 transitions, 888 flow [2022-12-13 01:43:12,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 01:43:12,593 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] L53-->L97: Formula: (and (= v_~e2~0_167 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|) (= (+ v_~tmp1~0_123 1) v_~n1~0_225) (= v_~e1~0_133 0) (= (+ v_~tmp2~0_121 1) v_~n2~0_206) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| (ite (= (mod v_~e1~0_133 256) 0) 1 0))) InVars {~tmp2~0=v_~tmp2~0_121, ~tmp1~0=v_~tmp1~0_123} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|, ~n2~0=v_~n2~0_206, ~n1~0=v_~n1~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77|, ~tmp2~0=v_~tmp2~0_121, ~e2~0=v_~e2~0_167, ~tmp1~0=v_~tmp1~0_123, ~e1~0=v_~e1~0_133} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0, ~e1~0] and [733] L71-->thread1EXIT: Formula: (and (= (ite (and (< v_~i~0_471 v_~n~0_183) (<= 0 v_~i~0_471)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_127|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_127| 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_30| 0) (= v_~n1~0_299 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_30| 0)) InVars {~i~0=v_~i~0_471, ~n~0=v_~n~0_183} OutVars{~i~0=v_~i~0_471, ~n1~0=v_~n1~0_299, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_127|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_30|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_30|, ~n~0=v_~n~0_183, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_127|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:43:12,661 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:43:12,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:43:12,661 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 84 transitions, 898 flow [2022-12-13 01:43:12,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:43:12,662 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:12,662 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:12,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 01:43:12,662 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 1 more)] === [2022-12-13 01:43:12,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1994927567, now seen corresponding path program 2 times [2022-12-13 01:43:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:12,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526696275] [2022-12-13 01:43:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:12,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:13,043 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-13 01:43:13,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:13,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526696275] [2022-12-13 01:43:13,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526696275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:13,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:13,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:13,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710948896] [2022-12-13 01:43:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:13,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:13,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:13,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:13,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:43:13,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 84 transitions, 898 flow. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:43:13,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:13,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:43:13,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:13,403 INFO L130 PetriNetUnfolder]: 661/1358 cut-off events. [2022-12-13 01:43:13,403 INFO L131 PetriNetUnfolder]: For 7440/7440 co-relation queries the response was YES. [2022-12-13 01:43:13,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6361 conditions, 1358 events. 661/1358 cut-off events. For 7440/7440 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7979 event pairs, 247 based on Foata normal form. 2/1360 useless extension candidates. Maximal degree in co-relation 6312. Up to 994 conditions per place. [2022-12-13 01:43:13,409 INFO L137 encePairwiseOnDemand]: 42/54 looper letters, 100 selfloop transitions, 14 changer transitions 22/136 dead transitions. [2022-12-13 01:43:13,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 136 transitions, 1446 flow [2022-12-13 01:43:13,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-12-13 01:43:13,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-13 01:43:13,411 INFO L175 Difference]: Start difference. First operand has 97 places, 84 transitions, 898 flow. Second operand 8 states and 120 transitions. [2022-12-13 01:43:13,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 136 transitions, 1446 flow [2022-12-13 01:43:13,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 136 transitions, 1395 flow, removed 11 selfloop flow, removed 8 redundant places. [2022-12-13 01:43:13,423 INFO L231 Difference]: Finished difference. Result has 98 places, 79 transitions, 812 flow [2022-12-13 01:43:13,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=812, PETRI_PLACES=98, PETRI_TRANSITIONS=79} [2022-12-13 01:43:13,423 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2022-12-13 01:43:13,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:13,424 INFO L89 Accepts]: Start accepts. Operand has 98 places, 79 transitions, 812 flow [2022-12-13 01:43:13,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:13,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:13,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 79 transitions, 812 flow [2022-12-13 01:43:13,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 79 transitions, 812 flow [2022-12-13 01:43:13,444 INFO L130 PetriNetUnfolder]: 49/324 cut-off events. [2022-12-13 01:43:13,445 INFO L131 PetriNetUnfolder]: For 1474/1493 co-relation queries the response was YES. [2022-12-13 01:43:13,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 324 events. 49/324 cut-off events. For 1474/1493 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2279 event pairs, 1 based on Foata normal form. 4/320 useless extension candidates. Maximal degree in co-relation 1257. Up to 65 conditions per place. [2022-12-13 01:43:13,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 79 transitions, 812 flow [2022-12-13 01:43:13,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-13 01:43:13,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [773] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~i2~0_245 v_~i~0_660) (= v_~n2~0_431 0) (= v_~tmp2~0_228 v_~n1~0_416) (= v_~e2~0_325 0) (not (= (ite (or (= v_~n1~0_416 0) (< v_~tmp1~0_179 v_~n1~0_416)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_238| 0)) (= v_~n1~0_415 (+ v_~tmp1~0_179 1)) (= (+ v_~tmp2~0_228 1) v_~tmp1~0_179) (= v_~e1~0_266 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_57| 0) (= (ite (and (<= 0 v_~i~0_659) (< v_~i~0_659 v_~n~0_248)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_238|) (= |v_thread2Thread1of1ForFork2_#res#1.base_57| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_238| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_238|) (= (select (select |v_#memory_int_444| v_~f~0.base_359) (+ v_~f~0.offset_366 (* v_~i2~0_245 4))) v_~i~0_659) (not (= (ite (= (mod v_~e1~0_267 256) 0) 1 0) 0))) InVars {~i~0=v_~i~0_660, ~n1~0=v_~n1~0_416, ~f~0.base=v_~f~0.base_359, #memory_int=|v_#memory_int_444|, ~n~0=v_~n~0_248, ~f~0.offset=v_~f~0.offset_366, ~e1~0=v_~e1~0_267} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_57|, ~n2~0=v_~n2~0_431, ~i~0=v_~i~0_659, ~n1~0=v_~n1~0_415, ~f~0.base=v_~f~0.base_359, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_238|, ~i2~0=v_~i2~0_245, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_57|, ~f~0.offset=v_~f~0.offset_366, ~e2~0=v_~e2~0_325, ~e1~0=v_~e1~0_266, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_97|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_238|, #memory_int=|v_#memory_int_444|, ~n~0=v_~n~0_248, ~tmp2~0=v_~tmp2~0_228, ~tmp1~0=v_~tmp1~0_179} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~i~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork2_#res#1.base, ~e2~0, ~e1~0, thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~tmp2~0, ~tmp1~0] and [741] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| (ite (or (= v_~n2~0_287 0) (<= v_~n1~0_315 v_~n2~0_287)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142|) (not (= (ite (= 0 (mod v_~e2~0_231 256)) 1 0) 0)) (= v_~i1~0_229 v_~i~0_496) (= (select (select |v_#memory_int_369| v_~f~0.base_292) (+ v_~f~0.offset_299 (* v_~i1~0_229 4))) v_~i~0_495)) InVars {~n2~0=v_~n2~0_287, ~i~0=v_~i~0_496, ~f~0.base=v_~f~0.base_292, ~n1~0=v_~n1~0_315, #memory_int=|v_#memory_int_369|, ~f~0.offset=v_~f~0.offset_299, ~e2~0=v_~e2~0_231} OutVars{~n2~0=v_~n2~0_287, ~i~0=v_~i~0_495, ~f~0.base=v_~f~0.base_292, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142|, ~n1~0=v_~n1~0_315, #memory_int=|v_#memory_int_369|, ~i1~0=v_~i1~0_229, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_146|, ~f~0.offset=v_~f~0.offset_299, ~e2~0=v_~e2~0_231, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:43:13,686 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:13,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 263 [2022-12-13 01:43:13,686 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 79 transitions, 814 flow [2022-12-13 01:43:13,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:43:13,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:13,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:13,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 01:43:13,687 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 1 more)] === [2022-12-13 01:43:13,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash 339389907, now seen corresponding path program 1 times [2022-12-13 01:43:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:13,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010462253] [2022-12-13 01:43:13,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:13,951 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-13 01:43:13,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:13,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010462253] [2022-12-13 01:43:13,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010462253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:13,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:13,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:43:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907619324] [2022-12-13 01:43:13,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:13,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:43:13,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:13,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:43:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:43:13,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 01:43:13,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 79 transitions, 814 flow. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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-13 01:43:13,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:13,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 01:43:13,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:14,200 INFO L130 PetriNetUnfolder]: 652/1342 cut-off events. [2022-12-13 01:43:14,200 INFO L131 PetriNetUnfolder]: For 6866/6866 co-relation queries the response was YES. [2022-12-13 01:43:14,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6163 conditions, 1342 events. 652/1342 cut-off events. For 6866/6866 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7906 event pairs, 247 based on Foata normal form. 1/1343 useless extension candidates. Maximal degree in co-relation 6115. Up to 992 conditions per place. [2022-12-13 01:43:14,206 INFO L137 encePairwiseOnDemand]: 41/52 looper letters, 98 selfloop transitions, 12 changer transitions 22/132 dead transitions. [2022-12-13 01:43:14,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 132 transitions, 1355 flow [2022-12-13 01:43:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:43:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:43:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-12-13 01:43:14,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-13 01:43:14,209 INFO L175 Difference]: Start difference. First operand has 96 places, 79 transitions, 814 flow. Second operand 7 states and 117 transitions. [2022-12-13 01:43:14,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 132 transitions, 1355 flow [2022-12-13 01:43:14,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 132 transitions, 1309 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-12-13 01:43:14,219 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 777 flow [2022-12-13 01:43:14,219 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=777, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2022-12-13 01:43:14,220 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2022-12-13 01:43:14,220 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:14,220 INFO L89 Accepts]: Start accepts. Operand has 95 places, 78 transitions, 777 flow [2022-12-13 01:43:14,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:14,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:14,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 78 transitions, 777 flow [2022-12-13 01:43:14,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 78 transitions, 777 flow [2022-12-13 01:43:14,265 INFO L130 PetriNetUnfolder]: 47/322 cut-off events. [2022-12-13 01:43:14,265 INFO L131 PetriNetUnfolder]: For 1292/1306 co-relation queries the response was YES. [2022-12-13 01:43:14,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 322 events. 47/322 cut-off events. For 1292/1306 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2266 event pairs, 1 based on Foata normal form. 4/318 useless extension candidates. Maximal degree in co-relation 1206. Up to 63 conditions per place. [2022-12-13 01:43:14,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 78 transitions, 777 flow [2022-12-13 01:43:14,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-13 01:43:14,269 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:14,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 01:43:14,272 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 78 transitions, 777 flow [2022-12-13 01:43:14,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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-13 01:43:14,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:14,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:14,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 01:43:14,272 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:14,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:14,275 INFO L85 PathProgramCache]: Analyzing trace with hash 203075571, now seen corresponding path program 1 times [2022-12-13 01:43:14,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:14,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900542448] [2022-12-13 01:43:14,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:14,641 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-13 01:43:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:14,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900542448] [2022-12-13 01:43:14,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900542448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:14,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:14,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097012353] [2022-12-13 01:43:14,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:14,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:14,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:14,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:14,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:43:14,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 78 transitions, 777 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:43:14,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:14,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:43:14,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:14,973 INFO L130 PetriNetUnfolder]: 631/1303 cut-off events. [2022-12-13 01:43:14,974 INFO L131 PetriNetUnfolder]: For 6388/6388 co-relation queries the response was YES. [2022-12-13 01:43:14,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5918 conditions, 1303 events. 631/1303 cut-off events. For 6388/6388 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7643 event pairs, 219 based on Foata normal form. 2/1305 useless extension candidates. Maximal degree in co-relation 5871. Up to 992 conditions per place. [2022-12-13 01:43:14,979 INFO L137 encePairwiseOnDemand]: 40/51 looper letters, 94 selfloop transitions, 10 changer transitions 31/135 dead transitions. [2022-12-13 01:43:14,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 135 transitions, 1356 flow [2022-12-13 01:43:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2022-12-13 01:43:14,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2022-12-13 01:43:14,980 INFO L175 Difference]: Start difference. First operand has 93 places, 78 transitions, 777 flow. Second operand 8 states and 120 transitions. [2022-12-13 01:43:14,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 135 transitions, 1356 flow [2022-12-13 01:43:14,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 135 transitions, 1331 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 01:43:14,990 INFO L231 Difference]: Finished difference. Result has 96 places, 73 transitions, 706 flow [2022-12-13 01:43:14,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=706, PETRI_PLACES=96, PETRI_TRANSITIONS=73} [2022-12-13 01:43:14,990 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2022-12-13 01:43:14,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:14,990 INFO L89 Accepts]: Start accepts. Operand has 96 places, 73 transitions, 706 flow [2022-12-13 01:43:14,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:14,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:14,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 73 transitions, 706 flow [2022-12-13 01:43:14,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 73 transitions, 706 flow [2022-12-13 01:43:15,009 INFO L130 PetriNetUnfolder]: 45/288 cut-off events. [2022-12-13 01:43:15,009 INFO L131 PetriNetUnfolder]: For 1030/1040 co-relation queries the response was YES. [2022-12-13 01:43:15,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 288 events. 45/288 cut-off events. For 1030/1040 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1924 event pairs, 1 based on Foata normal form. 3/283 useless extension candidates. Maximal degree in co-relation 1063. Up to 57 conditions per place. [2022-12-13 01:43:15,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 73 transitions, 706 flow [2022-12-13 01:43:15,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-13 01:43:15,014 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:15,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 01:43:15,014 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 706 flow [2022-12-13 01:43:15,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:43:15,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:15,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:15,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 01:43:15,014 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:15,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1336252999, now seen corresponding path program 1 times [2022-12-13 01:43:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:15,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563010317] [2022-12-13 01:43:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:15,343 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-13 01:43:15,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:15,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563010317] [2022-12-13 01:43:15,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563010317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:15,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:15,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:43:15,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971382548] [2022-12-13 01:43:15,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:15,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:43:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:15,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:43:15,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:43:15,345 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:15,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 706 flow. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:15,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:15,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:15,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:15,765 INFO L130 PetriNetUnfolder]: 575/1145 cut-off events. [2022-12-13 01:43:15,766 INFO L131 PetriNetUnfolder]: For 5424/5424 co-relation queries the response was YES. [2022-12-13 01:43:15,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 1145 events. 575/1145 cut-off events. For 5424/5424 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6194 event pairs, 207 based on Foata normal form. 2/1147 useless extension candidates. Maximal degree in co-relation 5187. Up to 992 conditions per place. [2022-12-13 01:43:15,770 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 69 selfloop transitions, 7 changer transitions 34/110 dead transitions. [2022-12-13 01:43:15,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 110 transitions, 1131 flow [2022-12-13 01:43:15,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:43:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:43:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-12-13 01:43:15,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19591836734693877 [2022-12-13 01:43:15,787 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 706 flow. Second operand 10 states and 96 transitions. [2022-12-13 01:43:15,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 110 transitions, 1131 flow [2022-12-13 01:43:15,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 110 transitions, 1093 flow, removed 4 selfloop flow, removed 9 redundant places. [2022-12-13 01:43:15,795 INFO L231 Difference]: Finished difference. Result has 95 places, 68 transitions, 628 flow [2022-12-13 01:43:15,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=628, PETRI_PLACES=95, PETRI_TRANSITIONS=68} [2022-12-13 01:43:15,795 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2022-12-13 01:43:15,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:15,796 INFO L89 Accepts]: Start accepts. Operand has 95 places, 68 transitions, 628 flow [2022-12-13 01:43:15,796 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:15,796 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:15,796 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 68 transitions, 628 flow [2022-12-13 01:43:15,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 68 transitions, 628 flow [2022-12-13 01:43:15,813 INFO L130 PetriNetUnfolder]: 45/268 cut-off events. [2022-12-13 01:43:15,814 INFO L131 PetriNetUnfolder]: For 920/926 co-relation queries the response was YES. [2022-12-13 01:43:15,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 268 events. 45/268 cut-off events. For 920/926 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1772 event pairs, 1 based on Foata normal form. 3/265 useless extension candidates. Maximal degree in co-relation 990. Up to 53 conditions per place. [2022-12-13 01:43:15,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 68 transitions, 628 flow [2022-12-13 01:43:15,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 418 [2022-12-13 01:43:17,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:17,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1576 [2022-12-13 01:43:17,372 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 67 transitions, 620 flow [2022-12-13 01:43:17,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:17,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:17,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:17,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 01:43:17,373 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:17,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:17,373 INFO L85 PathProgramCache]: Analyzing trace with hash 352969065, now seen corresponding path program 1 times [2022-12-13 01:43:17,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:17,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502491077] [2022-12-13 01:43:17,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:17,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:17,757 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-13 01:43:17,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:17,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502491077] [2022-12-13 01:43:17,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502491077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:17,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:17,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:17,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128625135] [2022-12-13 01:43:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:17,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:17,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:17,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:17,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:17,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:43:17,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 67 transitions, 620 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:17,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:17,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:43:17,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:18,161 INFO L130 PetriNetUnfolder]: 1190/2298 cut-off events. [2022-12-13 01:43:18,161 INFO L131 PetriNetUnfolder]: For 11412/11412 co-relation queries the response was YES. [2022-12-13 01:43:18,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10580 conditions, 2298 events. 1190/2298 cut-off events. For 11412/11412 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14496 event pairs, 335 based on Foata normal form. 2/2300 useless extension candidates. Maximal degree in co-relation 10527. Up to 992 conditions per place. [2022-12-13 01:43:18,172 INFO L137 encePairwiseOnDemand]: 34/47 looper letters, 155 selfloop transitions, 21 changer transitions 14/190 dead transitions. [2022-12-13 01:43:18,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 190 transitions, 1985 flow [2022-12-13 01:43:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2022-12-13 01:43:18,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38534278959810875 [2022-12-13 01:43:18,173 INFO L175 Difference]: Start difference. First operand has 83 places, 67 transitions, 620 flow. Second operand 9 states and 163 transitions. [2022-12-13 01:43:18,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 190 transitions, 1985 flow [2022-12-13 01:43:18,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 190 transitions, 1911 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-12-13 01:43:18,187 INFO L231 Difference]: Finished difference. Result has 87 places, 82 transitions, 801 flow [2022-12-13 01:43:18,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=801, PETRI_PLACES=87, PETRI_TRANSITIONS=82} [2022-12-13 01:43:18,187 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2022-12-13 01:43:18,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:18,188 INFO L89 Accepts]: Start accepts. Operand has 87 places, 82 transitions, 801 flow [2022-12-13 01:43:18,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:18,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:18,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 82 transitions, 801 flow [2022-12-13 01:43:18,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 82 transitions, 801 flow [2022-12-13 01:43:18,245 INFO L130 PetriNetUnfolder]: 103/548 cut-off events. [2022-12-13 01:43:18,246 INFO L131 PetriNetUnfolder]: For 2479/2509 co-relation queries the response was YES. [2022-12-13 01:43:18,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 548 events. 103/548 cut-off events. For 2479/2509 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4515 event pairs, 6 based on Foata normal form. 10/530 useless extension candidates. Maximal degree in co-relation 2161. Up to 122 conditions per place. [2022-12-13 01:43:18,249 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 82 transitions, 801 flow [2022-12-13 01:43:18,249 INFO L226 LiptonReduction]: Number of co-enabled transitions 506 [2022-12-13 01:43:18,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (not (= (ite (= (mod v_~e2~0_229 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (or (<= v_~n1~0_313 v_~n2~0_285) (= v_~n2~0_285 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= v_~i~0_491 (select (select |v_#memory_int_367| v_~f~0.base_290) (+ v_~f~0.offset_297 (* v_~i1~0_227 4)))) (= v_~i1~0_227 v_~i~0_492)) InVars {~n2~0=v_~n2~0_285, ~i~0=v_~i~0_492, ~f~0.base=v_~f~0.base_290, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229} OutVars{~n2~0=v_~n2~0_285, ~i~0=v_~i~0_491, ~f~0.base=v_~f~0.base_290, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~i1~0=v_~i1~0_227, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_144|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 01:43:18,358 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:18,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-13 01:43:18,359 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 819 flow [2022-12-13 01:43:18,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:18,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:18,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:18,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 01:43:18,359 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:18,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:18,359 INFO L85 PathProgramCache]: Analyzing trace with hash -722627919, now seen corresponding path program 1 times [2022-12-13 01:43:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:18,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414997757] [2022-12-13 01:43:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:18,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:18,743 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-13 01:43:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:18,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414997757] [2022-12-13 01:43:18,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414997757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:18,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:18,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317908493] [2022-12-13 01:43:18,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:18,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:18,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:18,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:18,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:18,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 819 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:18,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:18,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:18,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:19,134 INFO L130 PetriNetUnfolder]: 1167/2275 cut-off events. [2022-12-13 01:43:19,134 INFO L131 PetriNetUnfolder]: For 14601/14601 co-relation queries the response was YES. [2022-12-13 01:43:19,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11124 conditions, 2275 events. 1167/2275 cut-off events. For 14601/14601 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14311 event pairs, 308 based on Foata normal form. 2/2277 useless extension candidates. Maximal degree in co-relation 11073. Up to 992 conditions per place. [2022-12-13 01:43:19,145 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 155 selfloop transitions, 24 changer transitions 14/193 dead transitions. [2022-12-13 01:43:19,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 193 transitions, 2067 flow [2022-12-13 01:43:19,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2022-12-13 01:43:19,159 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-13 01:43:19,159 INFO L175 Difference]: Start difference. First operand has 85 places, 82 transitions, 819 flow. Second operand 9 states and 161 transitions. [2022-12-13 01:43:19,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 193 transitions, 2067 flow [2022-12-13 01:43:19,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 193 transitions, 1993 flow, removed 31 selfloop flow, removed 3 redundant places. [2022-12-13 01:43:19,181 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 889 flow [2022-12-13 01:43:19,181 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=889, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2022-12-13 01:43:19,182 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2022-12-13 01:43:19,182 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:19,182 INFO L89 Accepts]: Start accepts. Operand has 94 places, 86 transitions, 889 flow [2022-12-13 01:43:19,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:19,183 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:19,183 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 86 transitions, 889 flow [2022-12-13 01:43:19,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 86 transitions, 889 flow [2022-12-13 01:43:19,216 INFO L130 PetriNetUnfolder]: 111/568 cut-off events. [2022-12-13 01:43:19,216 INFO L131 PetriNetUnfolder]: For 3147/3203 co-relation queries the response was YES. [2022-12-13 01:43:19,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2343 conditions, 568 events. 111/568 cut-off events. For 3147/3203 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4550 event pairs, 3 based on Foata normal form. 16/553 useless extension candidates. Maximal degree in co-relation 2299. Up to 123 conditions per place. [2022-12-13 01:43:19,220 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 86 transitions, 889 flow [2022-12-13 01:43:19,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-13 01:43:19,225 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:19,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 01:43:19,225 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 889 flow [2022-12-13 01:43:19,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:19,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:19,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:19,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 01:43:19,226 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:19,226 INFO L85 PathProgramCache]: Analyzing trace with hash 173117251, now seen corresponding path program 1 times [2022-12-13 01:43:19,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:19,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730299881] [2022-12-13 01:43:19,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:19,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:19,665 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-13 01:43:19,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:19,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730299881] [2022-12-13 01:43:19,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730299881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:19,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:19,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:19,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166428234] [2022-12-13 01:43:19,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:19,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:19,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:19,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:19,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:19,666 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:19,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 889 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:19,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:19,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:19,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:20,131 INFO L130 PetriNetUnfolder]: 1153/2253 cut-off events. [2022-12-13 01:43:20,132 INFO L131 PetriNetUnfolder]: For 15422/15422 co-relation queries the response was YES. [2022-12-13 01:43:20,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11089 conditions, 2253 events. 1153/2253 cut-off events. For 15422/15422 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14142 event pairs, 389 based on Foata normal form. 2/2255 useless extension candidates. Maximal degree in co-relation 11036. Up to 992 conditions per place. [2022-12-13 01:43:20,143 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 149 selfloop transitions, 22 changer transitions 24/195 dead transitions. [2022-12-13 01:43:20,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 195 transitions, 2035 flow [2022-12-13 01:43:20,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2022-12-13 01:43:20,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36281179138321995 [2022-12-13 01:43:20,144 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 889 flow. Second operand 9 states and 160 transitions. [2022-12-13 01:43:20,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 195 transitions, 2035 flow [2022-12-13 01:43:20,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 195 transitions, 1987 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-13 01:43:20,170 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 992 flow [2022-12-13 01:43:20,170 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=992, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2022-12-13 01:43:20,171 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2022-12-13 01:43:20,171 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:20,171 INFO L89 Accepts]: Start accepts. Operand has 98 places, 93 transitions, 992 flow [2022-12-13 01:43:20,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:20,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:20,172 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 992 flow [2022-12-13 01:43:20,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 93 transitions, 992 flow [2022-12-13 01:43:20,207 INFO L130 PetriNetUnfolder]: 99/553 cut-off events. [2022-12-13 01:43:20,207 INFO L131 PetriNetUnfolder]: For 2991/3040 co-relation queries the response was YES. [2022-12-13 01:43:20,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 553 events. 99/553 cut-off events. For 2991/3040 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4537 event pairs, 3 based on Foata normal form. 19/545 useless extension candidates. Maximal degree in co-relation 2264. Up to 115 conditions per place. [2022-12-13 01:43:20,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 93 transitions, 992 flow [2022-12-13 01:43:20,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 588 [2022-12-13 01:43:20,214 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:20,214 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 01:43:20,215 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 93 transitions, 992 flow [2022-12-13 01:43:20,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:20,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:20,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:20,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 01:43:20,215 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:20,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:20,215 INFO L85 PathProgramCache]: Analyzing trace with hash 250764787, now seen corresponding path program 2 times [2022-12-13 01:43:20,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:20,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243537374] [2022-12-13 01:43:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:20,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:20,708 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-13 01:43:20,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:20,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243537374] [2022-12-13 01:43:20,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243537374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:20,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:20,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720384899] [2022-12-13 01:43:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:20,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:20,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:20,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:20,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 93 transitions, 992 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:20,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:20,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:20,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:21,241 INFO L130 PetriNetUnfolder]: 1169/2325 cut-off events. [2022-12-13 01:43:21,242 INFO L131 PetriNetUnfolder]: For 16553/16553 co-relation queries the response was YES. [2022-12-13 01:43:21,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11540 conditions, 2325 events. 1169/2325 cut-off events. For 16553/16553 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15058 event pairs, 368 based on Foata normal form. 2/2327 useless extension candidates. Maximal degree in co-relation 11479. Up to 992 conditions per place. [2022-12-13 01:43:21,254 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 174 selfloop transitions, 26 changer transitions 11/211 dead transitions. [2022-12-13 01:43:21,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 211 transitions, 2241 flow [2022-12-13 01:43:21,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:43:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:43:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2022-12-13 01:43:21,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3510204081632653 [2022-12-13 01:43:21,255 INFO L175 Difference]: Start difference. First operand has 97 places, 93 transitions, 992 flow. Second operand 10 states and 172 transitions. [2022-12-13 01:43:21,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 211 transitions, 2241 flow [2022-12-13 01:43:21,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 211 transitions, 2216 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 01:43:21,282 INFO L231 Difference]: Finished difference. Result has 107 places, 99 transitions, 1143 flow [2022-12-13 01:43:21,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1143, PETRI_PLACES=107, PETRI_TRANSITIONS=99} [2022-12-13 01:43:21,282 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:43:21,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:21,282 INFO L89 Accepts]: Start accepts. Operand has 107 places, 99 transitions, 1143 flow [2022-12-13 01:43:21,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:21,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:21,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 1143 flow [2022-12-13 01:43:21,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 1143 flow [2022-12-13 01:43:21,322 INFO L130 PetriNetUnfolder]: 97/571 cut-off events. [2022-12-13 01:43:21,323 INFO L131 PetriNetUnfolder]: For 3565/3616 co-relation queries the response was YES. [2022-12-13 01:43:21,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2480 conditions, 571 events. 97/571 cut-off events. For 3565/3616 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4818 event pairs, 7 based on Foata normal form. 19/563 useless extension candidates. Maximal degree in co-relation 2426. Up to 116 conditions per place. [2022-12-13 01:43:21,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 1143 flow [2022-12-13 01:43:21,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-13 01:43:21,330 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:21,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 01:43:21,331 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 99 transitions, 1143 flow [2022-12-13 01:43:21,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:21,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:21,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:21,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 01:43:21,331 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 629058341, now seen corresponding path program 3 times [2022-12-13 01:43:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:21,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541302767] [2022-12-13 01:43:21,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:21,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:21,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-13 01:43:21,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:21,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541302767] [2022-12-13 01:43:21,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541302767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:21,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:21,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:21,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597706019] [2022-12-13 01:43:21,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:21,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:21,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:21,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:21,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:21,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:21,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 99 transitions, 1143 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:21,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:21,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:21,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:22,400 INFO L130 PetriNetUnfolder]: 1151/2275 cut-off events. [2022-12-13 01:43:22,401 INFO L131 PetriNetUnfolder]: For 19182/19182 co-relation queries the response was YES. [2022-12-13 01:43:22,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11884 conditions, 2275 events. 1151/2275 cut-off events. For 19182/19182 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14631 event pairs, 356 based on Foata normal form. 2/2277 useless extension candidates. Maximal degree in co-relation 11825. Up to 992 conditions per place. [2022-12-13 01:43:22,416 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 154 selfloop transitions, 21 changer transitions 25/200 dead transitions. [2022-12-13 01:43:22,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 200 transitions, 2243 flow [2022-12-13 01:43:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:22,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2022-12-13 01:43:22,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-13 01:43:22,417 INFO L175 Difference]: Start difference. First operand has 106 places, 99 transitions, 1143 flow. Second operand 9 states and 161 transitions. [2022-12-13 01:43:22,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 200 transitions, 2243 flow [2022-12-13 01:43:22,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 200 transitions, 2191 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-13 01:43:22,461 INFO L231 Difference]: Finished difference. Result has 109 places, 93 transitions, 1057 flow [2022-12-13 01:43:22,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1057, PETRI_PLACES=109, PETRI_TRANSITIONS=93} [2022-12-13 01:43:22,462 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2022-12-13 01:43:22,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:22,462 INFO L89 Accepts]: Start accepts. Operand has 109 places, 93 transitions, 1057 flow [2022-12-13 01:43:22,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:22,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:22,463 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 93 transitions, 1057 flow [2022-12-13 01:43:22,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 93 transitions, 1057 flow [2022-12-13 01:43:22,498 INFO L130 PetriNetUnfolder]: 94/556 cut-off events. [2022-12-13 01:43:22,498 INFO L131 PetriNetUnfolder]: For 3417/3463 co-relation queries the response was YES. [2022-12-13 01:43:22,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 556 events. 94/556 cut-off events. For 3417/3463 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4624 event pairs, 7 based on Foata normal form. 16/545 useless extension candidates. Maximal degree in co-relation 2348. Up to 115 conditions per place. [2022-12-13 01:43:22,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 93 transitions, 1057 flow [2022-12-13 01:43:22,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 594 [2022-12-13 01:43:22,629 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:22,632 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 01:43:22,632 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 1073 flow [2022-12-13 01:43:22,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:22,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:22,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:22,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 01:43:22,632 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:22,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:22,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1195931451, now seen corresponding path program 4 times [2022-12-13 01:43:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:22,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576406791] [2022-12-13 01:43:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:22,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:23,854 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-13 01:43:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:23,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576406791] [2022-12-13 01:43:23,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576406791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:23,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:23,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:43:23,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102527559] [2022-12-13 01:43:23,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:23,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:43:23,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:23,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:43:23,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:43:23,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 01:43:23,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 1073 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:23,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:23,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 01:43:23,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:24,501 INFO L130 PetriNetUnfolder]: 1115/2227 cut-off events. [2022-12-13 01:43:24,501 INFO L131 PetriNetUnfolder]: For 19138/19138 co-relation queries the response was YES. [2022-12-13 01:43:24,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11508 conditions, 2227 events. 1115/2227 cut-off events. For 19138/19138 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14384 event pairs, 415 based on Foata normal form. 2/2229 useless extension candidates. Maximal degree in co-relation 11450. Up to 992 conditions per place. [2022-12-13 01:43:24,513 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 148 selfloop transitions, 18 changer transitions 31/197 dead transitions. [2022-12-13 01:43:24,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 197 transitions, 2233 flow [2022-12-13 01:43:24,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2022-12-13 01:43:24,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3418803418803419 [2022-12-13 01:43:24,516 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 1073 flow. Second operand 9 states and 160 transitions. [2022-12-13 01:43:24,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 197 transitions, 2233 flow [2022-12-13 01:43:24,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 197 transitions, 2155 flow, removed 15 selfloop flow, removed 11 redundant places. [2022-12-13 01:43:24,550 INFO L231 Difference]: Finished difference. Result has 104 places, 90 transitions, 1024 flow [2022-12-13 01:43:24,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1024, PETRI_PLACES=104, PETRI_TRANSITIONS=90} [2022-12-13 01:43:24,550 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places. [2022-12-13 01:43:24,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:24,550 INFO L89 Accepts]: Start accepts. Operand has 104 places, 90 transitions, 1024 flow [2022-12-13 01:43:24,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:24,551 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:24,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 90 transitions, 1024 flow [2022-12-13 01:43:24,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 90 transitions, 1024 flow [2022-12-13 01:43:24,585 INFO L130 PetriNetUnfolder]: 90/528 cut-off events. [2022-12-13 01:43:24,585 INFO L131 PetriNetUnfolder]: For 3430/3476 co-relation queries the response was YES. [2022-12-13 01:43:24,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 528 events. 90/528 cut-off events. For 3430/3476 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4302 event pairs, 9 based on Foata normal form. 15/518 useless extension candidates. Maximal degree in co-relation 2253. Up to 114 conditions per place. [2022-12-13 01:43:24,589 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 90 transitions, 1024 flow [2022-12-13 01:43:24,589 INFO L226 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-13 01:43:24,602 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:24,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 01:43:24,602 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 90 transitions, 1024 flow [2022-12-13 01:43:24,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:24,603 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:24,603 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:24,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 01:43:24,603 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:24,606 INFO L85 PathProgramCache]: Analyzing trace with hash 440479934, now seen corresponding path program 1 times [2022-12-13 01:43:24,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:24,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105006441] [2022-12-13 01:43:24,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:24,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:24,979 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-13 01:43:24,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:24,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105006441] [2022-12-13 01:43:24,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105006441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:24,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:24,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:24,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630622371] [2022-12-13 01:43:24,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:24,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:24,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:24,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:24,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:24,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 01:43:24,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 90 transitions, 1024 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:24,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:24,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 01:43:24,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:25,342 INFO L130 PetriNetUnfolder]: 1080/2147 cut-off events. [2022-12-13 01:43:25,342 INFO L131 PetriNetUnfolder]: For 17782/17782 co-relation queries the response was YES. [2022-12-13 01:43:25,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11103 conditions, 2147 events. 1080/2147 cut-off events. For 17782/17782 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13663 event pairs, 409 based on Foata normal form. 2/2149 useless extension candidates. Maximal degree in co-relation 11046. Up to 992 conditions per place. [2022-12-13 01:43:25,354 INFO L137 encePairwiseOnDemand]: 39/52 looper letters, 142 selfloop transitions, 15 changer transitions 31/188 dead transitions. [2022-12-13 01:43:25,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 188 transitions, 2114 flow [2022-12-13 01:43:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2022-12-13 01:43:25,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36778846153846156 [2022-12-13 01:43:25,355 INFO L175 Difference]: Start difference. First operand has 101 places, 90 transitions, 1024 flow. Second operand 8 states and 153 transitions. [2022-12-13 01:43:25,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 188 transitions, 2114 flow [2022-12-13 01:43:25,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 188 transitions, 2049 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-12-13 01:43:25,386 INFO L231 Difference]: Finished difference. Result has 101 places, 86 transitions, 915 flow [2022-12-13 01:43:25,386 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=915, PETRI_PLACES=101, PETRI_TRANSITIONS=86} [2022-12-13 01:43:25,386 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2022-12-13 01:43:25,386 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:25,386 INFO L89 Accepts]: Start accepts. Operand has 101 places, 86 transitions, 915 flow [2022-12-13 01:43:25,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:25,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:25,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 86 transitions, 915 flow [2022-12-13 01:43:25,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 86 transitions, 915 flow [2022-12-13 01:43:25,421 INFO L130 PetriNetUnfolder]: 86/513 cut-off events. [2022-12-13 01:43:25,421 INFO L131 PetriNetUnfolder]: For 3012/3057 co-relation queries the response was YES. [2022-12-13 01:43:25,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 513 events. 86/513 cut-off events. For 3012/3057 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4185 event pairs, 11 based on Foata normal form. 14/502 useless extension candidates. Maximal degree in co-relation 2097. Up to 114 conditions per place. [2022-12-13 01:43:25,425 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 86 transitions, 915 flow [2022-12-13 01:43:25,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-13 01:43:25,429 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:25,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 01:43:25,429 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 915 flow [2022-12-13 01:43:25,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:25,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:25,430 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:25,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 01:43:25,430 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:25,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2118344682, now seen corresponding path program 1 times [2022-12-13 01:43:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:25,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175699787] [2022-12-13 01:43:25,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:25,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:25,674 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-13 01:43:25,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:25,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175699787] [2022-12-13 01:43:25,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175699787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:25,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:25,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:25,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497676450] [2022-12-13 01:43:25,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:25,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:25,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:25,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:25,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 86 transitions, 915 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:25,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:25,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:25,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:26,305 INFO L130 PetriNetUnfolder]: 1090/2236 cut-off events. [2022-12-13 01:43:26,306 INFO L131 PetriNetUnfolder]: For 17442/17442 co-relation queries the response was YES. [2022-12-13 01:43:26,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11163 conditions, 2236 events. 1090/2236 cut-off events. For 17442/17442 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14658 event pairs, 212 based on Foata normal form. 3/2239 useless extension candidates. Maximal degree in co-relation 11089. Up to 715 conditions per place. [2022-12-13 01:43:26,314 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 195 selfloop transitions, 38 changer transitions 12/245 dead transitions. [2022-12-13 01:43:26,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 245 transitions, 2493 flow [2022-12-13 01:43:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 01:43:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 01:43:26,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 221 transitions. [2022-12-13 01:43:26,315 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32215743440233235 [2022-12-13 01:43:26,315 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 915 flow. Second operand 14 states and 221 transitions. [2022-12-13 01:43:26,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 245 transitions, 2493 flow [2022-12-13 01:43:26,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 245 transitions, 2432 flow, removed 11 selfloop flow, removed 9 redundant places. [2022-12-13 01:43:26,338 INFO L231 Difference]: Finished difference. Result has 108 places, 96 transitions, 1099 flow [2022-12-13 01:43:26,338 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1099, PETRI_PLACES=108, PETRI_TRANSITIONS=96} [2022-12-13 01:43:26,339 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:43:26,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:26,339 INFO L89 Accepts]: Start accepts. Operand has 108 places, 96 transitions, 1099 flow [2022-12-13 01:43:26,339 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:26,339 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:26,340 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 96 transitions, 1099 flow [2022-12-13 01:43:26,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 96 transitions, 1099 flow [2022-12-13 01:43:26,374 INFO L130 PetriNetUnfolder]: 78/543 cut-off events. [2022-12-13 01:43:26,374 INFO L131 PetriNetUnfolder]: For 3699/3743 co-relation queries the response was YES. [2022-12-13 01:43:26,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2327 conditions, 543 events. 78/543 cut-off events. For 3699/3743 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4541 event pairs, 1 based on Foata normal form. 15/533 useless extension candidates. Maximal degree in co-relation 2265. Up to 115 conditions per place. [2022-12-13 01:43:26,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 96 transitions, 1099 flow [2022-12-13 01:43:26,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 606 [2022-12-13 01:43:26,381 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:26,382 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 01:43:26,382 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 96 transitions, 1099 flow [2022-12-13 01:43:26,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:26,382 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:26,382 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:26,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 01:43:26,382 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:26,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:26,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1746474124, now seen corresponding path program 2 times [2022-12-13 01:43:26,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:26,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316538434] [2022-12-13 01:43:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:26,946 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-13 01:43:26,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:26,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316538434] [2022-12-13 01:43:26,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316538434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:26,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:26,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:43:26,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892639163] [2022-12-13 01:43:26,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:26,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:43:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:43:26,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:43:26,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:26,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 1099 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:26,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:26,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:26,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:27,556 INFO L130 PetriNetUnfolder]: 1063/2161 cut-off events. [2022-12-13 01:43:27,556 INFO L131 PetriNetUnfolder]: For 19511/19511 co-relation queries the response was YES. [2022-12-13 01:43:27,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11282 conditions, 2161 events. 1063/2161 cut-off events. For 19511/19511 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13966 event pairs, 323 based on Foata normal form. 3/2164 useless extension candidates. Maximal degree in co-relation 11214. Up to 1034 conditions per place. [2022-12-13 01:43:27,564 INFO L137 encePairwiseOnDemand]: 33/49 looper letters, 149 selfloop transitions, 29 changer transitions 24/202 dead transitions. [2022-12-13 01:43:27,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 202 transitions, 2251 flow [2022-12-13 01:43:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:43:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:43:27,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2022-12-13 01:43:27,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3510204081632653 [2022-12-13 01:43:27,566 INFO L175 Difference]: Start difference. First operand has 107 places, 96 transitions, 1099 flow. Second operand 10 states and 172 transitions. [2022-12-13 01:43:27,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 202 transitions, 2251 flow [2022-12-13 01:43:27,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 202 transitions, 2165 flow, removed 26 selfloop flow, removed 6 redundant places. [2022-12-13 01:43:27,593 INFO L231 Difference]: Finished difference. Result has 111 places, 92 transitions, 1050 flow [2022-12-13 01:43:27,593 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1050, PETRI_PLACES=111, PETRI_TRANSITIONS=92} [2022-12-13 01:43:27,593 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:43:27,594 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:27,594 INFO L89 Accepts]: Start accepts. Operand has 111 places, 92 transitions, 1050 flow [2022-12-13 01:43:27,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:27,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:27,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 92 transitions, 1050 flow [2022-12-13 01:43:27,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 92 transitions, 1050 flow [2022-12-13 01:43:27,627 INFO L130 PetriNetUnfolder]: 76/533 cut-off events. [2022-12-13 01:43:27,627 INFO L131 PetriNetUnfolder]: For 3362/3396 co-relation queries the response was YES. [2022-12-13 01:43:27,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2253 conditions, 533 events. 76/533 cut-off events. For 3362/3396 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4474 event pairs, 7 based on Foata normal form. 11/519 useless extension candidates. Maximal degree in co-relation 2198. Up to 111 conditions per place. [2022-12-13 01:43:27,630 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 92 transitions, 1050 flow [2022-12-13 01:43:27,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 01:43:27,634 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:27,634 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 01:43:27,634 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 92 transitions, 1050 flow [2022-12-13 01:43:27,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:27,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:27,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:27,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 01:43:27,635 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:27,635 INFO L85 PathProgramCache]: Analyzing trace with hash 127082429, now seen corresponding path program 5 times [2022-12-13 01:43:27,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:27,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073638797] [2022-12-13 01:43:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:27,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:28,151 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-13 01:43:28,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:28,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073638797] [2022-12-13 01:43:28,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073638797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:28,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:28,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:43:28,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41378162] [2022-12-13 01:43:28,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:28,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:43:28,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:28,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:43:28,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:43:28,153 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:28,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 92 transitions, 1050 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:28,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:28,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:28,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:28,774 INFO L130 PetriNetUnfolder]: 1103/2276 cut-off events. [2022-12-13 01:43:28,774 INFO L131 PetriNetUnfolder]: For 20355/20355 co-relation queries the response was YES. [2022-12-13 01:43:28,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11779 conditions, 2276 events. 1103/2276 cut-off events. For 20355/20355 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15095 event pairs, 439 based on Foata normal form. 2/2278 useless extension candidates. Maximal degree in co-relation 11712. Up to 1034 conditions per place. [2022-12-13 01:43:28,785 INFO L137 encePairwiseOnDemand]: 37/49 looper letters, 152 selfloop transitions, 15 changer transitions 30/197 dead transitions. [2022-12-13 01:43:28,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 197 transitions, 2248 flow [2022-12-13 01:43:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2022-12-13 01:43:28,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-13 01:43:28,786 INFO L175 Difference]: Start difference. First operand has 109 places, 92 transitions, 1050 flow. Second operand 9 states and 161 transitions. [2022-12-13 01:43:28,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 197 transitions, 2248 flow [2022-12-13 01:43:28,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 197 transitions, 2151 flow, removed 9 selfloop flow, removed 10 redundant places. [2022-12-13 01:43:28,810 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 1037 flow [2022-12-13 01:43:28,811 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1037, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2022-12-13 01:43:28,811 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:43:28,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:28,811 INFO L89 Accepts]: Start accepts. Operand has 111 places, 93 transitions, 1037 flow [2022-12-13 01:43:28,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:28,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:28,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 93 transitions, 1037 flow [2022-12-13 01:43:28,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 93 transitions, 1037 flow [2022-12-13 01:43:28,857 INFO L130 PetriNetUnfolder]: 76/544 cut-off events. [2022-12-13 01:43:28,858 INFO L131 PetriNetUnfolder]: For 3528/3567 co-relation queries the response was YES. [2022-12-13 01:43:28,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2228 conditions, 544 events. 76/544 cut-off events. For 3528/3567 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4627 event pairs, 7 based on Foata normal form. 13/530 useless extension candidates. Maximal degree in co-relation 2171. Up to 112 conditions per place. [2022-12-13 01:43:28,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 93 transitions, 1037 flow [2022-12-13 01:43:28,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-13 01:43:28,864 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:28,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 01:43:28,865 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 93 transitions, 1037 flow [2022-12-13 01:43:28,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:28,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:28,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:28,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 01:43:28,865 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1366517109, now seen corresponding path program 6 times [2022-12-13 01:43:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:28,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646445520] [2022-12-13 01:43:28,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:28,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:29,276 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-13 01:43:29,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:29,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646445520] [2022-12-13 01:43:29,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646445520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:29,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:29,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368629335] [2022-12-13 01:43:29,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:29,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:29,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:29,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:29,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:29,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 93 transitions, 1037 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:29,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:29,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:29,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:29,733 INFO L130 PetriNetUnfolder]: 1065/2202 cut-off events. [2022-12-13 01:43:29,733 INFO L131 PetriNetUnfolder]: For 18756/18756 co-relation queries the response was YES. [2022-12-13 01:43:29,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11044 conditions, 2202 events. 1065/2202 cut-off events. For 18756/18756 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14420 event pairs, 441 based on Foata normal form. 2/2204 useless extension candidates. Maximal degree in co-relation 10975. Up to 1034 conditions per place. [2022-12-13 01:43:29,744 INFO L137 encePairwiseOnDemand]: 37/49 looper letters, 142 selfloop transitions, 13 changer transitions 38/193 dead transitions. [2022-12-13 01:43:29,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 193 transitions, 2153 flow [2022-12-13 01:43:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2022-12-13 01:43:29,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35374149659863946 [2022-12-13 01:43:29,745 INFO L175 Difference]: Start difference. First operand has 108 places, 93 transitions, 1037 flow. Second operand 9 states and 156 transitions. [2022-12-13 01:43:29,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 193 transitions, 2153 flow [2022-12-13 01:43:29,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 193 transitions, 2115 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 01:43:29,773 INFO L231 Difference]: Finished difference. Result has 112 places, 90 transitions, 986 flow [2022-12-13 01:43:29,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=986, PETRI_PLACES=112, PETRI_TRANSITIONS=90} [2022-12-13 01:43:29,774 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2022-12-13 01:43:29,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:29,774 INFO L89 Accepts]: Start accepts. Operand has 112 places, 90 transitions, 986 flow [2022-12-13 01:43:29,774 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:29,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:29,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 90 transitions, 986 flow [2022-12-13 01:43:29,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 90 transitions, 986 flow [2022-12-13 01:43:29,807 INFO L130 PetriNetUnfolder]: 75/506 cut-off events. [2022-12-13 01:43:29,807 INFO L131 PetriNetUnfolder]: For 2844/2882 co-relation queries the response was YES. [2022-12-13 01:43:29,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2094 conditions, 506 events. 75/506 cut-off events. For 2844/2882 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4127 event pairs, 1 based on Foata normal form. 13/496 useless extension candidates. Maximal degree in co-relation 2037. Up to 103 conditions per place. [2022-12-13 01:43:29,811 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 90 transitions, 986 flow [2022-12-13 01:43:29,811 INFO L226 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-13 01:43:29,816 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:29,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 01:43:29,817 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 986 flow [2022-12-13 01:43:29,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:29,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:29,817 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:29,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 01:43:29,818 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:29,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash -438800808, now seen corresponding path program 3 times [2022-12-13 01:43:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:29,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162707672] [2022-12-13 01:43:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:30,198 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-13 01:43:30,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:30,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162707672] [2022-12-13 01:43:30,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162707672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:30,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:30,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:30,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810866458] [2022-12-13 01:43:30,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:30,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:30,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:30,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:30,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:30,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:43:30,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 90 transitions, 986 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:30,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:30,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:43:30,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:30,631 INFO L130 PetriNetUnfolder]: 1029/2123 cut-off events. [2022-12-13 01:43:30,631 INFO L131 PetriNetUnfolder]: For 15641/15641 co-relation queries the response was YES. [2022-12-13 01:43:30,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10569 conditions, 2123 events. 1029/2123 cut-off events. For 15641/15641 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13780 event pairs, 385 based on Foata normal form. 3/2126 useless extension candidates. Maximal degree in co-relation 10500. Up to 1034 conditions per place. [2022-12-13 01:43:30,641 INFO L137 encePairwiseOnDemand]: 37/48 looper letters, 141 selfloop transitions, 15 changer transitions 38/194 dead transitions. [2022-12-13 01:43:30,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 194 transitions, 2166 flow [2022-12-13 01:43:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2022-12-13 01:43:30,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2022-12-13 01:43:30,642 INFO L175 Difference]: Start difference. First operand has 106 places, 90 transitions, 986 flow. Second operand 9 states and 165 transitions. [2022-12-13 01:43:30,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 194 transitions, 2166 flow [2022-12-13 01:43:30,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 194 transitions, 2076 flow, removed 29 selfloop flow, removed 11 redundant places. [2022-12-13 01:43:30,668 INFO L231 Difference]: Finished difference. Result has 106 places, 85 transitions, 898 flow [2022-12-13 01:43:30,668 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=898, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2022-12-13 01:43:30,668 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 01:43:30,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:30,668 INFO L89 Accepts]: Start accepts. Operand has 106 places, 85 transitions, 898 flow [2022-12-13 01:43:30,669 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:30,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:30,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 85 transitions, 898 flow [2022-12-13 01:43:30,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 85 transitions, 898 flow [2022-12-13 01:43:30,699 INFO L130 PetriNetUnfolder]: 67/488 cut-off events. [2022-12-13 01:43:30,699 INFO L131 PetriNetUnfolder]: For 2546/2572 co-relation queries the response was YES. [2022-12-13 01:43:30,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 488 events. 67/488 cut-off events. For 2546/2572 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3975 event pairs, 1 based on Foata normal form. 6/471 useless extension candidates. Maximal degree in co-relation 1926. Up to 101 conditions per place. [2022-12-13 01:43:30,702 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 85 transitions, 898 flow [2022-12-13 01:43:30,702 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 01:43:30,852 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] L53-->L97: Formula: (and (= v_~e2~0_167 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|) (= (+ v_~tmp1~0_123 1) v_~n1~0_225) (= v_~e1~0_133 0) (= (+ v_~tmp2~0_121 1) v_~n2~0_206) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| (ite (= (mod v_~e1~0_133 256) 0) 1 0))) InVars {~tmp2~0=v_~tmp2~0_121, ~tmp1~0=v_~tmp1~0_123} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|, ~n2~0=v_~n2~0_206, ~n1~0=v_~n1~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77|, ~tmp2~0=v_~tmp2~0_121, ~e2~0=v_~e2~0_167, ~tmp1~0=v_~tmp1~0_123, ~e1~0=v_~e1~0_133} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0, ~e1~0] and [787] L59-->thread1EXIT: Formula: (and (not (= (ite (or (= v_~n2~0_546 0) (<= v_~n1~0_512 v_~n2~0_546)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_#res#1.base_40| 0) (= v_~n1~0_511 0) (= v_~i~0_847 (select (select |v_#memory_int_537| v_~f~0.base_458) (+ v_~f~0.offset_464 (* v_~i1~0_341 4)))) (= v_~i1~0_341 v_~i~0_848) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256| (ite (and (<= 0 v_~i~0_847) (< v_~i~0_847 v_~n~0_307)) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_40| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_256|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_256| 0)) (not (= (ite (= (mod v_~e2~0_442 256) 0) 1 0) 0))) InVars {~n2~0=v_~n2~0_546, ~i~0=v_~i~0_848, ~f~0.base=v_~f~0.base_458, ~n1~0=v_~n1~0_512, #memory_int=|v_#memory_int_537|, ~n~0=v_~n~0_307, ~f~0.offset=v_~f~0.offset_464, ~e2~0=v_~e2~0_442} OutVars{~n2~0=v_~n2~0_546, ~i~0=v_~i~0_847, ~n1~0=v_~n1~0_511, ~f~0.base=v_~f~0.base_458, ~i1~0=v_~i1~0_341, ~f~0.offset=v_~f~0.offset_464, ~e2~0=v_~e2~0_442, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_256|, #memory_int=|v_#memory_int_537|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_40|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_40|, ~n~0=v_~n~0_307, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_256|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_256|} AuxVars[] AssignedVars[~i~0, ~n1~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:43:31,011 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] L59-->L154-3: Formula: (and (= |v_#memory_int_477| (store |v_#memory_int_478| |v_ULTIMATE.start_main_~#t2~0#1.base_67| (store (select |v_#memory_int_478| |v_ULTIMATE.start_main_~#t2~0#1.base_67|) |v_ULTIMATE.start_main_~#t2~0#1.offset_51| |v_ULTIMATE.start_main_#t~pre15#1_75|))) (= (ite (or (<= v_~n1~0_452 v_~n2~0_470) (= v_~n2~0_470 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|) (not (= (ite (= (mod v_~e2~0_370 256) 0) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre15#1_75| |v_#pthreadsForks_111|) (= (+ |v_#pthreadsForks_111| 1) |v_#pthreadsForks_110|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_202| 0)) (= (select (select |v_#memory_int_478| v_~f~0.base_388) (+ (* v_~i1~0_289 4) v_~f~0.offset_395)) v_~i~0_716) (= v_~i1~0_289 v_~i~0_717)) InVars {#pthreadsForks=|v_#pthreadsForks_111|, ~n2~0=v_~n2~0_470, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~i~0=v_~i~0_717, ~f~0.base=v_~f~0.base_388, ~n1~0=v_~n1~0_452, #memory_int=|v_#memory_int_478|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_67|, ~f~0.offset=v_~f~0.offset_395, ~e2~0=v_~e2~0_370} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_59|, ~n2~0=v_~n2~0_470, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_51|, ~i~0=v_~i~0_716, ~f~0.base=v_~f~0.base_388, ~n1~0=v_~n1~0_452, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_75|, ~i1~0=v_~i1~0_289, ~f~0.offset=v_~f~0.offset_395, ~e2~0=v_~e2~0_370, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_43|, #pthreadsForks=|v_#pthreadsForks_110|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_202|, #memory_int=|v_#memory_int_477|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_204|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_67|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre15#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, ULTIMATE.start_main_#t~nondet14#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [506] L71-->L74: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= (ite (and (<= 0 v_~i~0_32) (< v_~i~0_32 v_~n~0_22)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~n~0=v_~n~0_22, ~i~0=v_~i~0_32} OutVars{~n~0=v_~n~0_22, ~i~0=v_~i~0_32, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:43:31,119 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:43:31,120 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 452 [2022-12-13 01:43:31,120 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 932 flow [2022-12-13 01:43:31,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:31,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:31,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:31,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 01:43:31,120 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:31,121 INFO L85 PathProgramCache]: Analyzing trace with hash -179303746, now seen corresponding path program 1 times [2022-12-13 01:43:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:31,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734310950] [2022-12-13 01:43:31,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:31,528 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-13 01:43:31,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:31,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734310950] [2022-12-13 01:43:31,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734310950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:31,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:31,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102001579] [2022-12-13 01:43:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:31,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:31,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:31,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:31,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:31,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:43:31,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 932 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:31,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:31,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:43:31,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:32,056 INFO L130 PetriNetUnfolder]: 913/1912 cut-off events. [2022-12-13 01:43:32,056 INFO L131 PetriNetUnfolder]: For 14663/14663 co-relation queries the response was YES. [2022-12-13 01:43:32,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9454 conditions, 1912 events. 913/1912 cut-off events. For 14663/14663 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12323 event pairs, 328 based on Foata normal form. 3/1915 useless extension candidates. Maximal degree in co-relation 9388. Up to 1034 conditions per place. [2022-12-13 01:43:32,068 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 124 selfloop transitions, 11 changer transitions 49/184 dead transitions. [2022-12-13 01:43:32,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 184 transitions, 2002 flow [2022-12-13 01:43:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:32,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2022-12-13 01:43:32,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36 [2022-12-13 01:43:32,070 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 932 flow. Second operand 9 states and 162 transitions. [2022-12-13 01:43:32,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 184 transitions, 2002 flow [2022-12-13 01:43:32,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 184 transitions, 1918 flow, removed 24 selfloop flow, removed 10 redundant places. [2022-12-13 01:43:32,099 INFO L231 Difference]: Finished difference. Result has 103 places, 72 transitions, 708 flow [2022-12-13 01:43:32,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=708, PETRI_PLACES=103, PETRI_TRANSITIONS=72} [2022-12-13 01:43:32,100 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2022-12-13 01:43:32,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:32,100 INFO L89 Accepts]: Start accepts. Operand has 103 places, 72 transitions, 708 flow [2022-12-13 01:43:32,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:32,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:32,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 72 transitions, 708 flow [2022-12-13 01:43:32,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 72 transitions, 708 flow [2022-12-13 01:43:32,125 INFO L130 PetriNetUnfolder]: 61/411 cut-off events. [2022-12-13 01:43:32,126 INFO L131 PetriNetUnfolder]: For 1810/1817 co-relation queries the response was YES. [2022-12-13 01:43:32,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 411 events. 61/411 cut-off events. For 1810/1817 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3131 event pairs, 1 based on Foata normal form. 4/398 useless extension candidates. Maximal degree in co-relation 1544. Up to 85 conditions per place. [2022-12-13 01:43:32,128 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 72 transitions, 708 flow [2022-12-13 01:43:32,128 INFO L226 LiptonReduction]: Number of co-enabled transitions 430 [2022-12-13 01:43:32,129 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:32,146 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 01:43:32,147 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 72 transitions, 708 flow [2022-12-13 01:43:32,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:32,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:32,147 INFO L214 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] [2022-12-13 01:43:32,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 01:43:32,147 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:32,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:32,147 INFO L85 PathProgramCache]: Analyzing trace with hash 802008007, now seen corresponding path program 1 times [2022-12-13 01:43:32,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:32,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791931018] [2022-12-13 01:43:32,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:32,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:32,668 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-13 01:43:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:32,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791931018] [2022-12-13 01:43:32,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791931018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:32,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:32,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:32,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152415114] [2022-12-13 01:43:32,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:32,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:32,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:32,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:32,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:32,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:43:32,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 72 transitions, 708 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:32,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:32,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:43:32,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:33,063 INFO L130 PetriNetUnfolder]: 766/1573 cut-off events. [2022-12-13 01:43:33,063 INFO L131 PetriNetUnfolder]: For 9507/9507 co-relation queries the response was YES. [2022-12-13 01:43:33,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7386 conditions, 1573 events. 766/1573 cut-off events. For 9507/9507 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9411 event pairs, 277 based on Foata normal form. 3/1576 useless extension candidates. Maximal degree in co-relation 7330. Up to 1034 conditions per place. [2022-12-13 01:43:33,071 INFO L137 encePairwiseOnDemand]: 36/47 looper letters, 101 selfloop transitions, 12 changer transitions 41/154 dead transitions. [2022-12-13 01:43:33,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 154 transitions, 1581 flow [2022-12-13 01:43:33,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:33,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-12-13 01:43:33,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3262411347517731 [2022-12-13 01:43:33,072 INFO L175 Difference]: Start difference. First operand has 93 places, 72 transitions, 708 flow. Second operand 9 states and 138 transitions. [2022-12-13 01:43:33,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 154 transitions, 1581 flow [2022-12-13 01:43:33,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 154 transitions, 1499 flow, removed 21 selfloop flow, removed 13 redundant places. [2022-12-13 01:43:33,088 INFO L231 Difference]: Finished difference. Result has 92 places, 73 transitions, 693 flow [2022-12-13 01:43:33,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=693, PETRI_PLACES=92, PETRI_TRANSITIONS=73} [2022-12-13 01:43:33,089 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2022-12-13 01:43:33,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:33,089 INFO L89 Accepts]: Start accepts. Operand has 92 places, 73 transitions, 693 flow [2022-12-13 01:43:33,089 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:33,089 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:33,089 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 73 transitions, 693 flow [2022-12-13 01:43:33,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 73 transitions, 693 flow [2022-12-13 01:43:33,113 INFO L130 PetriNetUnfolder]: 58/372 cut-off events. [2022-12-13 01:43:33,113 INFO L131 PetriNetUnfolder]: For 1420/1426 co-relation queries the response was YES. [2022-12-13 01:43:33,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 372 events. 58/372 cut-off events. For 1420/1426 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2672 event pairs, 1 based on Foata normal form. 4/359 useless extension candidates. Maximal degree in co-relation 1376. Up to 79 conditions per place. [2022-12-13 01:43:33,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 73 transitions, 693 flow [2022-12-13 01:43:33,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-13 01:43:33,117 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:43:33,158 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:33,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 01:43:33,159 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 698 flow [2022-12-13 01:43:33,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:33,159 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:33,159 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:33,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 01:43:33,159 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:33,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:33,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1519079531, now seen corresponding path program 1 times [2022-12-13 01:43:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:33,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726733778] [2022-12-13 01:43:33,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:33,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:33,609 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-13 01:43:33,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:33,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726733778] [2022-12-13 01:43:33,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726733778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:33,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:33,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746760526] [2022-12-13 01:43:33,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:33,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:33,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:33,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:33,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:33,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:43:33,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 698 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:33,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:33,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:43:33,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:34,039 INFO L130 PetriNetUnfolder]: 752/1534 cut-off events. [2022-12-13 01:43:34,039 INFO L131 PetriNetUnfolder]: For 7258/7258 co-relation queries the response was YES. [2022-12-13 01:43:34,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6898 conditions, 1534 events. 752/1534 cut-off events. For 7258/7258 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9114 event pairs, 272 based on Foata normal form. 2/1536 useless extension candidates. Maximal degree in co-relation 6843. Up to 1034 conditions per place. [2022-12-13 01:43:34,046 INFO L137 encePairwiseOnDemand]: 37/48 looper letters, 116 selfloop transitions, 13 changer transitions 27/156 dead transitions. [2022-12-13 01:43:34,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 156 transitions, 1553 flow [2022-12-13 01:43:34,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2022-12-13 01:43:34,047 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2022-12-13 01:43:34,047 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 698 flow. Second operand 9 states and 140 transitions. [2022-12-13 01:43:34,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 156 transitions, 1553 flow [2022-12-13 01:43:34,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 156 transitions, 1499 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-12-13 01:43:34,058 INFO L231 Difference]: Finished difference. Result has 94 places, 75 transitions, 708 flow [2022-12-13 01:43:34,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=708, PETRI_PLACES=94, PETRI_TRANSITIONS=75} [2022-12-13 01:43:34,059 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2022-12-13 01:43:34,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:34,059 INFO L89 Accepts]: Start accepts. Operand has 94 places, 75 transitions, 708 flow [2022-12-13 01:43:34,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:34,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:34,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 75 transitions, 708 flow [2022-12-13 01:43:34,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 75 transitions, 708 flow [2022-12-13 01:43:34,082 INFO L130 PetriNetUnfolder]: 57/369 cut-off events. [2022-12-13 01:43:34,082 INFO L131 PetriNetUnfolder]: For 1301/1305 co-relation queries the response was YES. [2022-12-13 01:43:34,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 369 events. 57/369 cut-off events. For 1301/1305 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2668 event pairs, 5 based on Foata normal form. 3/354 useless extension candidates. Maximal degree in co-relation 1344. Up to 79 conditions per place. [2022-12-13 01:43:34,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 75 transitions, 708 flow [2022-12-13 01:43:34,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 01:43:34,113 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:34,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 01:43:34,113 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 74 transitions, 704 flow [2022-12-13 01:43:34,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:34,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:34,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:34,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 01:43:34,114 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:34,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:34,114 INFO L85 PathProgramCache]: Analyzing trace with hash 616881411, now seen corresponding path program 1 times [2022-12-13 01:43:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:34,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461756352] [2022-12-13 01:43:34,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:34,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:34,448 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-13 01:43:34,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:34,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461756352] [2022-12-13 01:43:34,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461756352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:34,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:34,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044089500] [2022-12-13 01:43:34,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:34,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:34,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:34,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:43:34,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 74 transitions, 704 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:34,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:34,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:43:34,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:34,850 INFO L130 PetriNetUnfolder]: 737/1503 cut-off events. [2022-12-13 01:43:34,850 INFO L131 PetriNetUnfolder]: For 7355/7355 co-relation queries the response was YES. [2022-12-13 01:43:34,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6892 conditions, 1503 events. 737/1503 cut-off events. For 7355/7355 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8812 event pairs, 288 based on Foata normal form. 2/1505 useless extension candidates. Maximal degree in co-relation 6836. Up to 1034 conditions per place. [2022-12-13 01:43:34,857 INFO L137 encePairwiseOnDemand]: 35/48 looper letters, 107 selfloop transitions, 19 changer transitions 25/151 dead transitions. [2022-12-13 01:43:34,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 151 transitions, 1505 flow [2022-12-13 01:43:34,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2022-12-13 01:43:34,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3148148148148148 [2022-12-13 01:43:34,858 INFO L175 Difference]: Start difference. First operand has 91 places, 74 transitions, 704 flow. Second operand 9 states and 136 transitions. [2022-12-13 01:43:34,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 151 transitions, 1505 flow [2022-12-13 01:43:34,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 151 transitions, 1460 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-13 01:43:34,869 INFO L231 Difference]: Finished difference. Result has 97 places, 81 transitions, 790 flow [2022-12-13 01:43:34,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=790, PETRI_PLACES=97, PETRI_TRANSITIONS=81} [2022-12-13 01:43:34,869 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 56 predicate places. [2022-12-13 01:43:34,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:34,869 INFO L89 Accepts]: Start accepts. Operand has 97 places, 81 transitions, 790 flow [2022-12-13 01:43:34,869 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:34,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:34,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 81 transitions, 790 flow [2022-12-13 01:43:34,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 81 transitions, 790 flow [2022-12-13 01:43:34,893 INFO L130 PetriNetUnfolder]: 63/394 cut-off events. [2022-12-13 01:43:34,893 INFO L131 PetriNetUnfolder]: For 1458/1466 co-relation queries the response was YES. [2022-12-13 01:43:34,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 394 events. 63/394 cut-off events. For 1458/1466 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2875 event pairs, 1 based on Foata normal form. 3/382 useless extension candidates. Maximal degree in co-relation 1475. Up to 84 conditions per place. [2022-12-13 01:43:34,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 81 transitions, 790 flow [2022-12-13 01:43:34,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 01:43:34,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] L97-->L106: Formula: (and (= v_~i2~0_265 v_~i~0_866) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|) (= v_~i~0_865 (select (select |v_#memory_int_549| v_~f~0.base_468) (+ v_~f~0.offset_474 (* v_~i2~0_265 4)))) (= (ite (or (< v_~n2~0_554 v_~n1~0_525) (= v_~n1~0_525 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|)) InVars {~n2~0=v_~n2~0_554, ~i~0=v_~i~0_866, ~f~0.base=v_~f~0.base_468, ~n1~0=v_~n1~0_525, #memory_int=|v_#memory_int_549|, ~f~0.offset=v_~f~0.offset_474} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_111|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325|, ~n2~0=v_~n2~0_554, ~i~0=v_~i~0_865, ~f~0.base=v_~f~0.base_468, ~n1~0=v_~n1~0_525, #memory_int=|v_#memory_int_549|, ~i2~0=v_~i2~0_265, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|, ~f~0.offset=v_~f~0.offset_474} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [754] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (= v_~e1~0_188 1) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| 0)) (= v_~n2~0_335 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|) (= v_~n2~0_336 v_~tmp1~0_159) (= (ite (and (<= 0 v_~i~0_539) (< v_~i~0_539 v_~n~0_218)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|)) InVars {~n2~0=v_~n2~0_336, ~i~0=v_~i~0_539, ~n~0=v_~n~0_218} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, ~n2~0=v_~n2~0_335, ~i~0=v_~i~0_539, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|, ~n~0=v_~n~0_218, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, ~tmp1~0=v_~tmp1~0_159, ~e1~0=v_~e1~0_188} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:43:34,988 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] L97-->L106: Formula: (and (= v_~i2~0_265 v_~i~0_866) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|) (= v_~i~0_865 (select (select |v_#memory_int_549| v_~f~0.base_468) (+ v_~f~0.offset_474 (* v_~i2~0_265 4)))) (= (ite (or (< v_~n2~0_554 v_~n1~0_525) (= v_~n1~0_525 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|)) InVars {~n2~0=v_~n2~0_554, ~i~0=v_~i~0_866, ~f~0.base=v_~f~0.base_468, ~n1~0=v_~n1~0_525, #memory_int=|v_#memory_int_549|, ~f~0.offset=v_~f~0.offset_474} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_111|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325|, ~n2~0=v_~n2~0_554, ~i~0=v_~i~0_865, ~f~0.base=v_~f~0.base_468, ~n1~0=v_~n1~0_525, #memory_int=|v_#memory_int_549|, ~i2~0=v_~i2~0_265, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|, ~f~0.offset=v_~f~0.offset_474} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:43:35,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] L97-->L106: Formula: (and (= v_~i2~0_265 v_~i~0_866) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|) (= v_~i~0_865 (select (select |v_#memory_int_549| v_~f~0.base_468) (+ v_~f~0.offset_474 (* v_~i2~0_265 4)))) (= (ite (or (< v_~n2~0_554 v_~n1~0_525) (= v_~n1~0_525 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|)) InVars {~n2~0=v_~n2~0_554, ~i~0=v_~i~0_866, ~f~0.base=v_~f~0.base_468, ~n1~0=v_~n1~0_525, #memory_int=|v_#memory_int_549|, ~f~0.offset=v_~f~0.offset_474} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_111|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325|, ~n2~0=v_~n2~0_554, ~i~0=v_~i~0_865, ~f~0.base=v_~f~0.base_468, ~n1~0=v_~n1~0_525, #memory_int=|v_#memory_int_549|, ~i2~0=v_~i2~0_265, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|, ~f~0.offset=v_~f~0.offset_474} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:43:35,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] L97-->L106: Formula: (and (= v_~i2~0_265 v_~i~0_866) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|) (= v_~i~0_865 (select (select |v_#memory_int_549| v_~f~0.base_468) (+ v_~f~0.offset_474 (* v_~i2~0_265 4)))) (= (ite (or (< v_~n2~0_554 v_~n1~0_525) (= v_~n1~0_525 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|)) InVars {~n2~0=v_~n2~0_554, ~i~0=v_~i~0_866, ~f~0.base=v_~f~0.base_468, ~n1~0=v_~n1~0_525, #memory_int=|v_#memory_int_549|, ~f~0.offset=v_~f~0.offset_474} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_111|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_325|, ~n2~0=v_~n2~0_554, ~i~0=v_~i~0_865, ~f~0.base=v_~f~0.base_468, ~n1~0=v_~n1~0_525, #memory_int=|v_#memory_int_549|, ~i2~0=v_~i2~0_265, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_325|, ~f~0.offset=v_~f~0.offset_474} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [756] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~n2~0_342 v_~tmp1~0_163) (= v_~n2~0_341 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_41| 0) (= v_~n1~0_353 (+ v_~tmp1~0_163 1)) (= (ite (and (<= 0 v_~i~0_541) (< v_~i~0_541 v_~n~0_220)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|) (= v_~e1~0_194 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|)) InVars {~n2~0=v_~n2~0_342, ~i~0=v_~i~0_541, ~n~0=v_~n~0_220} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_41|, ~n2~0=v_~n2~0_341, ~i~0=v_~i~0_541, ~n1~0=v_~n1~0_353, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|, ~n~0=v_~n~0_220, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_41|, ~tmp1~0=v_~tmp1~0_163, ~e1~0=v_~e1~0_194} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:43:35,255 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:35,256 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 387 [2022-12-13 01:43:35,256 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 846 flow [2022-12-13 01:43:35,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:35,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:35,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:35,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 01:43:35,256 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:35,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1551241056, now seen corresponding path program 1 times [2022-12-13 01:43:35,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:35,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528584489] [2022-12-13 01:43:35,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:35,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:35,585 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-13 01:43:35,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:35,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528584489] [2022-12-13 01:43:35,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528584489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:35,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:35,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:35,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705027594] [2022-12-13 01:43:35,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:35,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:35,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:35,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:35,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:35,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 01:43:35,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 846 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:35,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:35,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 01:43:35,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:35,937 INFO L130 PetriNetUnfolder]: 725/1499 cut-off events. [2022-12-13 01:43:35,937 INFO L131 PetriNetUnfolder]: For 7912/7912 co-relation queries the response was YES. [2022-12-13 01:43:35,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7021 conditions, 1499 events. 725/1499 cut-off events. For 7912/7912 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8977 event pairs, 336 based on Foata normal form. 2/1501 useless extension candidates. Maximal degree in co-relation 6964. Up to 1034 conditions per place. [2022-12-13 01:43:35,944 INFO L137 encePairwiseOnDemand]: 38/52 looper letters, 102 selfloop transitions, 15 changer transitions 29/146 dead transitions. [2022-12-13 01:43:35,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 146 transitions, 1593 flow [2022-12-13 01:43:35,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2022-12-13 01:43:35,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3125 [2022-12-13 01:43:35,945 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 846 flow. Second operand 8 states and 130 transitions. [2022-12-13 01:43:35,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 146 transitions, 1593 flow [2022-12-13 01:43:35,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 146 transitions, 1522 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-13 01:43:35,957 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 798 flow [2022-12-13 01:43:35,958 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=798, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2022-12-13 01:43:35,958 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2022-12-13 01:43:35,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:35,958 INFO L89 Accepts]: Start accepts. Operand has 98 places, 78 transitions, 798 flow [2022-12-13 01:43:35,958 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:35,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:35,959 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 78 transitions, 798 flow [2022-12-13 01:43:35,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 78 transitions, 798 flow [2022-12-13 01:43:35,982 INFO L130 PetriNetUnfolder]: 58/378 cut-off events. [2022-12-13 01:43:35,982 INFO L131 PetriNetUnfolder]: For 1604/1610 co-relation queries the response was YES. [2022-12-13 01:43:35,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 378 events. 58/378 cut-off events. For 1604/1610 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2781 event pairs, 9 based on Foata normal form. 3/363 useless extension candidates. Maximal degree in co-relation 1448. Up to 74 conditions per place. [2022-12-13 01:43:35,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 78 transitions, 798 flow [2022-12-13 01:43:35,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-13 01:43:35,989 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:35,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 01:43:35,989 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 78 transitions, 798 flow [2022-12-13 01:43:35,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:35,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:35,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:35,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 01:43:35,990 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash 444250883, now seen corresponding path program 1 times [2022-12-13 01:43:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:35,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422904276] [2022-12-13 01:43:35,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:35,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:36,356 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-13 01:43:36,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:36,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422904276] [2022-12-13 01:43:36,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422904276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:36,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:36,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:36,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428374319] [2022-12-13 01:43:36,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:36,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:36,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:36,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:36,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:36,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:43:36,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 78 transitions, 798 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:36,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:36,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:43:36,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:36,694 INFO L130 PetriNetUnfolder]: 733/1522 cut-off events. [2022-12-13 01:43:36,695 INFO L131 PetriNetUnfolder]: For 7905/7905 co-relation queries the response was YES. [2022-12-13 01:43:36,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7049 conditions, 1522 events. 733/1522 cut-off events. For 7905/7905 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9102 event pairs, 315 based on Foata normal form. 2/1524 useless extension candidates. Maximal degree in co-relation 6992. Up to 1034 conditions per place. [2022-12-13 01:43:36,701 INFO L137 encePairwiseOnDemand]: 35/51 looper letters, 106 selfloop transitions, 19 changer transitions 27/152 dead transitions. [2022-12-13 01:43:36,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 152 transitions, 1606 flow [2022-12-13 01:43:36,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-12-13 01:43:36,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2022-12-13 01:43:36,702 INFO L175 Difference]: Start difference. First operand has 96 places, 78 transitions, 798 flow. Second operand 9 states and 135 transitions. [2022-12-13 01:43:36,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 152 transitions, 1606 flow [2022-12-13 01:43:36,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 152 transitions, 1564 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-13 01:43:36,714 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 865 flow [2022-12-13 01:43:36,714 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=865, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2022-12-13 01:43:36,714 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2022-12-13 01:43:36,714 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:36,715 INFO L89 Accepts]: Start accepts. Operand has 101 places, 82 transitions, 865 flow [2022-12-13 01:43:36,715 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:36,715 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:36,715 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 82 transitions, 865 flow [2022-12-13 01:43:36,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 82 transitions, 865 flow [2022-12-13 01:43:36,740 INFO L130 PetriNetUnfolder]: 62/394 cut-off events. [2022-12-13 01:43:36,740 INFO L131 PetriNetUnfolder]: For 1816/1822 co-relation queries the response was YES. [2022-12-13 01:43:36,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 394 events. 62/394 cut-off events. For 1816/1822 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2916 event pairs, 3 based on Foata normal form. 4/381 useless extension candidates. Maximal degree in co-relation 1561. Up to 81 conditions per place. [2022-12-13 01:43:36,742 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 82 transitions, 865 flow [2022-12-13 01:43:36,742 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 01:43:36,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] L97-->L155-3: Formula: (and (= (store |v_#memory_int_558| |v_ULTIMATE.start_main_~#t3~0#1.base_109| (store (select |v_#memory_int_558| |v_ULTIMATE.start_main_~#t3~0#1.base_109|) |v_ULTIMATE.start_main_~#t3~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre17#1_73|)) |v_#memory_int_557|) (= |v_ULTIMATE.start_main_#t~pre17#1_73| |v_#pthreadsForks_119|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_337| 0)) (= |v_#pthreadsForks_118| (+ |v_#pthreadsForks_119| 1)) (= v_~i2~0_273 v_~i~0_882) (= (ite (or (< v_~n2~0_566 v_~n1~0_533) (= v_~n1~0_533 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_337|) (= (select (select |v_#memory_int_558| v_~f~0.base_476) (+ v_~f~0.offset_482 (* v_~i2~0_273 4))) v_~i~0_881) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_337| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_337|)) InVars {#pthreadsForks=|v_#pthreadsForks_119|, ~n2~0=v_~n2~0_566, ~i~0=v_~i~0_882, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_476, ~n1~0=v_~n1~0_533, #memory_int=|v_#memory_int_558|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_109|, ~f~0.offset=v_~f~0.offset_482} OutVars{~n2~0=v_~n2~0_566, ~i~0=v_~i~0_881, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_476, ~n1~0=v_~n1~0_533, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_109|, ~i2~0=v_~i2~0_273, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_337|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_79|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_73|, ~f~0.offset=v_~f~0.offset_482, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_63|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_119|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_337|, #pthreadsForks=|v_#pthreadsForks_118|, #memory_int=|v_#memory_int_557|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, ~i~0, #memory_int, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [747] L106-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_127| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_35| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127| (ite (and (<= 0 v_~i~0_509) (< v_~i~0_509 v_~n~0_205)) 1 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_35| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_127| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127|) (= v_~n2~0_299 0)) InVars {~i~0=v_~i~0_509, ~n~0=v_~n~0_205} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_127|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_35|, ~n2~0=v_~n2~0_299, ~i~0=v_~i~0_509, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_127|, ~n~0=v_~n~0_205, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_35|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base] [2022-12-13 01:43:36,844 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] L97-->L155-3: Formula: (and (= (store |v_#memory_int_558| |v_ULTIMATE.start_main_~#t3~0#1.base_109| (store (select |v_#memory_int_558| |v_ULTIMATE.start_main_~#t3~0#1.base_109|) |v_ULTIMATE.start_main_~#t3~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre17#1_73|)) |v_#memory_int_557|) (= |v_ULTIMATE.start_main_#t~pre17#1_73| |v_#pthreadsForks_119|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_337| 0)) (= |v_#pthreadsForks_118| (+ |v_#pthreadsForks_119| 1)) (= v_~i2~0_273 v_~i~0_882) (= (ite (or (< v_~n2~0_566 v_~n1~0_533) (= v_~n1~0_533 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_337|) (= (select (select |v_#memory_int_558| v_~f~0.base_476) (+ v_~f~0.offset_482 (* v_~i2~0_273 4))) v_~i~0_881) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_337| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_337|)) InVars {#pthreadsForks=|v_#pthreadsForks_119|, ~n2~0=v_~n2~0_566, ~i~0=v_~i~0_882, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_476, ~n1~0=v_~n1~0_533, #memory_int=|v_#memory_int_558|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_109|, ~f~0.offset=v_~f~0.offset_482} OutVars{~n2~0=v_~n2~0_566, ~i~0=v_~i~0_881, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_476, ~n1~0=v_~n1~0_533, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_109|, ~i2~0=v_~i2~0_273, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_337|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_79|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_73|, ~f~0.offset=v_~f~0.offset_482, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_63|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_119|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_337|, #pthreadsForks=|v_#pthreadsForks_118|, #memory_int=|v_#memory_int_557|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, ~i~0, #memory_int, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [756] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~n2~0_342 v_~tmp1~0_163) (= v_~n2~0_341 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_41| 0) (= v_~n1~0_353 (+ v_~tmp1~0_163 1)) (= (ite (and (<= 0 v_~i~0_541) (< v_~i~0_541 v_~n~0_220)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|) (= v_~e1~0_194 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|)) InVars {~n2~0=v_~n2~0_342, ~i~0=v_~i~0_541, ~n~0=v_~n~0_220} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_41|, ~n2~0=v_~n2~0_341, ~i~0=v_~i~0_541, ~n1~0=v_~n1~0_353, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|, ~n~0=v_~n~0_220, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_41|, ~tmp1~0=v_~tmp1~0_163, ~e1~0=v_~e1~0_194} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:43:36,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] L97-->L155-3: Formula: (and (= (store |v_#memory_int_558| |v_ULTIMATE.start_main_~#t3~0#1.base_109| (store (select |v_#memory_int_558| |v_ULTIMATE.start_main_~#t3~0#1.base_109|) |v_ULTIMATE.start_main_~#t3~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre17#1_73|)) |v_#memory_int_557|) (= |v_ULTIMATE.start_main_#t~pre17#1_73| |v_#pthreadsForks_119|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_337| 0)) (= |v_#pthreadsForks_118| (+ |v_#pthreadsForks_119| 1)) (= v_~i2~0_273 v_~i~0_882) (= (ite (or (< v_~n2~0_566 v_~n1~0_533) (= v_~n1~0_533 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_337|) (= (select (select |v_#memory_int_558| v_~f~0.base_476) (+ v_~f~0.offset_482 (* v_~i2~0_273 4))) v_~i~0_881) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_337| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_337|)) InVars {#pthreadsForks=|v_#pthreadsForks_119|, ~n2~0=v_~n2~0_566, ~i~0=v_~i~0_882, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_476, ~n1~0=v_~n1~0_533, #memory_int=|v_#memory_int_558|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_109|, ~f~0.offset=v_~f~0.offset_482} OutVars{~n2~0=v_~n2~0_566, ~i~0=v_~i~0_881, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_476, ~n1~0=v_~n1~0_533, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_109|, ~i2~0=v_~i2~0_273, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_337|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_79|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_73|, ~f~0.offset=v_~f~0.offset_482, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_63|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_119|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_337|, #pthreadsForks=|v_#pthreadsForks_118|, #memory_int=|v_#memory_int_557|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, ~i~0, #memory_int, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [754] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (= v_~e1~0_188 1) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| 0)) (= v_~n2~0_335 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|) (= v_~n2~0_336 v_~tmp1~0_159) (= (ite (and (<= 0 v_~i~0_539) (< v_~i~0_539 v_~n~0_218)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|)) InVars {~n2~0=v_~n2~0_336, ~i~0=v_~i~0_539, ~n~0=v_~n~0_218} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, ~n2~0=v_~n2~0_335, ~i~0=v_~i~0_539, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|, ~n~0=v_~n~0_218, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, ~tmp1~0=v_~tmp1~0_159, ~e1~0=v_~e1~0_188} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:43:37,058 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:37,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 345 [2022-12-13 01:43:37,059 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 919 flow [2022-12-13 01:43:37,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:37,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:37,059 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:37,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 01:43:37,060 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:37,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:37,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1456968802, now seen corresponding path program 2 times [2022-12-13 01:43:37,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:37,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094536588] [2022-12-13 01:43:37,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:37,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:37,494 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-13 01:43:37,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:37,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094536588] [2022-12-13 01:43:37,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094536588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:37,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:37,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:43:37,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071309686] [2022-12-13 01:43:37,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:37,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:43:37,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:37,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:43:37,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:43:37,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:43:37,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 919 flow. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:37,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:37,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:43:37,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:37,928 INFO L130 PetriNetUnfolder]: 705/1482 cut-off events. [2022-12-13 01:43:37,928 INFO L131 PetriNetUnfolder]: For 8653/8653 co-relation queries the response was YES. [2022-12-13 01:43:37,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7087 conditions, 1482 events. 705/1482 cut-off events. For 8653/8653 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9011 event pairs, 288 based on Foata normal form. 2/1484 useless extension candidates. Maximal degree in co-relation 7028. Up to 1034 conditions per place. [2022-12-13 01:43:37,936 INFO L137 encePairwiseOnDemand]: 39/54 looper letters, 102 selfloop transitions, 13 changer transitions 36/151 dead transitions. [2022-12-13 01:43:37,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 151 transitions, 1677 flow [2022-12-13 01:43:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2022-12-13 01:43:37,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3101851851851852 [2022-12-13 01:43:37,937 INFO L175 Difference]: Start difference. First operand has 99 places, 82 transitions, 919 flow. Second operand 8 states and 134 transitions. [2022-12-13 01:43:37,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 151 transitions, 1677 flow [2022-12-13 01:43:37,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 151 transitions, 1632 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 01:43:37,949 INFO L231 Difference]: Finished difference. Result has 104 places, 76 transitions, 808 flow [2022-12-13 01:43:37,949 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=808, PETRI_PLACES=104, PETRI_TRANSITIONS=76} [2022-12-13 01:43:37,949 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places. [2022-12-13 01:43:37,949 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:37,949 INFO L89 Accepts]: Start accepts. Operand has 104 places, 76 transitions, 808 flow [2022-12-13 01:43:37,949 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:37,950 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:37,950 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 76 transitions, 808 flow [2022-12-13 01:43:37,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 76 transitions, 808 flow [2022-12-13 01:43:37,972 INFO L130 PetriNetUnfolder]: 55/351 cut-off events. [2022-12-13 01:43:37,972 INFO L131 PetriNetUnfolder]: For 1790/1795 co-relation queries the response was YES. [2022-12-13 01:43:37,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 351 events. 55/351 cut-off events. For 1790/1795 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2515 event pairs, 7 based on Foata normal form. 3/337 useless extension candidates. Maximal degree in co-relation 1423. Up to 74 conditions per place. [2022-12-13 01:43:37,974 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 76 transitions, 808 flow [2022-12-13 01:43:37,974 INFO L226 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-13 01:43:37,983 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:37,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 01:43:37,983 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 76 transitions, 808 flow [2022-12-13 01:43:37,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:37,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:37,984 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:37,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 01:43:37,984 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:37,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1801298890, now seen corresponding path program 3 times [2022-12-13 01:43:37,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:37,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058014906] [2022-12-13 01:43:37,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:37,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:38,363 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-13 01:43:38,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:38,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058014906] [2022-12-13 01:43:38,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058014906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:38,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:38,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:38,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586411737] [2022-12-13 01:43:38,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:38,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:38,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:38,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:38,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:38,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:43:38,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 76 transitions, 808 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:38,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:38,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:43:38,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:38,670 INFO L130 PetriNetUnfolder]: 647/1358 cut-off events. [2022-12-13 01:43:38,671 INFO L131 PetriNetUnfolder]: For 8405/8405 co-relation queries the response was YES. [2022-12-13 01:43:38,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6581 conditions, 1358 events. 647/1358 cut-off events. For 8405/8405 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7897 event pairs, 278 based on Foata normal form. 2/1360 useless extension candidates. Maximal degree in co-relation 6521. Up to 1034 conditions per place. [2022-12-13 01:43:38,677 INFO L137 encePairwiseOnDemand]: 39/50 looper letters, 95 selfloop transitions, 9 changer transitions 33/137 dead transitions. [2022-12-13 01:43:38,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 1496 flow [2022-12-13 01:43:38,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-13 01:43:38,678 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3025 [2022-12-13 01:43:38,678 INFO L175 Difference]: Start difference. First operand has 100 places, 76 transitions, 808 flow. Second operand 8 states and 121 transitions. [2022-12-13 01:43:38,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 1496 flow [2022-12-13 01:43:38,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 137 transitions, 1441 flow, removed 10 selfloop flow, removed 9 redundant places. [2022-12-13 01:43:38,691 INFO L231 Difference]: Finished difference. Result has 100 places, 71 transitions, 682 flow [2022-12-13 01:43:38,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=682, PETRI_PLACES=100, PETRI_TRANSITIONS=71} [2022-12-13 01:43:38,692 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2022-12-13 01:43:38,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:38,692 INFO L89 Accepts]: Start accepts. Operand has 100 places, 71 transitions, 682 flow [2022-12-13 01:43:38,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:38,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:38,692 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 71 transitions, 682 flow [2022-12-13 01:43:38,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 71 transitions, 682 flow [2022-12-13 01:43:38,713 INFO L130 PetriNetUnfolder]: 51/330 cut-off events. [2022-12-13 01:43:38,713 INFO L131 PetriNetUnfolder]: For 1323/1327 co-relation queries the response was YES. [2022-12-13 01:43:38,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 330 events. 51/330 cut-off events. For 1323/1327 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2284 event pairs, 1 based on Foata normal form. 3/319 useless extension candidates. Maximal degree in co-relation 1254. Up to 65 conditions per place. [2022-12-13 01:43:38,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 71 transitions, 682 flow [2022-12-13 01:43:38,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-13 01:43:38,716 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:38,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 01:43:38,716 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 71 transitions, 682 flow [2022-12-13 01:43:38,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:38,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:38,717 INFO L214 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] [2022-12-13 01:43:38,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 01:43:38,717 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1212540089, now seen corresponding path program 1 times [2022-12-13 01:43:38,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:38,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074197571] [2022-12-13 01:43:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:43:39,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:39,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074197571] [2022-12-13 01:43:39,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074197571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:39,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:39,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:43:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19067158] [2022-12-13 01:43:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:39,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:43:39,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:39,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:43:39,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:43:39,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:43:39,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 71 transitions, 682 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:39,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:39,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:43:39,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:39,506 INFO L130 PetriNetUnfolder]: 607/1249 cut-off events. [2022-12-13 01:43:39,506 INFO L131 PetriNetUnfolder]: For 6704/6704 co-relation queries the response was YES. [2022-12-13 01:43:39,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5881 conditions, 1249 events. 607/1249 cut-off events. For 6704/6704 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7008 event pairs, 272 based on Foata normal form. 2/1251 useless extension candidates. Maximal degree in co-relation 5829. Up to 1034 conditions per place. [2022-12-13 01:43:39,512 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 69 selfloop transitions, 7 changer transitions 40/116 dead transitions. [2022-12-13 01:43:39,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 116 transitions, 1223 flow [2022-12-13 01:43:39,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:43:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:43:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2022-12-13 01:43:39,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2170212765957447 [2022-12-13 01:43:39,513 INFO L175 Difference]: Start difference. First operand has 94 places, 71 transitions, 682 flow. Second operand 10 states and 102 transitions. [2022-12-13 01:43:39,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 116 transitions, 1223 flow [2022-12-13 01:43:39,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 116 transitions, 1183 flow, removed 8 selfloop flow, removed 10 redundant places. [2022-12-13 01:43:39,524 INFO L231 Difference]: Finished difference. Result has 97 places, 68 transitions, 643 flow [2022-12-13 01:43:39,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=643, PETRI_PLACES=97, PETRI_TRANSITIONS=68} [2022-12-13 01:43:39,525 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 56 predicate places. [2022-12-13 01:43:39,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:39,525 INFO L89 Accepts]: Start accepts. Operand has 97 places, 68 transitions, 643 flow [2022-12-13 01:43:39,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:39,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:39,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 68 transitions, 643 flow [2022-12-13 01:43:39,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 68 transitions, 643 flow [2022-12-13 01:43:39,544 INFO L130 PetriNetUnfolder]: 50/285 cut-off events. [2022-12-13 01:43:39,544 INFO L131 PetriNetUnfolder]: For 1152/1157 co-relation queries the response was YES. [2022-12-13 01:43:39,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 285 events. 50/285 cut-off events. For 1152/1157 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1928 event pairs, 7 based on Foata normal form. 3/275 useless extension candidates. Maximal degree in co-relation 1079. Up to 61 conditions per place. [2022-12-13 01:43:39,546 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 68 transitions, 643 flow [2022-12-13 01:43:39,546 INFO L226 LiptonReduction]: Number of co-enabled transitions 406 [2022-12-13 01:43:41,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:41,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2160 [2022-12-13 01:43:41,685 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 67 transitions, 637 flow [2022-12-13 01:43:41,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:41,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:41,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:41,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 01:43:41,686 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:41,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash 285020029, now seen corresponding path program 1 times [2022-12-13 01:43:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:41,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348020436] [2022-12-13 01:43:41,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:41,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:41,879 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-13 01:43:41,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:41,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348020436] [2022-12-13 01:43:41,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348020436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:41,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:41,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546241603] [2022-12-13 01:43:41,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:41,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:41,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:41,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:41,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:41,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:43:41,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 67 transitions, 637 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:41,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:41,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:43:41,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:42,183 INFO L130 PetriNetUnfolder]: 643/1269 cut-off events. [2022-12-13 01:43:42,184 INFO L131 PetriNetUnfolder]: For 7028/7028 co-relation queries the response was YES. [2022-12-13 01:43:42,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 1269 events. 643/1269 cut-off events. For 7028/7028 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7090 event pairs, 172 based on Foata normal form. 2/1271 useless extension candidates. Maximal degree in co-relation 5935. Up to 809 conditions per place. [2022-12-13 01:43:42,189 INFO L137 encePairwiseOnDemand]: 38/47 looper letters, 84 selfloop transitions, 10 changer transitions 14/108 dead transitions. [2022-12-13 01:43:42,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 108 transitions, 1151 flow [2022-12-13 01:43:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:43:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:43:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-13 01:43:42,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2887537993920973 [2022-12-13 01:43:42,190 INFO L175 Difference]: Start difference. First operand has 87 places, 67 transitions, 637 flow. Second operand 7 states and 95 transitions. [2022-12-13 01:43:42,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 108 transitions, 1151 flow [2022-12-13 01:43:42,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 108 transitions, 1092 flow, removed 18 selfloop flow, removed 11 redundant places. [2022-12-13 01:43:42,197 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 645 flow [2022-12-13 01:43:42,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=645, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2022-12-13 01:43:42,197 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2022-12-13 01:43:42,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:42,197 INFO L89 Accepts]: Start accepts. Operand has 85 places, 69 transitions, 645 flow [2022-12-13 01:43:42,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:42,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:42,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 69 transitions, 645 flow [2022-12-13 01:43:42,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 69 transitions, 645 flow [2022-12-13 01:43:42,216 INFO L130 PetriNetUnfolder]: 55/298 cut-off events. [2022-12-13 01:43:42,216 INFO L131 PetriNetUnfolder]: For 1233/1251 co-relation queries the response was YES. [2022-12-13 01:43:42,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 298 events. 55/298 cut-off events. For 1233/1251 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2055 event pairs, 6 based on Foata normal form. 3/283 useless extension candidates. Maximal degree in co-relation 1115. Up to 67 conditions per place. [2022-12-13 01:43:42,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 69 transitions, 645 flow [2022-12-13 01:43:42,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-13 01:43:42,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:43:42,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:43:42,526 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:43:42,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:43:42,835 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:43:43,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:43:43,119 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:43:43,233 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:43,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1037 [2022-12-13 01:43:43,234 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 745 flow [2022-12-13 01:43:43,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:43,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:43,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:43,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 01:43:43,234 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:43,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1223284099, now seen corresponding path program 2 times [2022-12-13 01:43:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:43,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721360881] [2022-12-13 01:43:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:43,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:43,698 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-13 01:43:43,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:43,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721360881] [2022-12-13 01:43:43,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721360881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:43,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:43,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:43,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479309523] [2022-12-13 01:43:43,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:43,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:43,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:43,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:43,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:43:43,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 745 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:43,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:43,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:43:43,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:44,153 INFO L130 PetriNetUnfolder]: 1259/2481 cut-off events. [2022-12-13 01:43:44,153 INFO L131 PetriNetUnfolder]: For 13856/13856 co-relation queries the response was YES. [2022-12-13 01:43:44,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11723 conditions, 2481 events. 1259/2481 cut-off events. For 13856/13856 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16024 event pairs, 446 based on Foata normal form. 2/2483 useless extension candidates. Maximal degree in co-relation 11655. Up to 1141 conditions per place. [2022-12-13 01:43:44,164 INFO L137 encePairwiseOnDemand]: 45/54 looper letters, 153 selfloop transitions, 17 changer transitions 14/184 dead transitions. [2022-12-13 01:43:44,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 184 transitions, 1945 flow [2022-12-13 01:43:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2022-12-13 01:43:44,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2022-12-13 01:43:44,165 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 745 flow. Second operand 8 states and 152 transitions. [2022-12-13 01:43:44,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 184 transitions, 1945 flow [2022-12-13 01:43:44,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 184 transitions, 1907 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 01:43:44,182 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 793 flow [2022-12-13 01:43:44,182 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=793, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2022-12-13 01:43:44,182 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places. [2022-12-13 01:43:44,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:44,183 INFO L89 Accepts]: Start accepts. Operand has 90 places, 80 transitions, 793 flow [2022-12-13 01:43:44,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:44,183 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:44,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 80 transitions, 793 flow [2022-12-13 01:43:44,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 80 transitions, 793 flow [2022-12-13 01:43:44,228 INFO L130 PetriNetUnfolder]: 107/593 cut-off events. [2022-12-13 01:43:44,228 INFO L131 PetriNetUnfolder]: For 2628/2660 co-relation queries the response was YES. [2022-12-13 01:43:44,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 593 events. 107/593 cut-off events. For 2628/2660 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5084 event pairs, 14 based on Foata normal form. 6/563 useless extension candidates. Maximal degree in co-relation 2276. Up to 105 conditions per place. [2022-12-13 01:43:44,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 80 transitions, 793 flow [2022-12-13 01:43:44,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 510 [2022-12-13 01:43:44,236 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:44,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 01:43:44,236 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 80 transitions, 793 flow [2022-12-13 01:43:44,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:44,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:44,236 INFO L214 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] [2022-12-13 01:43:44,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 01:43:44,237 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:44,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:44,237 INFO L85 PathProgramCache]: Analyzing trace with hash 297737526, now seen corresponding path program 1 times [2022-12-13 01:43:44,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:44,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389247535] [2022-12-13 01:43:44,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:44,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:43:44,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:44,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389247535] [2022-12-13 01:43:44,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389247535] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:43:44,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123522497] [2022-12-13 01:43:44,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:44,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:44,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:43:44,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:43:44,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 01:43:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:45,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 01:43:45,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:43:45,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:43:45,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-12-13 01:43:45,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 01:43:45,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:43:45,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 01:43:45,284 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:43:45,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:43:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:43:45,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:43:45,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123522497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:45,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:43:45,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2022-12-13 01:43:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860108359] [2022-12-13 01:43:45,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:45,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:45,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:45,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:45,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-12-13 01:43:45,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:43:45,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 80 transitions, 793 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:45,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:45,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:43:45,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:45,727 INFO L130 PetriNetUnfolder]: 1251/2473 cut-off events. [2022-12-13 01:43:45,727 INFO L131 PetriNetUnfolder]: For 14890/14890 co-relation queries the response was YES. [2022-12-13 01:43:45,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11922 conditions, 2473 events. 1251/2473 cut-off events. For 14890/14890 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15912 event pairs, 354 based on Foata normal form. 2/2475 useless extension candidates. Maximal degree in co-relation 11852. Up to 1397 conditions per place. [2022-12-13 01:43:45,739 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 84 selfloop transitions, 21 changer transitions 14/119 dead transitions. [2022-12-13 01:43:45,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 119 transitions, 1290 flow [2022-12-13 01:43:45,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:43:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:43:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2022-12-13 01:43:45,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2796352583586626 [2022-12-13 01:43:45,740 INFO L175 Difference]: Start difference. First operand has 88 places, 80 transitions, 793 flow. Second operand 7 states and 92 transitions. [2022-12-13 01:43:45,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 119 transitions, 1290 flow [2022-12-13 01:43:45,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 119 transitions, 1282 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:43:45,760 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 821 flow [2022-12-13 01:43:45,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=821, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2022-12-13 01:43:45,760 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2022-12-13 01:43:45,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:45,760 INFO L89 Accepts]: Start accepts. Operand has 95 places, 80 transitions, 821 flow [2022-12-13 01:43:45,761 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:45,761 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:45,761 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 80 transitions, 821 flow [2022-12-13 01:43:45,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 80 transitions, 821 flow [2022-12-13 01:43:45,796 INFO L130 PetriNetUnfolder]: 105/591 cut-off events. [2022-12-13 01:43:45,796 INFO L131 PetriNetUnfolder]: For 3010/3038 co-relation queries the response was YES. [2022-12-13 01:43:45,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2453 conditions, 591 events. 105/591 cut-off events. For 3010/3038 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5009 event pairs, 9 based on Foata normal form. 6/561 useless extension candidates. Maximal degree in co-relation 2396. Up to 103 conditions per place. [2022-12-13 01:43:45,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 80 transitions, 821 flow [2022-12-13 01:43:45,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 510 [2022-12-13 01:43:45,801 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:45,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 01:43:45,802 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 821 flow [2022-12-13 01:43:45,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:45,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:45,802 INFO L214 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] [2022-12-13 01:43:45,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 01:43:46,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:43:46,007 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1195523040, now seen corresponding path program 1 times [2022-12-13 01:43:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:46,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253409912] [2022-12-13 01:43:46,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:46,517 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-13 01:43:46,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:46,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253409912] [2022-12-13 01:43:46,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253409912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:46,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:46,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:46,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125001064] [2022-12-13 01:43:46,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:46,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:46,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:46,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:46,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:43:46,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 821 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:46,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:46,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:43:46,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:47,026 INFO L130 PetriNetUnfolder]: 1233/2422 cut-off events. [2022-12-13 01:43:47,026 INFO L131 PetriNetUnfolder]: For 16753/16753 co-relation queries the response was YES. [2022-12-13 01:43:47,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12278 conditions, 2422 events. 1233/2422 cut-off events. For 16753/16753 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15557 event pairs, 431 based on Foata normal form. 3/2425 useless extension candidates. Maximal degree in co-relation 12215. Up to 1133 conditions per place. [2022-12-13 01:43:47,035 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 145 selfloop transitions, 20 changer transitions 24/189 dead transitions. [2022-12-13 01:43:47,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 189 transitions, 1983 flow [2022-12-13 01:43:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2022-12-13 01:43:47,036 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39753086419753086 [2022-12-13 01:43:47,036 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 821 flow. Second operand 9 states and 161 transitions. [2022-12-13 01:43:47,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 189 transitions, 1983 flow [2022-12-13 01:43:47,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 189 transitions, 1929 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 01:43:47,051 INFO L231 Difference]: Finished difference. Result has 100 places, 87 transitions, 919 flow [2022-12-13 01:43:47,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=919, PETRI_PLACES=100, PETRI_TRANSITIONS=87} [2022-12-13 01:43:47,052 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2022-12-13 01:43:47,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:47,052 INFO L89 Accepts]: Start accepts. Operand has 100 places, 87 transitions, 919 flow [2022-12-13 01:43:47,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:47,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:47,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 87 transitions, 919 flow [2022-12-13 01:43:47,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 87 transitions, 919 flow [2022-12-13 01:43:47,088 INFO L130 PetriNetUnfolder]: 105/582 cut-off events. [2022-12-13 01:43:47,088 INFO L131 PetriNetUnfolder]: For 3176/3214 co-relation queries the response was YES. [2022-12-13 01:43:47,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 582 events. 105/582 cut-off events. For 3176/3214 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4974 event pairs, 16 based on Foata normal form. 11/557 useless extension candidates. Maximal degree in co-relation 2384. Up to 103 conditions per place. [2022-12-13 01:43:47,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 87 transitions, 919 flow [2022-12-13 01:43:47,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-13 01:43:47,095 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:47,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 01:43:47,095 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 87 transitions, 919 flow [2022-12-13 01:43:47,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:47,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:47,095 INFO L214 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] [2022-12-13 01:43:47,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 01:43:47,096 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:47,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1983645694, now seen corresponding path program 2 times [2022-12-13 01:43:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:47,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551892696] [2022-12-13 01:43:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:48,427 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-13 01:43:48,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:48,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551892696] [2022-12-13 01:43:48,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551892696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:48,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:48,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:48,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694328816] [2022-12-13 01:43:48,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:48,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:48,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:48,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:48,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:48,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:43:48,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 87 transitions, 919 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:48,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:48,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:43:48,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:49,000 INFO L130 PetriNetUnfolder]: 1257/2530 cut-off events. [2022-12-13 01:43:49,000 INFO L131 PetriNetUnfolder]: For 17309/17309 co-relation queries the response was YES. [2022-12-13 01:43:49,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12559 conditions, 2530 events. 1257/2530 cut-off events. For 17309/17309 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 16795 event pairs, 404 based on Foata normal form. 3/2533 useless extension candidates. Maximal degree in co-relation 12485. Up to 1133 conditions per place. [2022-12-13 01:43:49,011 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 169 selfloop transitions, 24 changer transitions 11/204 dead transitions. [2022-12-13 01:43:49,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 204 transitions, 2154 flow [2022-12-13 01:43:49,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:43:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:43:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2022-12-13 01:43:49,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2022-12-13 01:43:49,012 INFO L175 Difference]: Start difference. First operand has 99 places, 87 transitions, 919 flow. Second operand 10 states and 174 transitions. [2022-12-13 01:43:49,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 204 transitions, 2154 flow [2022-12-13 01:43:49,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 204 transitions, 2131 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 01:43:49,030 INFO L231 Difference]: Finished difference. Result has 108 places, 91 transitions, 1028 flow [2022-12-13 01:43:49,030 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1028, PETRI_PLACES=108, PETRI_TRANSITIONS=91} [2022-12-13 01:43:49,030 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:43:49,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:49,030 INFO L89 Accepts]: Start accepts. Operand has 108 places, 91 transitions, 1028 flow [2022-12-13 01:43:49,031 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:49,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:49,031 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 91 transitions, 1028 flow [2022-12-13 01:43:49,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 91 transitions, 1028 flow [2022-12-13 01:43:49,069 INFO L130 PetriNetUnfolder]: 100/611 cut-off events. [2022-12-13 01:43:49,069 INFO L131 PetriNetUnfolder]: For 3581/3619 co-relation queries the response was YES. [2022-12-13 01:43:49,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2605 conditions, 611 events. 100/611 cut-off events. For 3581/3619 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5301 event pairs, 7 based on Foata normal form. 12/588 useless extension candidates. Maximal degree in co-relation 2543. Up to 107 conditions per place. [2022-12-13 01:43:49,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 91 transitions, 1028 flow [2022-12-13 01:43:49,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 598 [2022-12-13 01:43:49,078 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:49,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 01:43:49,078 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 1028 flow [2022-12-13 01:43:49,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:49,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:49,078 INFO L214 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] [2022-12-13 01:43:49,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 01:43:49,079 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash -574158808, now seen corresponding path program 3 times [2022-12-13 01:43:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:49,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909966918] [2022-12-13 01:43:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:49,575 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-13 01:43:49,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:49,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909966918] [2022-12-13 01:43:49,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909966918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:49,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:49,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:43:49,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672325790] [2022-12-13 01:43:49,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:49,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:43:49,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:49,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:43:49,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:43:49,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:43:49,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 1028 flow. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:49,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:49,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:43:49,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:50,185 INFO L130 PetriNetUnfolder]: 1262/2544 cut-off events. [2022-12-13 01:43:50,185 INFO L131 PetriNetUnfolder]: For 19783/19783 co-relation queries the response was YES. [2022-12-13 01:43:50,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13142 conditions, 2544 events. 1262/2544 cut-off events. For 19783/19783 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17000 event pairs, 419 based on Foata normal form. 6/2550 useless extension candidates. Maximal degree in co-relation 13074. Up to 1133 conditions per place. [2022-12-13 01:43:50,199 INFO L137 encePairwiseOnDemand]: 31/45 looper letters, 146 selfloop transitions, 19 changer transitions 36/201 dead transitions. [2022-12-13 01:43:50,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 201 transitions, 2221 flow [2022-12-13 01:43:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:43:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:43:50,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2022-12-13 01:43:50,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2022-12-13 01:43:50,201 INFO L175 Difference]: Start difference. First operand has 107 places, 91 transitions, 1028 flow. Second operand 10 states and 170 transitions. [2022-12-13 01:43:50,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 201 transitions, 2221 flow [2022-12-13 01:43:50,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 201 transitions, 2175 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-13 01:43:50,226 INFO L231 Difference]: Finished difference. Result has 113 places, 85 transitions, 931 flow [2022-12-13 01:43:50,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=931, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2022-12-13 01:43:50,227 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2022-12-13 01:43:50,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:50,227 INFO L89 Accepts]: Start accepts. Operand has 113 places, 85 transitions, 931 flow [2022-12-13 01:43:50,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:50,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:50,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 85 transitions, 931 flow [2022-12-13 01:43:50,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 85 transitions, 931 flow [2022-12-13 01:43:50,262 INFO L130 PetriNetUnfolder]: 88/536 cut-off events. [2022-12-13 01:43:50,262 INFO L131 PetriNetUnfolder]: For 3365/3417 co-relation queries the response was YES. [2022-12-13 01:43:50,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 536 events. 88/536 cut-off events. For 3365/3417 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4437 event pairs, 3 based on Foata normal form. 10/514 useless extension candidates. Maximal degree in co-relation 2229. Up to 103 conditions per place. [2022-12-13 01:43:50,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 85 transitions, 931 flow [2022-12-13 01:43:50,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-13 01:43:50,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (not (= (ite (= (mod v_~e2~0_229 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (or (<= v_~n1~0_313 v_~n2~0_285) (= v_~n2~0_285 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= v_~i~0_491 (select (select |v_#memory_int_367| v_~f~0.base_290) (+ v_~f~0.offset_297 (* v_~i1~0_227 4)))) (= v_~i1~0_227 v_~i~0_492)) InVars {~n2~0=v_~n2~0_285, ~i~0=v_~i~0_492, ~f~0.base=v_~f~0.base_290, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229} OutVars{~n2~0=v_~n2~0_285, ~i~0=v_~i~0_491, ~f~0.base=v_~f~0.base_290, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~i1~0=v_~i1~0_227, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_144|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 01:43:50,409 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:43:50,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-13 01:43:50,410 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 85 transitions, 963 flow [2022-12-13 01:43:50,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:43:50,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:50,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:50,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 01:43:50,410 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1226594986, now seen corresponding path program 1 times [2022-12-13 01:43:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:50,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151756857] [2022-12-13 01:43:50,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:50,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:50,909 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-13 01:43:50,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:50,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151756857] [2022-12-13 01:43:50,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151756857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:50,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:50,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:50,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339166801] [2022-12-13 01:43:50,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:50,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:50,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:50,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:50,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:50,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:43:50,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 85 transitions, 963 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:50,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:50,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:43:50,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:51,390 INFO L130 PetriNetUnfolder]: 1101/2226 cut-off events. [2022-12-13 01:43:51,390 INFO L131 PetriNetUnfolder]: For 19528/19528 co-relation queries the response was YES. [2022-12-13 01:43:51,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11627 conditions, 2226 events. 1101/2226 cut-off events. For 19528/19528 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14430 event pairs, 443 based on Foata normal form. 2/2228 useless extension candidates. Maximal degree in co-relation 11576. Up to 1133 conditions per place. [2022-12-13 01:43:51,401 INFO L137 encePairwiseOnDemand]: 34/47 looper letters, 136 selfloop transitions, 15 changer transitions 36/187 dead transitions. [2022-12-13 01:43:51,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 187 transitions, 2099 flow [2022-12-13 01:43:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:43:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:43:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2022-12-13 01:43:51,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3664302600472813 [2022-12-13 01:43:51,409 INFO L175 Difference]: Start difference. First operand has 105 places, 85 transitions, 963 flow. Second operand 9 states and 155 transitions. [2022-12-13 01:43:51,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 187 transitions, 2099 flow [2022-12-13 01:43:51,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 187 transitions, 2000 flow, removed 26 selfloop flow, removed 11 redundant places. [2022-12-13 01:43:51,432 INFO L231 Difference]: Finished difference. Result has 106 places, 85 transitions, 919 flow [2022-12-13 01:43:51,432 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=919, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2022-12-13 01:43:51,432 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 01:43:51,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:51,432 INFO L89 Accepts]: Start accepts. Operand has 106 places, 85 transitions, 919 flow [2022-12-13 01:43:51,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:51,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:51,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 85 transitions, 919 flow [2022-12-13 01:43:51,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 85 transitions, 919 flow [2022-12-13 01:43:51,467 INFO L130 PetriNetUnfolder]: 84/543 cut-off events. [2022-12-13 01:43:51,467 INFO L131 PetriNetUnfolder]: For 3594/3630 co-relation queries the response was YES. [2022-12-13 01:43:51,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 543 events. 84/543 cut-off events. For 3594/3630 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4583 event pairs, 12 based on Foata normal form. 8/520 useless extension candidates. Maximal degree in co-relation 2220. Up to 112 conditions per place. [2022-12-13 01:43:51,471 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 85 transitions, 919 flow [2022-12-13 01:43:51,471 INFO L226 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-13 01:43:51,508 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:51,509 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-13 01:43:51,509 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 919 flow [2022-12-13 01:43:51,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:51,509 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:51,509 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:51,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 01:43:51,509 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:51,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash 873736606, now seen corresponding path program 2 times [2022-12-13 01:43:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:51,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756614448] [2022-12-13 01:43:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:52,023 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-13 01:43:52,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:52,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756614448] [2022-12-13 01:43:52,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756614448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:52,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:52,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:52,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924089739] [2022-12-13 01:43:52,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:52,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:52,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:52,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:52,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:52,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:43:52,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 919 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:52,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:52,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:43:52,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:52,636 INFO L130 PetriNetUnfolder]: 1163/2360 cut-off events. [2022-12-13 01:43:52,636 INFO L131 PetriNetUnfolder]: For 19877/19877 co-relation queries the response was YES. [2022-12-13 01:43:52,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12078 conditions, 2360 events. 1163/2360 cut-off events. For 19877/19877 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15525 event pairs, 438 based on Foata normal form. 2/2362 useless extension candidates. Maximal degree in co-relation 12004. Up to 1133 conditions per place. [2022-12-13 01:43:52,646 INFO L137 encePairwiseOnDemand]: 34/47 looper letters, 169 selfloop transitions, 21 changer transitions 12/202 dead transitions. [2022-12-13 01:43:52,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 202 transitions, 2198 flow [2022-12-13 01:43:52,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:43:52,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:43:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2022-12-13 01:43:52,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3617021276595745 [2022-12-13 01:43:52,647 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 919 flow. Second operand 10 states and 170 transitions. [2022-12-13 01:43:52,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 202 transitions, 2198 flow [2022-12-13 01:43:52,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 202 transitions, 2136 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-12-13 01:43:52,670 INFO L231 Difference]: Finished difference. Result has 110 places, 92 transitions, 1058 flow [2022-12-13 01:43:52,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1058, PETRI_PLACES=110, PETRI_TRANSITIONS=92} [2022-12-13 01:43:52,670 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2022-12-13 01:43:52,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:52,670 INFO L89 Accepts]: Start accepts. Operand has 110 places, 92 transitions, 1058 flow [2022-12-13 01:43:52,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:52,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:52,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 92 transitions, 1058 flow [2022-12-13 01:43:52,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 92 transitions, 1058 flow [2022-12-13 01:43:52,708 INFO L130 PetriNetUnfolder]: 88/579 cut-off events. [2022-12-13 01:43:52,708 INFO L131 PetriNetUnfolder]: For 4141/4187 co-relation queries the response was YES. [2022-12-13 01:43:52,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 579 events. 88/579 cut-off events. For 4141/4187 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5024 event pairs, 8 based on Foata normal form. 9/552 useless extension candidates. Maximal degree in co-relation 2411. Up to 121 conditions per place. [2022-12-13 01:43:52,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 92 transitions, 1058 flow [2022-12-13 01:43:52,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 596 [2022-12-13 01:43:52,878 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:52,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-13 01:43:52,879 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 91 transitions, 1082 flow [2022-12-13 01:43:52,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:52,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:52,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:52,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 01:43:52,879 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:52,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:52,879 INFO L85 PathProgramCache]: Analyzing trace with hash -360375658, now seen corresponding path program 1 times [2022-12-13 01:43:52,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:52,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197788088] [2022-12-13 01:43:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:53,482 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-13 01:43:53,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:53,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197788088] [2022-12-13 01:43:53,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197788088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:53,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:53,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:53,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515111580] [2022-12-13 01:43:53,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:53,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:53,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:53,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:53,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:53,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:43:53,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 91 transitions, 1082 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:53,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:53,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:43:53,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:53,956 INFO L130 PetriNetUnfolder]: 1135/2288 cut-off events. [2022-12-13 01:43:53,956 INFO L131 PetriNetUnfolder]: For 22350/22350 co-relation queries the response was YES. [2022-12-13 01:43:53,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12126 conditions, 2288 events. 1135/2288 cut-off events. For 22350/22350 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14803 event pairs, 464 based on Foata normal form. 2/2290 useless extension candidates. Maximal degree in co-relation 12056. Up to 1133 conditions per place. [2022-12-13 01:43:53,966 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 149 selfloop transitions, 19 changer transitions 17/185 dead transitions. [2022-12-13 01:43:53,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 185 transitions, 2138 flow [2022-12-13 01:43:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2022-12-13 01:43:53,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3825 [2022-12-13 01:43:53,966 INFO L175 Difference]: Start difference. First operand has 108 places, 91 transitions, 1082 flow. Second operand 8 states and 153 transitions. [2022-12-13 01:43:53,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 185 transitions, 2138 flow [2022-12-13 01:43:53,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 185 transitions, 2082 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-13 01:43:53,993 INFO L231 Difference]: Finished difference. Result has 110 places, 90 transitions, 1063 flow [2022-12-13 01:43:53,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1063, PETRI_PLACES=110, PETRI_TRANSITIONS=90} [2022-12-13 01:43:53,993 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2022-12-13 01:43:53,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:53,994 INFO L89 Accepts]: Start accepts. Operand has 110 places, 90 transitions, 1063 flow [2022-12-13 01:43:53,994 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:53,994 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:53,994 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 90 transitions, 1063 flow [2022-12-13 01:43:53,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 90 transitions, 1063 flow [2022-12-13 01:43:54,031 INFO L130 PetriNetUnfolder]: 89/578 cut-off events. [2022-12-13 01:43:54,031 INFO L131 PetriNetUnfolder]: For 4406/4456 co-relation queries the response was YES. [2022-12-13 01:43:54,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 578 events. 89/578 cut-off events. For 4406/4456 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4935 event pairs, 4 based on Foata normal form. 11/552 useless extension candidates. Maximal degree in co-relation 2444. Up to 119 conditions per place. [2022-12-13 01:43:54,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 90 transitions, 1063 flow [2022-12-13 01:43:54,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 01:43:54,037 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:54,038 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 01:43:54,038 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 1063 flow [2022-12-13 01:43:54,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:54,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:54,038 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:54,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 01:43:54,038 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:54,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2117895460, now seen corresponding path program 2 times [2022-12-13 01:43:54,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:54,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16221781] [2022-12-13 01:43:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:54,817 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-13 01:43:54,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:54,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16221781] [2022-12-13 01:43:54,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16221781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:54,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:54,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:54,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649845430] [2022-12-13 01:43:54,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:54,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:54,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:43:54,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 1063 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:54,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:54,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:43:54,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:55,312 INFO L130 PetriNetUnfolder]: 1141/2318 cut-off events. [2022-12-13 01:43:55,312 INFO L131 PetriNetUnfolder]: For 21811/21811 co-relation queries the response was YES. [2022-12-13 01:43:55,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12203 conditions, 2318 events. 1141/2318 cut-off events. For 21811/21811 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15185 event pairs, 399 based on Foata normal form. 2/2320 useless extension candidates. Maximal degree in co-relation 12135. Up to 1133 conditions per place. [2022-12-13 01:43:55,324 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 147 selfloop transitions, 19 changer transitions 21/187 dead transitions. [2022-12-13 01:43:55,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 187 transitions, 2186 flow [2022-12-13 01:43:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2022-12-13 01:43:55,325 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3975 [2022-12-13 01:43:55,325 INFO L175 Difference]: Start difference. First operand has 108 places, 90 transitions, 1063 flow. Second operand 8 states and 159 transitions. [2022-12-13 01:43:55,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 187 transitions, 2186 flow [2022-12-13 01:43:55,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 187 transitions, 2149 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 01:43:55,355 INFO L231 Difference]: Finished difference. Result has 111 places, 86 transitions, 968 flow [2022-12-13 01:43:55,355 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=968, PETRI_PLACES=111, PETRI_TRANSITIONS=86} [2022-12-13 01:43:55,355 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:43:55,355 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:55,355 INFO L89 Accepts]: Start accepts. Operand has 111 places, 86 transitions, 968 flow [2022-12-13 01:43:55,356 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:55,356 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:55,356 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 86 transitions, 968 flow [2022-12-13 01:43:55,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 86 transitions, 968 flow [2022-12-13 01:43:55,392 INFO L130 PetriNetUnfolder]: 85/563 cut-off events. [2022-12-13 01:43:55,393 INFO L131 PetriNetUnfolder]: For 3981/4017 co-relation queries the response was YES. [2022-12-13 01:43:55,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 563 events. 85/563 cut-off events. For 3981/4017 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4798 event pairs, 6 based on Foata normal form. 9/538 useless extension candidates. Maximal degree in co-relation 2341. Up to 113 conditions per place. [2022-12-13 01:43:55,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 86 transitions, 968 flow [2022-12-13 01:43:55,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-13 01:43:55,400 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:43:55,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 01:43:55,401 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 86 transitions, 968 flow [2022-12-13 01:43:55,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:43:55,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:55,401 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:55,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-13 01:43:55,401 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:55,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1804204235, now seen corresponding path program 1 times [2022-12-13 01:43:55,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:55,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871738576] [2022-12-13 01:43:55,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:55,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:55,841 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-13 01:43:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:55,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871738576] [2022-12-13 01:43:55,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871738576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:55,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:55,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:55,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141171614] [2022-12-13 01:43:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:55,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:55,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:55,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:55,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:55,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:43:55,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 86 transitions, 968 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:55,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:55,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:43:55,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:56,459 INFO L130 PetriNetUnfolder]: 1125/2306 cut-off events. [2022-12-13 01:43:56,460 INFO L131 PetriNetUnfolder]: For 21000/21000 co-relation queries the response was YES. [2022-12-13 01:43:56,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12022 conditions, 2306 events. 1125/2306 cut-off events. For 21000/21000 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15138 event pairs, 385 based on Foata normal form. 2/2308 useless extension candidates. Maximal degree in co-relation 11947. Up to 1133 conditions per place. [2022-12-13 01:43:56,470 INFO L137 encePairwiseOnDemand]: 34/47 looper letters, 166 selfloop transitions, 24 changer transitions 10/200 dead transitions. [2022-12-13 01:43:56,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 200 transitions, 2222 flow [2022-12-13 01:43:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:43:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:43:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2022-12-13 01:43:56,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3659574468085106 [2022-12-13 01:43:56,471 INFO L175 Difference]: Start difference. First operand has 108 places, 86 transitions, 968 flow. Second operand 10 states and 172 transitions. [2022-12-13 01:43:56,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 200 transitions, 2222 flow [2022-12-13 01:43:56,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 200 transitions, 2143 flow, removed 14 selfloop flow, removed 10 redundant places. [2022-12-13 01:43:56,497 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 1061 flow [2022-12-13 01:43:56,497 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1061, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2022-12-13 01:43:56,498 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:43:56,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:56,498 INFO L89 Accepts]: Start accepts. Operand has 111 places, 91 transitions, 1061 flow [2022-12-13 01:43:56,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:56,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:56,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 91 transitions, 1061 flow [2022-12-13 01:43:56,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 91 transitions, 1061 flow [2022-12-13 01:43:56,536 INFO L130 PetriNetUnfolder]: 81/567 cut-off events. [2022-12-13 01:43:56,536 INFO L131 PetriNetUnfolder]: For 4121/4157 co-relation queries the response was YES. [2022-12-13 01:43:56,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 567 events. 81/567 cut-off events. For 4121/4157 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4898 event pairs, 1 based on Foata normal form. 9/542 useless extension candidates. Maximal degree in co-relation 2353. Up to 113 conditions per place. [2022-12-13 01:43:56,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 91 transitions, 1061 flow [2022-12-13 01:43:56,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 588 [2022-12-13 01:43:56,674 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:56,674 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 176 [2022-12-13 01:43:56,674 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 90 transitions, 1083 flow [2022-12-13 01:43:56,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:56,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:56,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:56,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 01:43:56,675 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1667668518, now seen corresponding path program 3 times [2022-12-13 01:43:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:56,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445156304] [2022-12-13 01:43:56,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:57,164 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-13 01:43:57,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:57,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445156304] [2022-12-13 01:43:57,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445156304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:57,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:57,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:57,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61719342] [2022-12-13 01:43:57,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:57,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:57,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:57,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:57,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:43:57,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 90 transitions, 1083 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:57,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:57,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:43:57,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:57,798 INFO L130 PetriNetUnfolder]: 1132/2350 cut-off events. [2022-12-13 01:43:57,798 INFO L131 PetriNetUnfolder]: For 22699/22699 co-relation queries the response was YES. [2022-12-13 01:43:57,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12322 conditions, 2350 events. 1132/2350 cut-off events. For 22699/22699 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15736 event pairs, 423 based on Foata normal form. 2/2352 useless extension candidates. Maximal degree in co-relation 12246. Up to 1133 conditions per place. [2022-12-13 01:43:57,809 INFO L137 encePairwiseOnDemand]: 29/50 looper letters, 148 selfloop transitions, 23 changer transitions 33/204 dead transitions. [2022-12-13 01:43:57,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 204 transitions, 2404 flow [2022-12-13 01:43:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:43:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:43:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2022-12-13 01:43:57,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3054545454545455 [2022-12-13 01:43:57,810 INFO L175 Difference]: Start difference. First operand has 109 places, 90 transitions, 1083 flow. Second operand 11 states and 168 transitions. [2022-12-13 01:43:57,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 204 transitions, 2404 flow [2022-12-13 01:43:57,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 204 transitions, 2283 flow, removed 35 selfloop flow, removed 7 redundant places. [2022-12-13 01:43:57,840 INFO L231 Difference]: Finished difference. Result has 117 places, 93 transitions, 1081 flow [2022-12-13 01:43:57,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1081, PETRI_PLACES=117, PETRI_TRANSITIONS=93} [2022-12-13 01:43:57,841 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2022-12-13 01:43:57,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:57,841 INFO L89 Accepts]: Start accepts. Operand has 117 places, 93 transitions, 1081 flow [2022-12-13 01:43:57,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:57,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:57,842 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 93 transitions, 1081 flow [2022-12-13 01:43:57,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 93 transitions, 1081 flow [2022-12-13 01:43:57,876 INFO L130 PetriNetUnfolder]: 80/519 cut-off events. [2022-12-13 01:43:57,876 INFO L131 PetriNetUnfolder]: For 3433/3477 co-relation queries the response was YES. [2022-12-13 01:43:57,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2229 conditions, 519 events. 80/519 cut-off events. For 3433/3477 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4268 event pairs, 1 based on Foata normal form. 7/497 useless extension candidates. Maximal degree in co-relation 2164. Up to 101 conditions per place. [2022-12-13 01:43:57,880 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 93 transitions, 1081 flow [2022-12-13 01:43:57,880 INFO L226 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-13 01:43:57,880 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] L71-->L74: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= (ite (and (<= 0 v_~i~0_32) (< v_~i~0_32 v_~n~0_22)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~n~0=v_~n~0_22, ~i~0=v_~i~0_32} OutVars{~n~0=v_~n~0_22, ~i~0=v_~i~0_32, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [686] $Ultimate##0-->thread1EXIT: Formula: (and (= v_~n1~0_168 0) (= v_~n1~0_169 v_~tmp2~0_95) (= v_~e2~0_133 1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_20| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_20| 0)) InVars {~n1~0=v_~n1~0_169} OutVars{~n1~0=v_~n1~0_168, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_20|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_20|, ~tmp2~0=v_~tmp2~0_95, ~e2~0=v_~e2~0_133} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~tmp2~0, ~e2~0] [2022-12-13 01:43:57,935 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [809] L59-->L154-3: Formula: (and (not (= (ite (= (mod v_~e2~0_494 256) 0) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre15#1_91| |v_#pthreadsForks_165|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_291| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291| (ite (or (<= v_~n1~0_584 v_~n2~0_628) (= v_~n2~0_628 0)) 1 0)) (= (select (select |v_#memory_int_635| v_~f~0.base_537) (+ v_~f~0.offset_544 (* v_~i1~0_372 4))) v_~i~0_967) (= (+ |v_#pthreadsForks_165| 1) |v_#pthreadsForks_164|) (= v_~i1~0_372 v_~i~0_968) (= (store |v_#memory_int_635| |v_ULTIMATE.start_main_~#t2~0#1.base_93| (store (select |v_#memory_int_635| |v_ULTIMATE.start_main_~#t2~0#1.base_93|) |v_ULTIMATE.start_main_~#t2~0#1.offset_59| |v_ULTIMATE.start_main_#t~pre15#1_91|)) |v_#memory_int_634|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|)) InVars {#pthreadsForks=|v_#pthreadsForks_165|, ~n2~0=v_~n2~0_628, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_59|, ~i~0=v_~i~0_968, ~f~0.base=v_~f~0.base_537, ~n1~0=v_~n1~0_584, #memory_int=|v_#memory_int_635|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_93|, ~f~0.offset=v_~f~0.offset_544, ~e2~0=v_~e2~0_494} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_81|, ~n2~0=v_~n2~0_628, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_59|, ~i~0=v_~i~0_967, ~f~0.base=v_~f~0.base_537, ~n1~0=v_~n1~0_584, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_91|, ~i1~0=v_~i1~0_372, ~f~0.offset=v_~f~0.offset_544, ~e2~0=v_~e2~0_494, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_51|, #pthreadsForks=|v_#pthreadsForks_164|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_291|, #memory_int=|v_#memory_int_634|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_285|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_93|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_291|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre15#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, ULTIMATE.start_main_#t~nondet14#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [817] L71-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_46| 0) (= v_~e2~0_546 1) (= v_~tmp2~0_376 v_~n1~0_632) (= |v_thread1Thread1of1ForFork1_#res#1.offset_46| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_327| (ite (and (<= 0 v_~i~0_1068) (< v_~i~0_1068 v_~n~0_388)) 1 0)) (= v_~n1~0_631 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_327| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_327|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_327| 0))) InVars {~i~0=v_~i~0_1068, ~n1~0=v_~n1~0_632, ~n~0=v_~n~0_388} OutVars{~i~0=v_~i~0_1068, ~n1~0=v_~n1~0_631, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_327|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_46|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_46|, ~tmp2~0=v_~tmp2~0_376, ~n~0=v_~n~0_388, ~e2~0=v_~e2~0_546, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_327|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~tmp2~0, ~e2~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:43:58,251 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 01:43:58,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 411 [2022-12-13 01:43:58,252 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 93 transitions, 1129 flow [2022-12-13 01:43:58,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:58,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:58,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:58,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 01:43:58,252 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:58,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash -457731338, now seen corresponding path program 1 times [2022-12-13 01:43:58,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:58,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121585068] [2022-12-13 01:43:58,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:58,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:58,710 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-13 01:43:58,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:58,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121585068] [2022-12-13 01:43:58,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121585068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:58,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:58,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:43:58,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570085119] [2022-12-13 01:43:58,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:58,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:43:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:58,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:43:58,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:43:58,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:43:58,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 93 transitions, 1129 flow. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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-13 01:43:58,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:58,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:43:58,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:43:59,096 INFO L130 PetriNetUnfolder]: 973/1978 cut-off events. [2022-12-13 01:43:59,097 INFO L131 PetriNetUnfolder]: For 16373/16373 co-relation queries the response was YES. [2022-12-13 01:43:59,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10236 conditions, 1978 events. 973/1978 cut-off events. For 16373/16373 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12541 event pairs, 372 based on Foata normal form. 2/1980 useless extension candidates. Maximal degree in co-relation 10163. Up to 1133 conditions per place. [2022-12-13 01:43:59,106 INFO L137 encePairwiseOnDemand]: 35/51 looper letters, 138 selfloop transitions, 22 changer transitions 19/179 dead transitions. [2022-12-13 01:43:59,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 179 transitions, 2040 flow [2022-12-13 01:43:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:43:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:43:59,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2022-12-13 01:43:59,106 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3700980392156863 [2022-12-13 01:43:59,106 INFO L175 Difference]: Start difference. First operand has 112 places, 93 transitions, 1129 flow. Second operand 8 states and 151 transitions. [2022-12-13 01:43:59,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 179 transitions, 2040 flow [2022-12-13 01:43:59,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 179 transitions, 1940 flow, removed 29 selfloop flow, removed 11 redundant places. [2022-12-13 01:43:59,130 INFO L231 Difference]: Finished difference. Result has 109 places, 90 transitions, 1013 flow [2022-12-13 01:43:59,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1013, PETRI_PLACES=109, PETRI_TRANSITIONS=90} [2022-12-13 01:43:59,131 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2022-12-13 01:43:59,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:43:59,131 INFO L89 Accepts]: Start accepts. Operand has 109 places, 90 transitions, 1013 flow [2022-12-13 01:43:59,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:43:59,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:43:59,131 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 90 transitions, 1013 flow [2022-12-13 01:43:59,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 90 transitions, 1013 flow [2022-12-13 01:43:59,163 INFO L130 PetriNetUnfolder]: 77/496 cut-off events. [2022-12-13 01:43:59,163 INFO L131 PetriNetUnfolder]: For 2811/2857 co-relation queries the response was YES. [2022-12-13 01:43:59,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2094 conditions, 496 events. 77/496 cut-off events. For 2811/2857 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4068 event pairs, 13 based on Foata normal form. 7/474 useless extension candidates. Maximal degree in co-relation 1800. Up to 101 conditions per place. [2022-12-13 01:43:59,167 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 90 transitions, 1013 flow [2022-12-13 01:43:59,167 INFO L226 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-13 01:43:59,220 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:43:59,220 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-13 01:43:59,221 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 1007 flow [2022-12-13 01:43:59,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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-13 01:43:59,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:43:59,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:43:59,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-13 01:43:59,221 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:43:59,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:43:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2120755463, now seen corresponding path program 1 times [2022-12-13 01:43:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:43:59,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570159925] [2022-12-13 01:43:59,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:43:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:43:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:43:59,919 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-13 01:43:59,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:43:59,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570159925] [2022-12-13 01:43:59,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570159925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:43:59,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:43:59,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:43:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130547443] [2022-12-13 01:43:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:43:59,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:43:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:43:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:43:59,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:43:59,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:43:59,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 1007 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:43:59,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:43:59,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:43:59,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:00,451 INFO L130 PetriNetUnfolder]: 948/1947 cut-off events. [2022-12-13 01:44:00,451 INFO L131 PetriNetUnfolder]: For 14755/14755 co-relation queries the response was YES. [2022-12-13 01:44:00,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9897 conditions, 1947 events. 948/1947 cut-off events. For 14755/14755 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12338 event pairs, 366 based on Foata normal form. 2/1949 useless extension candidates. Maximal degree in co-relation 8432. Up to 1133 conditions per place. [2022-12-13 01:44:00,460 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 136 selfloop transitions, 17 changer transitions 30/183 dead transitions. [2022-12-13 01:44:00,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 183 transitions, 2025 flow [2022-12-13 01:44:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:44:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:44:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2022-12-13 01:44:00,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35600907029478457 [2022-12-13 01:44:00,461 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 1007 flow. Second operand 9 states and 157 transitions. [2022-12-13 01:44:00,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 183 transitions, 2025 flow [2022-12-13 01:44:00,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 183 transitions, 1963 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-13 01:44:00,481 INFO L231 Difference]: Finished difference. Result has 111 places, 85 transitions, 929 flow [2022-12-13 01:44:00,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=929, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2022-12-13 01:44:00,482 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:44:00,482 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:00,482 INFO L89 Accepts]: Start accepts. Operand has 111 places, 85 transitions, 929 flow [2022-12-13 01:44:00,482 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:00,483 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:00,483 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 85 transitions, 929 flow [2022-12-13 01:44:00,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 85 transitions, 929 flow [2022-12-13 01:44:00,513 INFO L130 PetriNetUnfolder]: 75/460 cut-off events. [2022-12-13 01:44:00,513 INFO L131 PetriNetUnfolder]: For 2789/2827 co-relation queries the response was YES. [2022-12-13 01:44:00,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 460 events. 75/460 cut-off events. For 2789/2827 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3641 event pairs, 6 based on Foata normal form. 7/441 useless extension candidates. Maximal degree in co-relation 1917. Up to 93 conditions per place. [2022-12-13 01:44:00,516 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 85 transitions, 929 flow [2022-12-13 01:44:00,516 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 01:44:00,517 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:00,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 01:44:00,517 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 929 flow [2022-12-13 01:44:00,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:00,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:00,518 INFO L214 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] [2022-12-13 01:44:00,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-13 01:44:00,518 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:00,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:00,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1304412109, now seen corresponding path program 1 times [2022-12-13 01:44:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:00,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748191106] [2022-12-13 01:44:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:01,880 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-13 01:44:01,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:01,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748191106] [2022-12-13 01:44:01,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748191106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:01,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:01,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:44:01,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450435884] [2022-12-13 01:44:01,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:01,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:44:01,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:01,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:44:01,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:44:01,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:44:01,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 85 transitions, 929 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:01,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:01,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:44:01,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:02,500 INFO L130 PetriNetUnfolder]: 907/1866 cut-off events. [2022-12-13 01:44:02,500 INFO L131 PetriNetUnfolder]: For 14144/14144 co-relation queries the response was YES. [2022-12-13 01:44:02,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9475 conditions, 1866 events. 907/1866 cut-off events. For 14144/14144 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11728 event pairs, 377 based on Foata normal form. 3/1869 useless extension candidates. Maximal degree in co-relation 9405. Up to 1133 conditions per place. [2022-12-13 01:44:02,510 INFO L137 encePairwiseOnDemand]: 31/46 looper letters, 123 selfloop transitions, 15 changer transitions 36/174 dead transitions. [2022-12-13 01:44:02,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 174 transitions, 1912 flow [2022-12-13 01:44:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:44:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:44:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2022-12-13 01:44:02,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3239130434782609 [2022-12-13 01:44:02,511 INFO L175 Difference]: Start difference. First operand has 107 places, 85 transitions, 929 flow. Second operand 10 states and 149 transitions. [2022-12-13 01:44:02,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 174 transitions, 1912 flow [2022-12-13 01:44:02,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 174 transitions, 1845 flow, removed 15 selfloop flow, removed 11 redundant places. [2022-12-13 01:44:02,531 INFO L231 Difference]: Finished difference. Result has 110 places, 86 transitions, 936 flow [2022-12-13 01:44:02,532 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=936, PETRI_PLACES=110, PETRI_TRANSITIONS=86} [2022-12-13 01:44:02,532 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2022-12-13 01:44:02,532 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:02,532 INFO L89 Accepts]: Start accepts. Operand has 110 places, 86 transitions, 936 flow [2022-12-13 01:44:02,533 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:02,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:02,533 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 86 transitions, 936 flow [2022-12-13 01:44:02,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 86 transitions, 936 flow [2022-12-13 01:44:02,565 INFO L130 PetriNetUnfolder]: 70/435 cut-off events. [2022-12-13 01:44:02,565 INFO L131 PetriNetUnfolder]: For 2650/2688 co-relation queries the response was YES. [2022-12-13 01:44:02,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 435 events. 70/435 cut-off events. For 2650/2688 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3412 event pairs, 13 based on Foata normal form. 7/415 useless extension candidates. Maximal degree in co-relation 1857. Up to 87 conditions per place. [2022-12-13 01:44:02,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 86 transitions, 936 flow [2022-12-13 01:44:02,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-13 01:44:02,569 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:44:02,612 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:44:02,656 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:02,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:44:02,657 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 86 transitions, 950 flow [2022-12-13 01:44:02,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:02,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:02,657 INFO L214 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] [2022-12-13 01:44:02,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-13 01:44:02,657 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:02,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:02,658 INFO L85 PathProgramCache]: Analyzing trace with hash 21268144, now seen corresponding path program 1 times [2022-12-13 01:44:02,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:02,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827020739] [2022-12-13 01:44:02,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:03,256 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-13 01:44:03,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:03,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827020739] [2022-12-13 01:44:03,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827020739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:03,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:03,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:44:03,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429904566] [2022-12-13 01:44:03,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:03,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:44:03,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:44:03,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:44:03,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:44:03,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 86 transitions, 950 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:03,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:03,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:44:03,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:03,780 INFO L130 PetriNetUnfolder]: 835/1701 cut-off events. [2022-12-13 01:44:03,780 INFO L131 PetriNetUnfolder]: For 12761/12761 co-relation queries the response was YES. [2022-12-13 01:44:03,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8746 conditions, 1701 events. 835/1701 cut-off events. For 12761/12761 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10419 event pairs, 309 based on Foata normal form. 2/1703 useless extension candidates. Maximal degree in co-relation 8682. Up to 1269 conditions per place. [2022-12-13 01:44:03,789 INFO L137 encePairwiseOnDemand]: 36/48 looper letters, 91 selfloop transitions, 14 changer transitions 43/148 dead transitions. [2022-12-13 01:44:03,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 148 transitions, 1633 flow [2022-12-13 01:44:03,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:44:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:44:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-12-13 01:44:03,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2022-12-13 01:44:03,790 INFO L175 Difference]: Start difference. First operand has 106 places, 86 transitions, 950 flow. Second operand 10 states and 130 transitions. [2022-12-13 01:44:03,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 148 transitions, 1633 flow [2022-12-13 01:44:03,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 148 transitions, 1567 flow, removed 24 selfloop flow, removed 7 redundant places. [2022-12-13 01:44:03,810 INFO L231 Difference]: Finished difference. Result has 112 places, 78 transitions, 798 flow [2022-12-13 01:44:03,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=798, PETRI_PLACES=112, PETRI_TRANSITIONS=78} [2022-12-13 01:44:03,811 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2022-12-13 01:44:03,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:03,811 INFO L89 Accepts]: Start accepts. Operand has 112 places, 78 transitions, 798 flow [2022-12-13 01:44:03,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:03,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:03,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 78 transitions, 798 flow [2022-12-13 01:44:03,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 78 transitions, 798 flow [2022-12-13 01:44:03,838 INFO L130 PetriNetUnfolder]: 67/391 cut-off events. [2022-12-13 01:44:03,838 INFO L131 PetriNetUnfolder]: For 1951/1973 co-relation queries the response was YES. [2022-12-13 01:44:03,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1657 conditions, 391 events. 67/391 cut-off events. For 1951/1973 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2875 event pairs, 11 based on Foata normal form. 3/375 useless extension candidates. Maximal degree in co-relation 1603. Up to 75 conditions per place. [2022-12-13 01:44:03,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 78 transitions, 798 flow [2022-12-13 01:44:03,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 01:44:03,844 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:03,844 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 01:44:03,844 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 78 transitions, 798 flow [2022-12-13 01:44:03,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:03,844 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:03,844 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:03,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-13 01:44:03,845 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:03,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:03,845 INFO L85 PathProgramCache]: Analyzing trace with hash -542334369, now seen corresponding path program 1 times [2022-12-13 01:44:03,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:03,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021544144] [2022-12-13 01:44:03,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:03,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:04,261 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-13 01:44:04,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:04,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021544144] [2022-12-13 01:44:04,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021544144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:04,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:04,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:44:04,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676721772] [2022-12-13 01:44:04,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:04,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:44:04,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:44:04,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 78 transitions, 798 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:04,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:04,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:44:04,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:04,612 INFO L130 PetriNetUnfolder]: 794/1598 cut-off events. [2022-12-13 01:44:04,612 INFO L131 PetriNetUnfolder]: For 10215/10215 co-relation queries the response was YES. [2022-12-13 01:44:04,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8048 conditions, 1598 events. 794/1598 cut-off events. For 10215/10215 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9509 event pairs, 291 based on Foata normal form. 2/1600 useless extension candidates. Maximal degree in co-relation 7984. Up to 1133 conditions per place. [2022-12-13 01:44:04,619 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 120 selfloop transitions, 14 changer transitions 22/156 dead transitions. [2022-12-13 01:44:04,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 156 transitions, 1647 flow [2022-12-13 01:44:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:44:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:44:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2022-12-13 01:44:04,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.321256038647343 [2022-12-13 01:44:04,620 INFO L175 Difference]: Start difference. First operand has 104 places, 78 transitions, 798 flow. Second operand 9 states and 133 transitions. [2022-12-13 01:44:04,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 156 transitions, 1647 flow [2022-12-13 01:44:04,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 156 transitions, 1566 flow, removed 25 selfloop flow, removed 12 redundant places. [2022-12-13 01:44:04,633 INFO L231 Difference]: Finished difference. Result has 104 places, 81 transitions, 808 flow [2022-12-13 01:44:04,634 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=808, PETRI_PLACES=104, PETRI_TRANSITIONS=81} [2022-12-13 01:44:04,634 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places. [2022-12-13 01:44:04,634 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:04,634 INFO L89 Accepts]: Start accepts. Operand has 104 places, 81 transitions, 808 flow [2022-12-13 01:44:04,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:04,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:04,635 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 81 transitions, 808 flow [2022-12-13 01:44:04,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 81 transitions, 808 flow [2022-12-13 01:44:04,659 INFO L130 PetriNetUnfolder]: 69/392 cut-off events. [2022-12-13 01:44:04,659 INFO L131 PetriNetUnfolder]: For 1718/1734 co-relation queries the response was YES. [2022-12-13 01:44:04,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1595 conditions, 392 events. 69/392 cut-off events. For 1718/1734 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2862 event pairs, 6 based on Foata normal form. 3/372 useless extension candidates. Maximal degree in co-relation 1544. Up to 80 conditions per place. [2022-12-13 01:44:04,662 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 81 transitions, 808 flow [2022-12-13 01:44:04,662 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 01:44:04,750 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:44:04,751 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:44:04,751 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 80 transitions, 815 flow [2022-12-13 01:44:04,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:04,751 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:04,751 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:04,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-13 01:44:04,751 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:04,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash 139674656, now seen corresponding path program 1 times [2022-12-13 01:44:04,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:04,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948909783] [2022-12-13 01:44:04,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:04,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:05,151 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-13 01:44:05,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:05,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948909783] [2022-12-13 01:44:05,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948909783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:05,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:05,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161117580] [2022-12-13 01:44:05,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:05,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:05,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:05,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:05,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:05,152 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:44:05,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 80 transitions, 815 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:05,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:05,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:44:05,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:05,598 INFO L130 PetriNetUnfolder]: 779/1567 cut-off events. [2022-12-13 01:44:05,598 INFO L131 PetriNetUnfolder]: For 9717/9717 co-relation queries the response was YES. [2022-12-13 01:44:05,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7787 conditions, 1567 events. 779/1567 cut-off events. For 9717/9717 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9195 event pairs, 291 based on Foata normal form. 2/1569 useless extension candidates. Maximal degree in co-relation 7726. Up to 1133 conditions per place. [2022-12-13 01:44:05,606 INFO L137 encePairwiseOnDemand]: 33/46 looper letters, 110 selfloop transitions, 19 changer transitions 21/150 dead transitions. [2022-12-13 01:44:05,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 150 transitions, 1568 flow [2022-12-13 01:44:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:44:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:44:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 129 transitions. [2022-12-13 01:44:05,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3115942028985507 [2022-12-13 01:44:05,607 INFO L175 Difference]: Start difference. First operand has 101 places, 80 transitions, 815 flow. Second operand 9 states and 129 transitions. [2022-12-13 01:44:05,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 150 transitions, 1568 flow [2022-12-13 01:44:05,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 150 transitions, 1525 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-13 01:44:05,620 INFO L231 Difference]: Finished difference. Result has 107 places, 85 transitions, 881 flow [2022-12-13 01:44:05,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=881, PETRI_PLACES=107, PETRI_TRANSITIONS=85} [2022-12-13 01:44:05,621 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:44:05,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:05,621 INFO L89 Accepts]: Start accepts. Operand has 107 places, 85 transitions, 881 flow [2022-12-13 01:44:05,621 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:05,621 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:05,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 85 transitions, 881 flow [2022-12-13 01:44:05,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 85 transitions, 881 flow [2022-12-13 01:44:05,649 INFO L130 PetriNetUnfolder]: 70/408 cut-off events. [2022-12-13 01:44:05,649 INFO L131 PetriNetUnfolder]: For 1822/1843 co-relation queries the response was YES. [2022-12-13 01:44:05,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 408 events. 70/408 cut-off events. For 1822/1843 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3044 event pairs, 1 based on Foata normal form. 5/395 useless extension candidates. Maximal degree in co-relation 1636. Up to 80 conditions per place. [2022-12-13 01:44:05,652 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 85 transitions, 881 flow [2022-12-13 01:44:05,652 INFO L226 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-13 01:44:05,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [825] L88-->L106: Formula: (and (not (= (ite (= (mod v_~e1~0_456 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_712| v_~f~0.base_616) (+ v_~f~0.offset_621 (* v_~i2~0_311 4))) v_~i~0_1122) (= v_~e2~0_578 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434|) (= v_~i2~0_311 v_~i~0_1123) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434| (ite (or (< v_~n2~0_712 v_~n1~0_663) (= v_~n1~0_663 0)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434| 0)) (= (+ v_~tmp2~0_396 1) v_~n2~0_712)) InVars {~i~0=v_~i~0_1123, ~f~0.base=v_~f~0.base_616, ~n1~0=v_~n1~0_663, #memory_int=|v_#memory_int_712|, ~tmp2~0=v_~tmp2~0_396, ~f~0.offset=v_~f~0.offset_621, ~e1~0=v_~e1~0_456} OutVars{~n2~0=v_~n2~0_712, ~i~0=v_~i~0_1122, ~f~0.base=v_~f~0.base_616, ~n1~0=v_~n1~0_663, ~i2~0=v_~i2~0_311, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434|, ~f~0.offset=v_~f~0.offset_621, ~e2~0=v_~e2~0_578, ~e1~0=v_~e1~0_456, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_155|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434|, #memory_int=|v_#memory_int_712|, ~tmp2~0=v_~tmp2~0_396} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] and [756] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~n2~0_342 v_~tmp1~0_163) (= v_~n2~0_341 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_41| 0) (= v_~n1~0_353 (+ v_~tmp1~0_163 1)) (= (ite (and (<= 0 v_~i~0_541) (< v_~i~0_541 v_~n~0_220)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|) (= v_~e1~0_194 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|)) InVars {~n2~0=v_~n2~0_342, ~i~0=v_~i~0_541, ~n~0=v_~n~0_220} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_41|, ~n2~0=v_~n2~0_341, ~i~0=v_~i~0_541, ~n1~0=v_~n1~0_353, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|, ~n~0=v_~n~0_220, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_41|, ~tmp1~0=v_~tmp1~0_163, ~e1~0=v_~e1~0_194} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:44:05,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [825] L88-->L106: Formula: (and (not (= (ite (= (mod v_~e1~0_456 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_712| v_~f~0.base_616) (+ v_~f~0.offset_621 (* v_~i2~0_311 4))) v_~i~0_1122) (= v_~e2~0_578 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434|) (= v_~i2~0_311 v_~i~0_1123) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434| (ite (or (< v_~n2~0_712 v_~n1~0_663) (= v_~n1~0_663 0)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434| 0)) (= (+ v_~tmp2~0_396 1) v_~n2~0_712)) InVars {~i~0=v_~i~0_1123, ~f~0.base=v_~f~0.base_616, ~n1~0=v_~n1~0_663, #memory_int=|v_#memory_int_712|, ~tmp2~0=v_~tmp2~0_396, ~f~0.offset=v_~f~0.offset_621, ~e1~0=v_~e1~0_456} OutVars{~n2~0=v_~n2~0_712, ~i~0=v_~i~0_1122, ~f~0.base=v_~f~0.base_616, ~n1~0=v_~n1~0_663, ~i2~0=v_~i2~0_311, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434|, ~f~0.offset=v_~f~0.offset_621, ~e2~0=v_~e2~0_578, ~e1~0=v_~e1~0_456, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_155|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434|, #memory_int=|v_#memory_int_712|, ~tmp2~0=v_~tmp2~0_396} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] and [754] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (= v_~e1~0_188 1) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| 0)) (= v_~n2~0_335 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|) (= v_~n2~0_336 v_~tmp1~0_159) (= (ite (and (<= 0 v_~i~0_539) (< v_~i~0_539 v_~n~0_218)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|)) InVars {~n2~0=v_~n2~0_336, ~i~0=v_~i~0_539, ~n~0=v_~n~0_218} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, ~n2~0=v_~n2~0_335, ~i~0=v_~i~0_539, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|, ~n~0=v_~n~0_218, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, ~tmp1~0=v_~tmp1~0_159, ~e1~0=v_~e1~0_188} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:44:05,952 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [825] L88-->L106: Formula: (and (not (= (ite (= (mod v_~e1~0_456 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_712| v_~f~0.base_616) (+ v_~f~0.offset_621 (* v_~i2~0_311 4))) v_~i~0_1122) (= v_~e2~0_578 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434|) (= v_~i2~0_311 v_~i~0_1123) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434| (ite (or (< v_~n2~0_712 v_~n1~0_663) (= v_~n1~0_663 0)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434| 0)) (= (+ v_~tmp2~0_396 1) v_~n2~0_712)) InVars {~i~0=v_~i~0_1123, ~f~0.base=v_~f~0.base_616, ~n1~0=v_~n1~0_663, #memory_int=|v_#memory_int_712|, ~tmp2~0=v_~tmp2~0_396, ~f~0.offset=v_~f~0.offset_621, ~e1~0=v_~e1~0_456} OutVars{~n2~0=v_~n2~0_712, ~i~0=v_~i~0_1122, ~f~0.base=v_~f~0.base_616, ~n1~0=v_~n1~0_663, ~i2~0=v_~i2~0_311, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434|, ~f~0.offset=v_~f~0.offset_621, ~e2~0=v_~e2~0_578, ~e1~0=v_~e1~0_456, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_155|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434|, #memory_int=|v_#memory_int_712|, ~tmp2~0=v_~tmp2~0_396} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:44:06,015 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [825] L88-->L106: Formula: (and (not (= (ite (= (mod v_~e1~0_456 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_712| v_~f~0.base_616) (+ v_~f~0.offset_621 (* v_~i2~0_311 4))) v_~i~0_1122) (= v_~e2~0_578 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434|) (= v_~i2~0_311 v_~i~0_1123) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434| (ite (or (< v_~n2~0_712 v_~n1~0_663) (= v_~n1~0_663 0)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434| 0)) (= (+ v_~tmp2~0_396 1) v_~n2~0_712)) InVars {~i~0=v_~i~0_1123, ~f~0.base=v_~f~0.base_616, ~n1~0=v_~n1~0_663, #memory_int=|v_#memory_int_712|, ~tmp2~0=v_~tmp2~0_396, ~f~0.offset=v_~f~0.offset_621, ~e1~0=v_~e1~0_456} OutVars{~n2~0=v_~n2~0_712, ~i~0=v_~i~0_1122, ~f~0.base=v_~f~0.base_616, ~n1~0=v_~n1~0_663, ~i2~0=v_~i2~0_311, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_434|, ~f~0.offset=v_~f~0.offset_621, ~e2~0=v_~e2~0_578, ~e1~0=v_~e1~0_456, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_155|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_434|, #memory_int=|v_#memory_int_712|, ~tmp2~0=v_~tmp2~0_396} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:44:06,112 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:06,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 492 [2022-12-13 01:44:06,113 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 84 transitions, 959 flow [2022-12-13 01:44:06,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:06,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:06,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:06,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-13 01:44:06,113 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:06,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash 604892519, now seen corresponding path program 1 times [2022-12-13 01:44:06,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:06,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974952141] [2022-12-13 01:44:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:06,490 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-13 01:44:06,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:06,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974952141] [2022-12-13 01:44:06,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974952141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:06,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:06,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:44:06,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735285757] [2022-12-13 01:44:06,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:06,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:06,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:06,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:06,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:44:06,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:44:06,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 84 transitions, 959 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:06,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:06,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:44:06,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:06,887 INFO L130 PetriNetUnfolder]: 764/1556 cut-off events. [2022-12-13 01:44:06,888 INFO L131 PetriNetUnfolder]: For 10525/10525 co-relation queries the response was YES. [2022-12-13 01:44:06,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7877 conditions, 1556 events. 764/1556 cut-off events. For 10525/10525 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9189 event pairs, 328 based on Foata normal form. 2/1558 useless extension candidates. Maximal degree in co-relation 7815. Up to 1133 conditions per place. [2022-12-13 01:44:06,894 INFO L137 encePairwiseOnDemand]: 36/50 looper letters, 105 selfloop transitions, 15 changer transitions 24/144 dead transitions. [2022-12-13 01:44:06,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 144 transitions, 1661 flow [2022-12-13 01:44:06,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:06,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2022-12-13 01:44:06,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.305 [2022-12-13 01:44:06,894 INFO L175 Difference]: Start difference. First operand has 104 places, 84 transitions, 959 flow. Second operand 8 states and 122 transitions. [2022-12-13 01:44:06,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 144 transitions, 1661 flow [2022-12-13 01:44:06,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 144 transitions, 1549 flow, removed 39 selfloop flow, removed 7 redundant places. [2022-12-13 01:44:06,906 INFO L231 Difference]: Finished difference. Result has 106 places, 82 transitions, 865 flow [2022-12-13 01:44:06,906 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=865, PETRI_PLACES=106, PETRI_TRANSITIONS=82} [2022-12-13 01:44:06,906 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 01:44:06,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:06,907 INFO L89 Accepts]: Start accepts. Operand has 106 places, 82 transitions, 865 flow [2022-12-13 01:44:06,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:06,907 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:06,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 82 transitions, 865 flow [2022-12-13 01:44:06,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 82 transitions, 865 flow [2022-12-13 01:44:06,932 INFO L130 PetriNetUnfolder]: 66/390 cut-off events. [2022-12-13 01:44:06,932 INFO L131 PetriNetUnfolder]: For 1940/1958 co-relation queries the response was YES. [2022-12-13 01:44:06,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 390 events. 66/390 cut-off events. For 1940/1958 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2869 event pairs, 1 based on Foata normal form. 6/376 useless extension candidates. Maximal degree in co-relation 1578. Up to 71 conditions per place. [2022-12-13 01:44:06,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 82 transitions, 865 flow [2022-12-13 01:44:06,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 01:44:06,939 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:06,939 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 01:44:06,939 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 82 transitions, 865 flow [2022-12-13 01:44:06,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:06,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:06,939 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:06,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-13 01:44:06,940 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:06,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:06,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1109426147, now seen corresponding path program 2 times [2022-12-13 01:44:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:06,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987216592] [2022-12-13 01:44:06,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:06,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:07,432 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-13 01:44:07,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:07,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987216592] [2022-12-13 01:44:07,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987216592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:07,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:07,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:44:07,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945802388] [2022-12-13 01:44:07,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:07,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:07,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:07,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:07,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:44:07,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:44:07,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 82 transitions, 865 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:07,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:07,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:44:07,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:07,840 INFO L130 PetriNetUnfolder]: 768/1574 cut-off events. [2022-12-13 01:44:07,840 INFO L131 PetriNetUnfolder]: For 9834/9834 co-relation queries the response was YES. [2022-12-13 01:44:07,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7742 conditions, 1574 events. 768/1574 cut-off events. For 9834/9834 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9463 event pairs, 303 based on Foata normal form. 2/1576 useless extension candidates. Maximal degree in co-relation 7681. Up to 1133 conditions per place. [2022-12-13 01:44:07,848 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 110 selfloop transitions, 16 changer transitions 21/147 dead transitions. [2022-12-13 01:44:07,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 147 transitions, 1576 flow [2022-12-13 01:44:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2022-12-13 01:44:07,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3239795918367347 [2022-12-13 01:44:07,848 INFO L175 Difference]: Start difference. First operand has 104 places, 82 transitions, 865 flow. Second operand 8 states and 127 transitions. [2022-12-13 01:44:07,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 147 transitions, 1576 flow [2022-12-13 01:44:07,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 147 transitions, 1534 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-13 01:44:07,862 INFO L231 Difference]: Finished difference. Result has 106 places, 81 transitions, 859 flow [2022-12-13 01:44:07,862 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=859, PETRI_PLACES=106, PETRI_TRANSITIONS=81} [2022-12-13 01:44:07,862 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 01:44:07,863 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:07,863 INFO L89 Accepts]: Start accepts. Operand has 106 places, 81 transitions, 859 flow [2022-12-13 01:44:07,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:07,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:07,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 81 transitions, 859 flow [2022-12-13 01:44:07,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 81 transitions, 859 flow [2022-12-13 01:44:07,889 INFO L130 PetriNetUnfolder]: 66/396 cut-off events. [2022-12-13 01:44:07,890 INFO L131 PetriNetUnfolder]: For 1980/1998 co-relation queries the response was YES. [2022-12-13 01:44:07,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 396 events. 66/396 cut-off events. For 1980/1998 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2928 event pairs, 3 based on Foata normal form. 6/382 useless extension candidates. Maximal degree in co-relation 1595. Up to 65 conditions per place. [2022-12-13 01:44:07,892 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 81 transitions, 859 flow [2022-12-13 01:44:07,892 INFO L226 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-13 01:44:07,893 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:07,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 01:44:07,893 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 81 transitions, 859 flow [2022-12-13 01:44:07,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:07,893 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:07,894 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:07,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 01:44:07,894 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:07,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:07,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1933481699, now seen corresponding path program 3 times [2022-12-13 01:44:07,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:07,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373278358] [2022-12-13 01:44:07,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:07,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:08,302 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-13 01:44:08,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:08,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373278358] [2022-12-13 01:44:08,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373278358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:08,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:08,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:44:08,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056184470] [2022-12-13 01:44:08,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:08,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:08,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:08,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:08,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:44:08,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:44:08,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 81 transitions, 859 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:08,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:08,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:44:08,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:08,654 INFO L130 PetriNetUnfolder]: 750/1545 cut-off events. [2022-12-13 01:44:08,654 INFO L131 PetriNetUnfolder]: For 9868/9868 co-relation queries the response was YES. [2022-12-13 01:44:08,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7644 conditions, 1545 events. 750/1545 cut-off events. For 9868/9868 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9302 event pairs, 335 based on Foata normal form. 2/1547 useless extension candidates. Maximal degree in co-relation 7583. Up to 1133 conditions per place. [2022-12-13 01:44:08,664 INFO L137 encePairwiseOnDemand]: 37/49 looper letters, 105 selfloop transitions, 14 changer transitions 24/143 dead transitions. [2022-12-13 01:44:08,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 143 transitions, 1526 flow [2022-12-13 01:44:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2022-12-13 01:44:08,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3163265306122449 [2022-12-13 01:44:08,665 INFO L175 Difference]: Start difference. First operand has 105 places, 81 transitions, 859 flow. Second operand 8 states and 124 transitions. [2022-12-13 01:44:08,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 143 transitions, 1526 flow [2022-12-13 01:44:08,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 143 transitions, 1484 flow, removed 4 selfloop flow, removed 8 redundant places. [2022-12-13 01:44:08,684 INFO L231 Difference]: Finished difference. Result has 107 places, 80 transitions, 857 flow [2022-12-13 01:44:08,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=857, PETRI_PLACES=107, PETRI_TRANSITIONS=80} [2022-12-13 01:44:08,684 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:44:08,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:08,684 INFO L89 Accepts]: Start accepts. Operand has 107 places, 80 transitions, 857 flow [2022-12-13 01:44:08,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:08,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:08,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 80 transitions, 857 flow [2022-12-13 01:44:08,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 80 transitions, 857 flow [2022-12-13 01:44:08,710 INFO L130 PetriNetUnfolder]: 64/373 cut-off events. [2022-12-13 01:44:08,710 INFO L131 PetriNetUnfolder]: For 1970/1988 co-relation queries the response was YES. [2022-12-13 01:44:08,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 373 events. 64/373 cut-off events. For 1970/1988 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2705 event pairs, 10 based on Foata normal form. 6/357 useless extension candidates. Maximal degree in co-relation 1543. Up to 63 conditions per place. [2022-12-13 01:44:08,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 80 transitions, 857 flow [2022-12-13 01:44:08,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-13 01:44:08,713 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:08,713 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 01:44:08,713 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 80 transitions, 857 flow [2022-12-13 01:44:08,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:08,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:08,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:08,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-13 01:44:08,714 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:08,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash -362830909, now seen corresponding path program 4 times [2022-12-13 01:44:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:08,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705942550] [2022-12-13 01:44:08,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:08,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:09,777 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-13 01:44:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:09,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705942550] [2022-12-13 01:44:09,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705942550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:09,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:09,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:09,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082251947] [2022-12-13 01:44:09,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:09,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:09,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:09,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:09,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:44:09,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 80 transitions, 857 flow. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:09,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:09,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:44:09,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:10,196 INFO L130 PetriNetUnfolder]: 716/1465 cut-off events. [2022-12-13 01:44:10,196 INFO L131 PetriNetUnfolder]: For 9429/9429 co-relation queries the response was YES. [2022-12-13 01:44:10,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7320 conditions, 1465 events. 716/1465 cut-off events. For 9429/9429 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8553 event pairs, 304 based on Foata normal form. 2/1467 useless extension candidates. Maximal degree in co-relation 7259. Up to 1133 conditions per place. [2022-12-13 01:44:10,203 INFO L137 encePairwiseOnDemand]: 37/49 looper letters, 97 selfloop transitions, 9 changer transitions 40/146 dead transitions. [2022-12-13 01:44:10,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 146 transitions, 1598 flow [2022-12-13 01:44:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:44:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:44:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2022-12-13 01:44:10,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2834467120181406 [2022-12-13 01:44:10,204 INFO L175 Difference]: Start difference. First operand has 104 places, 80 transitions, 857 flow. Second operand 9 states and 125 transitions. [2022-12-13 01:44:10,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 146 transitions, 1598 flow [2022-12-13 01:44:10,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 146 transitions, 1566 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 01:44:10,217 INFO L231 Difference]: Finished difference. Result has 108 places, 73 transitions, 715 flow [2022-12-13 01:44:10,217 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=715, PETRI_PLACES=108, PETRI_TRANSITIONS=73} [2022-12-13 01:44:10,217 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:44:10,217 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:10,217 INFO L89 Accepts]: Start accepts. Operand has 108 places, 73 transitions, 715 flow [2022-12-13 01:44:10,218 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:10,218 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:10,218 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 73 transitions, 715 flow [2022-12-13 01:44:10,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 73 transitions, 715 flow [2022-12-13 01:44:10,240 INFO L130 PetriNetUnfolder]: 54/336 cut-off events. [2022-12-13 01:44:10,240 INFO L131 PetriNetUnfolder]: For 1512/1526 co-relation queries the response was YES. [2022-12-13 01:44:10,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1364 conditions, 336 events. 54/336 cut-off events. For 1512/1526 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2377 event pairs, 8 based on Foata normal form. 3/320 useless extension candidates. Maximal degree in co-relation 1314. Up to 56 conditions per place. [2022-12-13 01:44:10,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 73 transitions, 715 flow [2022-12-13 01:44:10,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-13 01:44:10,244 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:10,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 01:44:10,245 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 73 transitions, 715 flow [2022-12-13 01:44:10,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:10,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:10,245 INFO L214 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] [2022-12-13 01:44:10,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-13 01:44:10,245 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:10,245 INFO L85 PathProgramCache]: Analyzing trace with hash -893880027, now seen corresponding path program 1 times [2022-12-13 01:44:10,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:10,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909196615] [2022-12-13 01:44:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:10,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:10,691 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-13 01:44:10,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:10,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909196615] [2022-12-13 01:44:10,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909196615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:10,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:10,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:44:10,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242496173] [2022-12-13 01:44:10,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:10,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:44:10,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:10,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:44:10,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:44:10,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:44:10,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 73 transitions, 715 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:10,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:10,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:44:10,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:11,088 INFO L130 PetriNetUnfolder]: 646/1306 cut-off events. [2022-12-13 01:44:11,089 INFO L131 PetriNetUnfolder]: For 7946/7946 co-relation queries the response was YES. [2022-12-13 01:44:11,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6422 conditions, 1306 events. 646/1306 cut-off events. For 7946/7946 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7315 event pairs, 288 based on Foata normal form. 2/1308 useless extension candidates. Maximal degree in co-relation 6368. Up to 1133 conditions per place. [2022-12-13 01:44:11,096 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 71 selfloop transitions, 7 changer transitions 34/112 dead transitions. [2022-12-13 01:44:11,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 112 transitions, 1187 flow [2022-12-13 01:44:11,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:44:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:44:11,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-12-13 01:44:11,097 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2088888888888889 [2022-12-13 01:44:11,097 INFO L175 Difference]: Start difference. First operand has 100 places, 73 transitions, 715 flow. Second operand 10 states and 94 transitions. [2022-12-13 01:44:11,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 112 transitions, 1187 flow [2022-12-13 01:44:11,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 112 transitions, 1153 flow, removed 5 selfloop flow, removed 9 redundant places. [2022-12-13 01:44:11,110 INFO L231 Difference]: Finished difference. Result has 104 places, 70 transitions, 673 flow [2022-12-13 01:44:11,111 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=673, PETRI_PLACES=104, PETRI_TRANSITIONS=70} [2022-12-13 01:44:11,111 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places. [2022-12-13 01:44:11,111 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:11,111 INFO L89 Accepts]: Start accepts. Operand has 104 places, 70 transitions, 673 flow [2022-12-13 01:44:11,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:11,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:11,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 70 transitions, 673 flow [2022-12-13 01:44:11,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 70 transitions, 673 flow [2022-12-13 01:44:11,137 INFO L130 PetriNetUnfolder]: 53/297 cut-off events. [2022-12-13 01:44:11,137 INFO L131 PetriNetUnfolder]: For 1333/1347 co-relation queries the response was YES. [2022-12-13 01:44:11,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1225 conditions, 297 events. 53/297 cut-off events. For 1333/1347 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2052 event pairs, 1 based on Foata normal form. 3/284 useless extension candidates. Maximal degree in co-relation 1178. Up to 52 conditions per place. [2022-12-13 01:44:11,140 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 70 transitions, 673 flow [2022-12-13 01:44:11,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-13 01:44:13,109 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:13,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1999 [2022-12-13 01:44:13,110 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 69 transitions, 665 flow [2022-12-13 01:44:13,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:13,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:13,110 INFO L214 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] [2022-12-13 01:44:13,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-13 01:44:13,110 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:13,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:13,110 INFO L85 PathProgramCache]: Analyzing trace with hash 629749954, now seen corresponding path program 1 times [2022-12-13 01:44:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:13,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203176367] [2022-12-13 01:44:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:13,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:13,737 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-13 01:44:13,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:13,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203176367] [2022-12-13 01:44:13,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203176367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:13,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:13,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:44:13,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729345983] [2022-12-13 01:44:13,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:13,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:44:13,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:13,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:44:13,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:44:13,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:44:13,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 69 transitions, 665 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:13,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:13,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:44:13,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:14,343 INFO L130 PetriNetUnfolder]: 1233/2422 cut-off events. [2022-12-13 01:44:14,343 INFO L131 PetriNetUnfolder]: For 14561/14561 co-relation queries the response was YES. [2022-12-13 01:44:14,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11901 conditions, 2422 events. 1233/2422 cut-off events. For 14561/14561 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15467 event pairs, 451 based on Foata normal form. 3/2425 useless extension candidates. Maximal degree in co-relation 11834. Up to 1133 conditions per place. [2022-12-13 01:44:14,356 INFO L137 encePairwiseOnDemand]: 30/45 looper letters, 145 selfloop transitions, 25 changer transitions 26/196 dead transitions. [2022-12-13 01:44:14,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 196 transitions, 2030 flow [2022-12-13 01:44:14,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:44:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:44:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2022-12-13 01:44:14,357 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2022-12-13 01:44:14,357 INFO L175 Difference]: Start difference. First operand has 93 places, 69 transitions, 665 flow. Second operand 10 states and 168 transitions. [2022-12-13 01:44:14,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 196 transitions, 2030 flow [2022-12-13 01:44:14,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 196 transitions, 1922 flow, removed 34 selfloop flow, removed 11 redundant places. [2022-12-13 01:44:14,376 INFO L231 Difference]: Finished difference. Result has 97 places, 88 transitions, 899 flow [2022-12-13 01:44:14,376 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=899, PETRI_PLACES=97, PETRI_TRANSITIONS=88} [2022-12-13 01:44:14,376 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 56 predicate places. [2022-12-13 01:44:14,376 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:14,376 INFO L89 Accepts]: Start accepts. Operand has 97 places, 88 transitions, 899 flow [2022-12-13 01:44:14,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:14,378 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:14,378 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 88 transitions, 899 flow [2022-12-13 01:44:14,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 88 transitions, 899 flow [2022-12-13 01:44:14,415 INFO L130 PetriNetUnfolder]: 109/591 cut-off events. [2022-12-13 01:44:14,416 INFO L131 PetriNetUnfolder]: For 2732/2766 co-relation queries the response was YES. [2022-12-13 01:44:14,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2467 conditions, 591 events. 109/591 cut-off events. For 2732/2766 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4935 event pairs, 12 based on Foata normal form. 11/571 useless extension candidates. Maximal degree in co-relation 2414. Up to 103 conditions per place. [2022-12-13 01:44:14,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 88 transitions, 899 flow [2022-12-13 01:44:14,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-13 01:44:14,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (not (= (ite (= (mod v_~e2~0_229 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (or (<= v_~n1~0_313 v_~n2~0_285) (= v_~n2~0_285 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= v_~i~0_491 (select (select |v_#memory_int_367| v_~f~0.base_290) (+ v_~f~0.offset_297 (* v_~i1~0_227 4)))) (= v_~i1~0_227 v_~i~0_492)) InVars {~n2~0=v_~n2~0_285, ~i~0=v_~i~0_492, ~f~0.base=v_~f~0.base_290, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229} OutVars{~n2~0=v_~n2~0_285, ~i~0=v_~i~0_491, ~f~0.base=v_~f~0.base_290, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~i1~0=v_~i1~0_227, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_144|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:44:14,638 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (not (= (ite (= (mod v_~e2~0_229 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (or (<= v_~n1~0_313 v_~n2~0_285) (= v_~n2~0_285 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= v_~i~0_491 (select (select |v_#memory_int_367| v_~f~0.base_290) (+ v_~f~0.offset_297 (* v_~i1~0_227 4)))) (= v_~i1~0_227 v_~i~0_492)) InVars {~n2~0=v_~n2~0_285, ~i~0=v_~i~0_492, ~f~0.base=v_~f~0.base_290, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229} OutVars{~n2~0=v_~n2~0_285, ~i~0=v_~i~0_491, ~f~0.base=v_~f~0.base_290, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~i1~0=v_~i1~0_227, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_144|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 01:44:14,778 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] L53-->L97: Formula: (and (= v_~e2~0_167 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|) (= (+ v_~tmp1~0_123 1) v_~n1~0_225) (= v_~e1~0_133 0) (= (+ v_~tmp2~0_121 1) v_~n2~0_206) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| (ite (= (mod v_~e1~0_133 256) 0) 1 0))) InVars {~tmp2~0=v_~tmp2~0_121, ~tmp1~0=v_~tmp1~0_123} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|, ~n2~0=v_~n2~0_206, ~n1~0=v_~n1~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77|, ~tmp2~0=v_~tmp2~0_121, ~e2~0=v_~e2~0_167, ~tmp1~0=v_~tmp1~0_123, ~e1~0=v_~e1~0_133} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0, ~e1~0] and [832] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_357| (ite (and (< v_~i~0_1162 v_~n~0_412) (<= 0 v_~i~0_1162)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_357| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_357|) (= v_~n1~0_685 0) (not (= (ite (or (<= v_~n1~0_686 v_~n2~0_740) (= v_~n2~0_740 0)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_357| 0)) (= v_~i1~0_432 v_~i~0_1163) (= |v_thread1Thread1of1ForFork1_#res#1.offset_54| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_54| 0) (= (select (select |v_#memory_int_738| v_~f~0.base_636) (+ (* v_~i1~0_432 4) v_~f~0.offset_642)) v_~i~0_1162) (not (= (ite (= (mod v_~e2~0_600 256) 0) 1 0) 0))) InVars {~n2~0=v_~n2~0_740, ~i~0=v_~i~0_1163, ~f~0.base=v_~f~0.base_636, ~n1~0=v_~n1~0_686, #memory_int=|v_#memory_int_738|, ~n~0=v_~n~0_412, ~f~0.offset=v_~f~0.offset_642, ~e2~0=v_~e2~0_600} OutVars{~n2~0=v_~n2~0_740, ~i~0=v_~i~0_1162, ~n1~0=v_~n1~0_685, ~f~0.base=v_~f~0.base_636, ~i1~0=v_~i1~0_432, ~f~0.offset=v_~f~0.offset_642, ~e2~0=v_~e2~0_600, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_357|, #memory_int=|v_#memory_int_738|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_54|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_54|, ~n~0=v_~n~0_412, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_343|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_357|} AuxVars[] AssignedVars[~i~0, ~n1~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:44:14,899 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:44:14,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 523 [2022-12-13 01:44:14,899 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 87 transitions, 949 flow [2022-12-13 01:44:14,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:14,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:14,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:14,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-13 01:44:14,900 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash -834626142, now seen corresponding path program 1 times [2022-12-13 01:44:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:14,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055001146] [2022-12-13 01:44:14,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:14,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:15,466 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-13 01:44:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:15,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055001146] [2022-12-13 01:44:15,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055001146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:15,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:15,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125830399] [2022-12-13 01:44:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:15,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:15,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:15,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:15,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:15,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:44:15,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 949 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:15,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:15,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:44:15,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:15,894 INFO L130 PetriNetUnfolder]: 1322/2633 cut-off events. [2022-12-13 01:44:15,894 INFO L131 PetriNetUnfolder]: For 18040/18040 co-relation queries the response was YES. [2022-12-13 01:44:15,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13195 conditions, 2633 events. 1322/2633 cut-off events. For 18040/18040 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17596 event pairs, 443 based on Foata normal form. 3/2636 useless extension candidates. Maximal degree in co-relation 13121. Up to 1133 conditions per place. [2022-12-13 01:44:15,907 INFO L137 encePairwiseOnDemand]: 33/50 looper letters, 168 selfloop transitions, 28 changer transitions 11/207 dead transitions. [2022-12-13 01:44:15,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 207 transitions, 2236 flow [2022-12-13 01:44:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:44:15,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:44:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2022-12-13 01:44:15,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-13 01:44:15,909 INFO L175 Difference]: Start difference. First operand has 95 places, 87 transitions, 949 flow. Second operand 10 states and 175 transitions. [2022-12-13 01:44:15,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 207 transitions, 2236 flow [2022-12-13 01:44:15,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 207 transitions, 2182 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-13 01:44:15,931 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 1083 flow [2022-12-13 01:44:15,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1083, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2022-12-13 01:44:15,931 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 01:44:15,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:15,931 INFO L89 Accepts]: Start accepts. Operand has 106 places, 93 transitions, 1083 flow [2022-12-13 01:44:15,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:15,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:15,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 93 transitions, 1083 flow [2022-12-13 01:44:15,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 93 transitions, 1083 flow [2022-12-13 01:44:16,021 INFO L130 PetriNetUnfolder]: 114/647 cut-off events. [2022-12-13 01:44:16,021 INFO L131 PetriNetUnfolder]: For 3907/3950 co-relation queries the response was YES. [2022-12-13 01:44:16,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2789 conditions, 647 events. 114/647 cut-off events. For 3907/3950 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5641 event pairs, 10 based on Foata normal form. 13/625 useless extension candidates. Maximal degree in co-relation 2727. Up to 115 conditions per place. [2022-12-13 01:44:16,025 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 93 transitions, 1083 flow [2022-12-13 01:44:16,025 INFO L226 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-13 01:44:16,035 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:16,035 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 01:44:16,035 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 1083 flow [2022-12-13 01:44:16,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:16,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:16,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:16,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-13 01:44:16,036 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:16,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:16,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2019851560, now seen corresponding path program 1 times [2022-12-13 01:44:16,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:16,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398619577] [2022-12-13 01:44:16,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:16,175 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-13 01:44:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:16,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398619577] [2022-12-13 01:44:16,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398619577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:16,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:16,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675203614] [2022-12-13 01:44:16,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:16,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:16,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:16,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:16,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:44:16,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 93 transitions, 1083 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:16,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:16,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:44:16,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:16,613 INFO L130 PetriNetUnfolder]: 1419/2887 cut-off events. [2022-12-13 01:44:16,613 INFO L131 PetriNetUnfolder]: For 22004/22004 co-relation queries the response was YES. [2022-12-13 01:44:16,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14709 conditions, 2887 events. 1419/2887 cut-off events. For 22004/22004 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 20019 event pairs, 416 based on Foata normal form. 6/2893 useless extension candidates. Maximal degree in co-relation 14632. Up to 1589 conditions per place. [2022-12-13 01:44:16,626 INFO L137 encePairwiseOnDemand]: 35/50 looper letters, 98 selfloop transitions, 23 changer transitions 26/147 dead transitions. [2022-12-13 01:44:16,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 147 transitions, 1756 flow [2022-12-13 01:44:16,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2022-12-13 01:44:16,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28 [2022-12-13 01:44:16,627 INFO L175 Difference]: Start difference. First operand has 105 places, 93 transitions, 1083 flow. Second operand 8 states and 112 transitions. [2022-12-13 01:44:16,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 147 transitions, 1756 flow [2022-12-13 01:44:16,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 147 transitions, 1704 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-13 01:44:16,662 INFO L231 Difference]: Finished difference. Result has 109 places, 93 transitions, 1089 flow [2022-12-13 01:44:16,662 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1089, PETRI_PLACES=109, PETRI_TRANSITIONS=93} [2022-12-13 01:44:16,663 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2022-12-13 01:44:16,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:16,663 INFO L89 Accepts]: Start accepts. Operand has 109 places, 93 transitions, 1089 flow [2022-12-13 01:44:16,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:16,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:16,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 93 transitions, 1089 flow [2022-12-13 01:44:16,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 93 transitions, 1089 flow [2022-12-13 01:44:16,707 INFO L130 PetriNetUnfolder]: 103/690 cut-off events. [2022-12-13 01:44:16,707 INFO L131 PetriNetUnfolder]: For 4377/4418 co-relation queries the response was YES. [2022-12-13 01:44:16,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 690 events. 103/690 cut-off events. For 4377/4418 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6312 event pairs, 14 based on Foata normal form. 11/666 useless extension candidates. Maximal degree in co-relation 2878. Up to 118 conditions per place. [2022-12-13 01:44:16,711 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 93 transitions, 1089 flow [2022-12-13 01:44:16,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 01:44:16,713 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:44:16,749 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:16,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 01:44:16,749 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 92 transitions, 1085 flow [2022-12-13 01:44:16,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:16,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:16,749 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:16,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-13 01:44:16,749 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:16,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1957967848, now seen corresponding path program 2 times [2022-12-13 01:44:16,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:16,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883910097] [2022-12-13 01:44:16,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:16,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:17,212 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-13 01:44:17,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:17,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883910097] [2022-12-13 01:44:17,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883910097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:17,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:17,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:17,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202265344] [2022-12-13 01:44:17,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:17,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:17,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:17,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:17,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:17,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:44:17,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 92 transitions, 1085 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:17,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:17,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:44:17,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:17,781 INFO L130 PetriNetUnfolder]: 1248/2613 cut-off events. [2022-12-13 01:44:17,781 INFO L131 PetriNetUnfolder]: For 20563/20563 co-relation queries the response was YES. [2022-12-13 01:44:17,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13299 conditions, 2613 events. 1248/2613 cut-off events. For 20563/20563 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 18461 event pairs, 406 based on Foata normal form. 9/2622 useless extension candidates. Maximal degree in co-relation 13230. Up to 1097 conditions per place. [2022-12-13 01:44:17,792 INFO L137 encePairwiseOnDemand]: 33/51 looper letters, 140 selfloop transitions, 21 changer transitions 48/209 dead transitions. [2022-12-13 01:44:17,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 209 transitions, 2405 flow [2022-12-13 01:44:17,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:44:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:44:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2022-12-13 01:44:17,792 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38344226579520696 [2022-12-13 01:44:17,793 INFO L175 Difference]: Start difference. First operand has 106 places, 92 transitions, 1085 flow. Second operand 9 states and 176 transitions. [2022-12-13 01:44:17,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 209 transitions, 2405 flow [2022-12-13 01:44:17,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 209 transitions, 2311 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-13 01:44:17,822 INFO L231 Difference]: Finished difference. Result has 112 places, 84 transitions, 993 flow [2022-12-13 01:44:17,822 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=993, PETRI_PLACES=112, PETRI_TRANSITIONS=84} [2022-12-13 01:44:17,822 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2022-12-13 01:44:17,822 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:17,822 INFO L89 Accepts]: Start accepts. Operand has 112 places, 84 transitions, 993 flow [2022-12-13 01:44:17,823 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:17,823 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:17,823 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 84 transitions, 993 flow [2022-12-13 01:44:17,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 84 transitions, 993 flow [2022-12-13 01:44:17,857 INFO L130 PetriNetUnfolder]: 80/537 cut-off events. [2022-12-13 01:44:17,857 INFO L131 PetriNetUnfolder]: For 3509/3542 co-relation queries the response was YES. [2022-12-13 01:44:17,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 537 events. 80/537 cut-off events. For 3509/3542 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4528 event pairs, 4 based on Foata normal form. 7/520 useless extension candidates. Maximal degree in co-relation 2284. Up to 109 conditions per place. [2022-12-13 01:44:17,861 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 84 transitions, 993 flow [2022-12-13 01:44:17,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-13 01:44:17,991 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:17,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 01:44:17,992 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 83 transitions, 1011 flow [2022-12-13 01:44:17,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:17,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:17,992 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:17,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-13 01:44:17,992 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash 796642303, now seen corresponding path program 1 times [2022-12-13 01:44:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:17,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159884107] [2022-12-13 01:44:17,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:17,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:18,407 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-13 01:44:18,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:18,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159884107] [2022-12-13 01:44:18,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159884107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:18,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:18,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:44:18,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302819917] [2022-12-13 01:44:18,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:18,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:18,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:18,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:18,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:44:18,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:44:18,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 83 transitions, 1011 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:18,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:18,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:44:18,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:18,843 INFO L130 PetriNetUnfolder]: 1024/2122 cut-off events. [2022-12-13 01:44:18,843 INFO L131 PetriNetUnfolder]: For 19598/19598 co-relation queries the response was YES. [2022-12-13 01:44:18,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11079 conditions, 2122 events. 1024/2122 cut-off events. For 19598/19598 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14022 event pairs, 368 based on Foata normal form. 3/2125 useless extension candidates. Maximal degree in co-relation 10997. Up to 1097 conditions per place. [2022-12-13 01:44:18,859 INFO L137 encePairwiseOnDemand]: 38/53 looper letters, 131 selfloop transitions, 14 changer transitions 35/180 dead transitions. [2022-12-13 01:44:18,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 180 transitions, 2099 flow [2022-12-13 01:44:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2022-12-13 01:44:18,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36556603773584906 [2022-12-13 01:44:18,860 INFO L175 Difference]: Start difference. First operand has 107 places, 83 transitions, 1011 flow. Second operand 8 states and 155 transitions. [2022-12-13 01:44:18,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 180 transitions, 2099 flow [2022-12-13 01:44:18,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 180 transitions, 1936 flow, removed 41 selfloop flow, removed 17 redundant places. [2022-12-13 01:44:18,903 INFO L231 Difference]: Finished difference. Result has 99 places, 77 transitions, 773 flow [2022-12-13 01:44:18,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=773, PETRI_PLACES=99, PETRI_TRANSITIONS=77} [2022-12-13 01:44:18,903 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-12-13 01:44:18,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:18,903 INFO L89 Accepts]: Start accepts. Operand has 99 places, 77 transitions, 773 flow [2022-12-13 01:44:18,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:18,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:18,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 77 transitions, 773 flow [2022-12-13 01:44:18,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 77 transitions, 773 flow [2022-12-13 01:44:18,940 INFO L130 PetriNetUnfolder]: 72/492 cut-off events. [2022-12-13 01:44:18,940 INFO L131 PetriNetUnfolder]: For 2259/2286 co-relation queries the response was YES. [2022-12-13 01:44:18,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1898 conditions, 492 events. 72/492 cut-off events. For 2259/2286 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4030 event pairs, 5 based on Foata normal form. 4/474 useless extension candidates. Maximal degree in co-relation 1846. Up to 105 conditions per place. [2022-12-13 01:44:18,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 77 transitions, 773 flow [2022-12-13 01:44:18,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-13 01:44:18,968 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:18,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 01:44:18,968 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 773 flow [2022-12-13 01:44:18,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:18,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:18,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:18,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-13 01:44:18,969 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:18,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:18,969 INFO L85 PathProgramCache]: Analyzing trace with hash -523099082, now seen corresponding path program 2 times [2022-12-13 01:44:18,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:18,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112858157] [2022-12-13 01:44:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:18,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:19,450 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-13 01:44:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:19,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112858157] [2022-12-13 01:44:19,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112858157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:19,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:19,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:19,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031293353] [2022-12-13 01:44:19,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:19,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:19,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:19,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:44:19,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 773 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:19,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:19,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:44:19,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:19,921 INFO L130 PetriNetUnfolder]: 1036/2139 cut-off events. [2022-12-13 01:44:19,921 INFO L131 PetriNetUnfolder]: For 13737/13737 co-relation queries the response was YES. [2022-12-13 01:44:19,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10232 conditions, 2139 events. 1036/2139 cut-off events. For 13737/13737 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14038 event pairs, 348 based on Foata normal form. 2/2141 useless extension candidates. Maximal degree in co-relation 10162. Up to 1097 conditions per place. [2022-12-13 01:44:19,931 INFO L137 encePairwiseOnDemand]: 35/48 looper letters, 164 selfloop transitions, 20 changer transitions 11/195 dead transitions. [2022-12-13 01:44:19,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 195 transitions, 2006 flow [2022-12-13 01:44:19,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:44:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:44:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2022-12-13 01:44:19,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-13 01:44:19,932 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 773 flow. Second operand 10 states and 170 transitions. [2022-12-13 01:44:19,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 195 transitions, 2006 flow [2022-12-13 01:44:19,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 195 transitions, 1962 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-12-13 01:44:19,946 INFO L231 Difference]: Finished difference. Result has 102 places, 84 transitions, 898 flow [2022-12-13 01:44:19,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=898, PETRI_PLACES=102, PETRI_TRANSITIONS=84} [2022-12-13 01:44:19,947 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2022-12-13 01:44:19,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:19,947 INFO L89 Accepts]: Start accepts. Operand has 102 places, 84 transitions, 898 flow [2022-12-13 01:44:19,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:19,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:19,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 84 transitions, 898 flow [2022-12-13 01:44:19,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 84 transitions, 898 flow [2022-12-13 01:44:19,980 INFO L130 PetriNetUnfolder]: 76/526 cut-off events. [2022-12-13 01:44:19,980 INFO L131 PetriNetUnfolder]: For 2775/2812 co-relation queries the response was YES. [2022-12-13 01:44:19,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 526 events. 76/526 cut-off events. For 2775/2812 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4434 event pairs, 1 based on Foata normal form. 5/504 useless extension candidates. Maximal degree in co-relation 2045. Up to 114 conditions per place. [2022-12-13 01:44:19,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 84 transitions, 898 flow [2022-12-13 01:44:19,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-13 01:44:20,124 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:20,124 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-13 01:44:20,124 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 83 transitions, 914 flow [2022-12-13 01:44:20,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:20,124 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:20,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:20,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-13 01:44:20,125 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:20,125 INFO L85 PathProgramCache]: Analyzing trace with hash 726119420, now seen corresponding path program 1 times [2022-12-13 01:44:20,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:20,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664192022] [2022-12-13 01:44:20,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:20,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:20,896 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-13 01:44:20,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:20,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664192022] [2022-12-13 01:44:20,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664192022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:20,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:20,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:20,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890973671] [2022-12-13 01:44:20,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:20,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:20,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:20,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:20,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:20,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:44:20,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 83 transitions, 914 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:20,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:20,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:44:20,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:21,440 INFO L130 PetriNetUnfolder]: 1038/2143 cut-off events. [2022-12-13 01:44:21,440 INFO L131 PetriNetUnfolder]: For 16697/16697 co-relation queries the response was YES. [2022-12-13 01:44:21,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10729 conditions, 2143 events. 1038/2143 cut-off events. For 16697/16697 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14110 event pairs, 328 based on Foata normal form. 4/2147 useless extension candidates. Maximal degree in co-relation 10663. Up to 1097 conditions per place. [2022-12-13 01:44:21,452 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 143 selfloop transitions, 16 changer transitions 23/182 dead transitions. [2022-12-13 01:44:21,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 182 transitions, 2037 flow [2022-12-13 01:44:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:21,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2022-12-13 01:44:21,453 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38480392156862747 [2022-12-13 01:44:21,453 INFO L175 Difference]: Start difference. First operand has 100 places, 83 transitions, 914 flow. Second operand 8 states and 157 transitions. [2022-12-13 01:44:21,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 182 transitions, 2037 flow [2022-12-13 01:44:21,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 182 transitions, 1970 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-13 01:44:21,478 INFO L231 Difference]: Finished difference. Result has 103 places, 80 transitions, 840 flow [2022-12-13 01:44:21,478 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=840, PETRI_PLACES=103, PETRI_TRANSITIONS=80} [2022-12-13 01:44:21,478 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2022-12-13 01:44:21,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:21,478 INFO L89 Accepts]: Start accepts. Operand has 103 places, 80 transitions, 840 flow [2022-12-13 01:44:21,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:21,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:21,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 80 transitions, 840 flow [2022-12-13 01:44:21,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 80 transitions, 840 flow [2022-12-13 01:44:21,510 INFO L130 PetriNetUnfolder]: 73/510 cut-off events. [2022-12-13 01:44:21,510 INFO L131 PetriNetUnfolder]: For 2785/2812 co-relation queries the response was YES. [2022-12-13 01:44:21,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2019 conditions, 510 events. 73/510 cut-off events. For 2785/2812 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4277 event pairs, 6 based on Foata normal form. 5/490 useless extension candidates. Maximal degree in co-relation 1965. Up to 106 conditions per place. [2022-12-13 01:44:21,514 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 80 transitions, 840 flow [2022-12-13 01:44:21,514 INFO L226 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-13 01:44:21,517 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:21,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 01:44:21,517 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 840 flow [2022-12-13 01:44:21,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:21,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:21,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:21,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-13 01:44:21,518 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:21,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:21,518 INFO L85 PathProgramCache]: Analyzing trace with hash 381110787, now seen corresponding path program 1 times [2022-12-13 01:44:21,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:21,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65595550] [2022-12-13 01:44:21,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:21,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:21,990 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-13 01:44:21,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:21,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65595550] [2022-12-13 01:44:21,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65595550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:21,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:21,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573010774] [2022-12-13 01:44:21,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:21,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:21,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:21,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:21,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:21,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:44:21,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 840 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:21,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:21,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:44:21,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:22,451 INFO L130 PetriNetUnfolder]: 998/2085 cut-off events. [2022-12-13 01:44:22,451 INFO L131 PetriNetUnfolder]: For 15567/15567 co-relation queries the response was YES. [2022-12-13 01:44:22,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10277 conditions, 2085 events. 998/2085 cut-off events. For 15567/15567 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13599 event pairs, 314 based on Foata normal form. 2/2087 useless extension candidates. Maximal degree in co-relation 10205. Up to 1097 conditions per place. [2022-12-13 01:44:22,462 INFO L137 encePairwiseOnDemand]: 35/48 looper letters, 162 selfloop transitions, 21 changer transitions 11/194 dead transitions. [2022-12-13 01:44:22,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 194 transitions, 2055 flow [2022-12-13 01:44:22,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:44:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:44:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2022-12-13 01:44:22,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-13 01:44:22,464 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 840 flow. Second operand 10 states and 170 transitions. [2022-12-13 01:44:22,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 194 transitions, 2055 flow [2022-12-13 01:44:22,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 194 transitions, 2001 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-13 01:44:22,482 INFO L231 Difference]: Finished difference. Result has 105 places, 85 transitions, 941 flow [2022-12-13 01:44:22,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=941, PETRI_PLACES=105, PETRI_TRANSITIONS=85} [2022-12-13 01:44:22,482 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2022-12-13 01:44:22,482 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:22,482 INFO L89 Accepts]: Start accepts. Operand has 105 places, 85 transitions, 941 flow [2022-12-13 01:44:22,483 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:22,483 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:22,483 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 85 transitions, 941 flow [2022-12-13 01:44:22,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 85 transitions, 941 flow [2022-12-13 01:44:22,515 INFO L130 PetriNetUnfolder]: 69/514 cut-off events. [2022-12-13 01:44:22,515 INFO L131 PetriNetUnfolder]: For 2963/2990 co-relation queries the response was YES. [2022-12-13 01:44:22,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2071 conditions, 514 events. 69/514 cut-off events. For 2963/2990 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4316 event pairs, 1 based on Foata normal form. 5/494 useless extension candidates. Maximal degree in co-relation 2012. Up to 106 conditions per place. [2022-12-13 01:44:22,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 85 transitions, 941 flow [2022-12-13 01:44:22,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-13 01:44:22,632 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:22,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 01:44:22,633 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 84 transitions, 961 flow [2022-12-13 01:44:22,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:22,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:22,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:22,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-13 01:44:22,633 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:22,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:22,633 INFO L85 PathProgramCache]: Analyzing trace with hash 244575070, now seen corresponding path program 3 times [2022-12-13 01:44:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:22,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169938251] [2022-12-13 01:44:22,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:22,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:23,304 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-13 01:44:23,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:23,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169938251] [2022-12-13 01:44:23,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169938251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:23,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:23,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:23,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137899739] [2022-12-13 01:44:23,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:23,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:23,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:23,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:23,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:23,305 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:44:23,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 84 transitions, 961 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:23,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:23,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:44:23,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:23,856 INFO L130 PetriNetUnfolder]: 998/2093 cut-off events. [2022-12-13 01:44:23,856 INFO L131 PetriNetUnfolder]: For 17474/17474 co-relation queries the response was YES. [2022-12-13 01:44:23,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10544 conditions, 2093 events. 998/2093 cut-off events. For 17474/17474 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13856 event pairs, 414 based on Foata normal form. 2/2095 useless extension candidates. Maximal degree in co-relation 10471. Up to 1097 conditions per place. [2022-12-13 01:44:23,866 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 134 selfloop transitions, 12 changer transitions 38/184 dead transitions. [2022-12-13 01:44:23,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 184 transitions, 2081 flow [2022-12-13 01:44:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:44:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:44:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2022-12-13 01:44:23,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3420479302832244 [2022-12-13 01:44:23,867 INFO L175 Difference]: Start difference. First operand has 103 places, 84 transitions, 961 flow. Second operand 9 states and 157 transitions. [2022-12-13 01:44:23,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 184 transitions, 2081 flow [2022-12-13 01:44:23,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 184 transitions, 2018 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-12-13 01:44:23,890 INFO L231 Difference]: Finished difference. Result has 107 places, 81 transitions, 883 flow [2022-12-13 01:44:23,890 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=883, PETRI_PLACES=107, PETRI_TRANSITIONS=81} [2022-12-13 01:44:23,890 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:44:23,890 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:23,890 INFO L89 Accepts]: Start accepts. Operand has 107 places, 81 transitions, 883 flow [2022-12-13 01:44:23,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:23,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:23,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 81 transitions, 883 flow [2022-12-13 01:44:23,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 81 transitions, 883 flow [2022-12-13 01:44:23,920 INFO L130 PetriNetUnfolder]: 69/480 cut-off events. [2022-12-13 01:44:23,920 INFO L131 PetriNetUnfolder]: For 2617/2647 co-relation queries the response was YES. [2022-12-13 01:44:23,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1945 conditions, 480 events. 69/480 cut-off events. For 2617/2647 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3901 event pairs, 2 based on Foata normal form. 6/464 useless extension candidates. Maximal degree in co-relation 1885. Up to 95 conditions per place. [2022-12-13 01:44:23,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 81 transitions, 883 flow [2022-12-13 01:44:23,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-13 01:44:23,924 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:23,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 01:44:23,924 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 81 transitions, 883 flow [2022-12-13 01:44:23,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:23,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:23,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:23,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-13 01:44:23,924 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:23,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1923399369, now seen corresponding path program 1 times [2022-12-13 01:44:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:23,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770181442] [2022-12-13 01:44:23,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:24,686 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-13 01:44:24,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:24,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770181442] [2022-12-13 01:44:24,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770181442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:24,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:24,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:44:24,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629044578] [2022-12-13 01:44:24,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:24,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:24,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:24,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:24,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:44:24,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:44:24,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 81 transitions, 883 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:24,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:24,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:44:24,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:25,139 INFO L130 PetriNetUnfolder]: 909/1870 cut-off events. [2022-12-13 01:44:25,139 INFO L131 PetriNetUnfolder]: For 13620/13620 co-relation queries the response was YES. [2022-12-13 01:44:25,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9330 conditions, 1870 events. 909/1870 cut-off events. For 13620/13620 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11794 event pairs, 305 based on Foata normal form. 2/1872 useless extension candidates. Maximal degree in co-relation 9262. Up to 1097 conditions per place. [2022-12-13 01:44:25,150 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 141 selfloop transitions, 17 changer transitions 15/173 dead transitions. [2022-12-13 01:44:25,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 173 transitions, 1910 flow [2022-12-13 01:44:25,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2022-12-13 01:44:25,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 01:44:25,151 INFO L175 Difference]: Start difference. First operand has 101 places, 81 transitions, 883 flow. Second operand 8 states and 150 transitions. [2022-12-13 01:44:25,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 173 transitions, 1910 flow [2022-12-13 01:44:25,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 173 transitions, 1812 flow, removed 37 selfloop flow, removed 8 redundant places. [2022-12-13 01:44:25,172 INFO L231 Difference]: Finished difference. Result has 101 places, 80 transitions, 832 flow [2022-12-13 01:44:25,172 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=832, PETRI_PLACES=101, PETRI_TRANSITIONS=80} [2022-12-13 01:44:25,172 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2022-12-13 01:44:25,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:25,172 INFO L89 Accepts]: Start accepts. Operand has 101 places, 80 transitions, 832 flow [2022-12-13 01:44:25,181 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:25,181 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:25,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 80 transitions, 832 flow [2022-12-13 01:44:25,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 80 transitions, 832 flow [2022-12-13 01:44:25,211 INFO L130 PetriNetUnfolder]: 69/474 cut-off events. [2022-12-13 01:44:25,211 INFO L131 PetriNetUnfolder]: For 2217/2247 co-relation queries the response was YES. [2022-12-13 01:44:25,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 474 events. 69/474 cut-off events. For 2217/2247 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3821 event pairs, 2 based on Foata normal form. 6/458 useless extension candidates. Maximal degree in co-relation 1802. Up to 95 conditions per place. [2022-12-13 01:44:25,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 80 transitions, 832 flow [2022-12-13 01:44:25,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-13 01:44:25,217 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:25,217 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 01:44:25,217 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 832 flow [2022-12-13 01:44:25,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:25,217 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:25,217 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:25,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-13 01:44:25,217 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:25,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:25,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1239083037, now seen corresponding path program 2 times [2022-12-13 01:44:25,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:25,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832608648] [2022-12-13 01:44:25,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:25,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:25,691 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-13 01:44:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:25,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832608648] [2022-12-13 01:44:25,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832608648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:25,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:25,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:44:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579114299] [2022-12-13 01:44:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:25,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:25,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:25,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:44:25,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:44:25,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 832 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:25,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:25,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:44:25,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:26,135 INFO L130 PetriNetUnfolder]: 889/1850 cut-off events. [2022-12-13 01:44:26,135 INFO L131 PetriNetUnfolder]: For 11845/11845 co-relation queries the response was YES. [2022-12-13 01:44:26,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8958 conditions, 1850 events. 889/1850 cut-off events. For 11845/11845 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11775 event pairs, 303 based on Foata normal form. 2/1852 useless extension candidates. Maximal degree in co-relation 8893. Up to 1097 conditions per place. [2022-12-13 01:44:26,146 INFO L137 encePairwiseOnDemand]: 39/50 looper letters, 136 selfloop transitions, 13 changer transitions 23/172 dead transitions. [2022-12-13 01:44:26,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 172 transitions, 1841 flow [2022-12-13 01:44:26,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:26,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2022-12-13 01:44:26,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 01:44:26,147 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 832 flow. Second operand 8 states and 150 transitions. [2022-12-13 01:44:26,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 172 transitions, 1841 flow [2022-12-13 01:44:26,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 172 transitions, 1803 flow, removed 2 selfloop flow, removed 7 redundant places. [2022-12-13 01:44:26,165 INFO L231 Difference]: Finished difference. Result has 101 places, 76 transitions, 764 flow [2022-12-13 01:44:26,165 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=764, PETRI_PLACES=101, PETRI_TRANSITIONS=76} [2022-12-13 01:44:26,165 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2022-12-13 01:44:26,165 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:26,165 INFO L89 Accepts]: Start accepts. Operand has 101 places, 76 transitions, 764 flow [2022-12-13 01:44:26,165 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:26,166 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:26,166 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 76 transitions, 764 flow [2022-12-13 01:44:26,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 76 transitions, 764 flow [2022-12-13 01:44:26,197 INFO L130 PetriNetUnfolder]: 65/445 cut-off events. [2022-12-13 01:44:26,197 INFO L131 PetriNetUnfolder]: For 2066/2083 co-relation queries the response was YES. [2022-12-13 01:44:26,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 445 events. 65/445 cut-off events. For 2066/2083 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3523 event pairs, 2 based on Foata normal form. 5/431 useless extension candidates. Maximal degree in co-relation 1681. Up to 87 conditions per place. [2022-12-13 01:44:26,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 76 transitions, 764 flow [2022-12-13 01:44:26,202 INFO L226 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-13 01:44:26,202 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:26,203 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 01:44:26,203 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 76 transitions, 764 flow [2022-12-13 01:44:26,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:26,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:26,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:26,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-13 01:44:26,203 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:26,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash -613128697, now seen corresponding path program 2 times [2022-12-13 01:44:26,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:26,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758452827] [2022-12-13 01:44:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:26,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:26,739 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-13 01:44:26,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:26,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758452827] [2022-12-13 01:44:26,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758452827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:26,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:26,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:26,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046279835] [2022-12-13 01:44:26,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:26,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:26,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:26,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:26,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:26,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:44:26,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 76 transitions, 764 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:26,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:26,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:44:26,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:27,085 INFO L130 PetriNetUnfolder]: 865/1806 cut-off events. [2022-12-13 01:44:27,086 INFO L131 PetriNetUnfolder]: For 11146/11146 co-relation queries the response was YES. [2022-12-13 01:44:27,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8622 conditions, 1806 events. 865/1806 cut-off events. For 11146/11146 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11456 event pairs, 301 based on Foata normal form. 2/1808 useless extension candidates. Maximal degree in co-relation 8556. Up to 1097 conditions per place. [2022-12-13 01:44:27,094 INFO L137 encePairwiseOnDemand]: 36/47 looper letters, 126 selfloop transitions, 11 changer transitions 38/175 dead transitions. [2022-12-13 01:44:27,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 175 transitions, 1843 flow [2022-12-13 01:44:27,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:44:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:44:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2022-12-13 01:44:27,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35933806146572106 [2022-12-13 01:44:27,095 INFO L175 Difference]: Start difference. First operand has 98 places, 76 transitions, 764 flow. Second operand 9 states and 152 transitions. [2022-12-13 01:44:27,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 175 transitions, 1843 flow [2022-12-13 01:44:27,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 175 transitions, 1803 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-12-13 01:44:27,111 INFO L231 Difference]: Finished difference. Result has 101 places, 74 transitions, 723 flow [2022-12-13 01:44:27,111 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=723, PETRI_PLACES=101, PETRI_TRANSITIONS=74} [2022-12-13 01:44:27,111 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2022-12-13 01:44:27,111 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:27,111 INFO L89 Accepts]: Start accepts. Operand has 101 places, 74 transitions, 723 flow [2022-12-13 01:44:27,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:27,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:27,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 74 transitions, 723 flow [2022-12-13 01:44:27,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 74 transitions, 723 flow [2022-12-13 01:44:27,138 INFO L130 PetriNetUnfolder]: 63/426 cut-off events. [2022-12-13 01:44:27,138 INFO L131 PetriNetUnfolder]: For 1979/1995 co-relation queries the response was YES. [2022-12-13 01:44:27,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 426 events. 63/426 cut-off events. For 1979/1995 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3320 event pairs, 1 based on Foata normal form. 4/414 useless extension candidates. Maximal degree in co-relation 1625. Up to 83 conditions per place. [2022-12-13 01:44:27,140 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 74 transitions, 723 flow [2022-12-13 01:44:27,140 INFO L226 LiptonReduction]: Number of co-enabled transitions 434 [2022-12-13 01:44:27,141 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:27,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 01:44:27,141 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 74 transitions, 723 flow [2022-12-13 01:44:27,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:27,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:27,141 INFO L214 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] [2022-12-13 01:44:27,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-13 01:44:27,141 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:27,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash -626200036, now seen corresponding path program 1 times [2022-12-13 01:44:27,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:27,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780359675] [2022-12-13 01:44:27,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:27,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:44:27,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:27,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780359675] [2022-12-13 01:44:27,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780359675] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:44:27,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894600456] [2022-12-13 01:44:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:27,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:44:27,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:44:27,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:44:27,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 01:44:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:27,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 01:44:27,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:44:27,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:44:27,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 01:44:27,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:44:27,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:44:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:44:27,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:44:27,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894600456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:27,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:44:27,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-12-13 01:44:27,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247627203] [2022-12-13 01:44:27,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:27,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:27,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:27,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-13 01:44:27,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:44:27,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 74 transitions, 723 flow. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:27,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:27,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:44:27,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:28,258 INFO L130 PetriNetUnfolder]: 833/1746 cut-off events. [2022-12-13 01:44:28,258 INFO L131 PetriNetUnfolder]: For 10624/10624 co-relation queries the response was YES. [2022-12-13 01:44:28,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8330 conditions, 1746 events. 833/1746 cut-off events. For 10624/10624 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11057 event pairs, 165 based on Foata normal form. 3/1749 useless extension candidates. Maximal degree in co-relation 8264. Up to 1076 conditions per place. [2022-12-13 01:44:28,266 INFO L137 encePairwiseOnDemand]: 34/46 looper letters, 90 selfloop transitions, 22 changer transitions 9/121 dead transitions. [2022-12-13 01:44:28,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 121 transitions, 1271 flow [2022-12-13 01:44:28,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:44:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:44:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-12-13 01:44:28,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3198757763975155 [2022-12-13 01:44:28,267 INFO L175 Difference]: Start difference. First operand has 96 places, 74 transitions, 723 flow. Second operand 7 states and 103 transitions. [2022-12-13 01:44:28,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 121 transitions, 1271 flow [2022-12-13 01:44:28,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 121 transitions, 1213 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-12-13 01:44:28,281 INFO L231 Difference]: Finished difference. Result has 96 places, 77 transitions, 796 flow [2022-12-13 01:44:28,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=796, PETRI_PLACES=96, PETRI_TRANSITIONS=77} [2022-12-13 01:44:28,282 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2022-12-13 01:44:28,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:28,282 INFO L89 Accepts]: Start accepts. Operand has 96 places, 77 transitions, 796 flow [2022-12-13 01:44:28,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:28,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:28,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 77 transitions, 796 flow [2022-12-13 01:44:28,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 77 transitions, 796 flow [2022-12-13 01:44:28,309 INFO L130 PetriNetUnfolder]: 60/436 cut-off events. [2022-12-13 01:44:28,309 INFO L131 PetriNetUnfolder]: For 1885/1901 co-relation queries the response was YES. [2022-12-13 01:44:28,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 436 events. 60/436 cut-off events. For 1885/1901 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3464 event pairs, 1 based on Foata normal form. 4/423 useless extension candidates. Maximal degree in co-relation 1444. Up to 85 conditions per place. [2022-12-13 01:44:28,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 77 transitions, 796 flow [2022-12-13 01:44:28,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-13 01:44:28,312 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:28,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 01:44:28,312 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 796 flow [2022-12-13 01:44:28,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:28,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:28,312 INFO L214 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] [2022-12-13 01:44:28,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 01:44:28,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:44:28,518 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:28,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:28,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1897427623, now seen corresponding path program 1 times [2022-12-13 01:44:28,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:28,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558308741] [2022-12-13 01:44:28,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:28,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:47,757 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-13 01:44:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:47,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558308741] [2022-12-13 01:44:47,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558308741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:47,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:47,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:44:47,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089270263] [2022-12-13 01:44:47,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:47,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:44:47,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:47,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:44:47,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:44:47,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:44:47,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 796 flow. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:47,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:47,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:44:47,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:48,546 INFO L130 PetriNetUnfolder]: 814/1699 cut-off events. [2022-12-13 01:44:48,546 INFO L131 PetriNetUnfolder]: For 10530/10530 co-relation queries the response was YES. [2022-12-13 01:44:48,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8288 conditions, 1699 events. 814/1699 cut-off events. For 10530/10530 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10564 event pairs, 287 based on Foata normal form. 3/1702 useless extension candidates. Maximal degree in co-relation 6860. Up to 1160 conditions per place. [2022-12-13 01:44:48,553 INFO L137 encePairwiseOnDemand]: 31/45 looper letters, 106 selfloop transitions, 12 changer transitions 44/162 dead transitions. [2022-12-13 01:44:48,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 162 transitions, 1710 flow [2022-12-13 01:44:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:44:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:44:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-12-13 01:44:48,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3088888888888889 [2022-12-13 01:44:48,554 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 796 flow. Second operand 10 states and 139 transitions. [2022-12-13 01:44:48,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 162 transitions, 1710 flow [2022-12-13 01:44:48,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 162 transitions, 1642 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-13 01:44:48,566 INFO L231 Difference]: Finished difference. Result has 105 places, 78 transitions, 797 flow [2022-12-13 01:44:48,566 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=797, PETRI_PLACES=105, PETRI_TRANSITIONS=78} [2022-12-13 01:44:48,567 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2022-12-13 01:44:48,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:48,567 INFO L89 Accepts]: Start accepts. Operand has 105 places, 78 transitions, 797 flow [2022-12-13 01:44:48,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:48,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:48,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 78 transitions, 797 flow [2022-12-13 01:44:48,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 78 transitions, 797 flow [2022-12-13 01:44:48,593 INFO L130 PetriNetUnfolder]: 57/397 cut-off events. [2022-12-13 01:44:48,593 INFO L131 PetriNetUnfolder]: For 1795/1811 co-relation queries the response was YES. [2022-12-13 01:44:48,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 397 events. 57/397 cut-off events. For 1795/1811 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2988 event pairs, 1 based on Foata normal form. 4/384 useless extension candidates. Maximal degree in co-relation 1546. Up to 76 conditions per place. [2022-12-13 01:44:48,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 78 transitions, 797 flow [2022-12-13 01:44:48,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-13 01:44:48,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:44:48,647 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:48,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-13 01:44:48,647 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 78 transitions, 804 flow [2022-12-13 01:44:48,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:48,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:48,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:48,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-13 01:44:48,648 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:48,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash 885355396, now seen corresponding path program 1 times [2022-12-13 01:44:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:48,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374737042] [2022-12-13 01:44:48,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:49,100 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-13 01:44:49,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:49,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374737042] [2022-12-13 01:44:49,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374737042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:49,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:49,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:49,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693490013] [2022-12-13 01:44:49,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:49,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:49,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:49,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:49,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:49,105 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:44:49,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 78 transitions, 804 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:49,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:49,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:44:49,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:49,472 INFO L130 PetriNetUnfolder]: 800/1660 cut-off events. [2022-12-13 01:44:49,472 INFO L131 PetriNetUnfolder]: For 10055/10055 co-relation queries the response was YES. [2022-12-13 01:44:49,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8019 conditions, 1660 events. 800/1660 cut-off events. For 10055/10055 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10234 event pairs, 282 based on Foata normal form. 2/1662 useless extension candidates. Maximal degree in co-relation 7957. Up to 1160 conditions per place. [2022-12-13 01:44:49,482 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 121 selfloop transitions, 13 changer transitions 27/161 dead transitions. [2022-12-13 01:44:49,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 161 transitions, 1703 flow [2022-12-13 01:44:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:44:49,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:44:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2022-12-13 01:44:49,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-13 01:44:49,483 INFO L175 Difference]: Start difference. First operand has 101 places, 78 transitions, 804 flow. Second operand 9 states and 138 transitions. [2022-12-13 01:44:49,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 161 transitions, 1703 flow [2022-12-13 01:44:49,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 161 transitions, 1633 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-12-13 01:44:49,498 INFO L231 Difference]: Finished difference. Result has 105 places, 80 transitions, 807 flow [2022-12-13 01:44:49,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=807, PETRI_PLACES=105, PETRI_TRANSITIONS=80} [2022-12-13 01:44:49,498 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2022-12-13 01:44:49,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:49,498 INFO L89 Accepts]: Start accepts. Operand has 105 places, 80 transitions, 807 flow [2022-12-13 01:44:49,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:49,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:49,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 80 transitions, 807 flow [2022-12-13 01:44:49,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 80 transitions, 807 flow [2022-12-13 01:44:49,529 INFO L130 PetriNetUnfolder]: 59/408 cut-off events. [2022-12-13 01:44:49,529 INFO L131 PetriNetUnfolder]: For 1726/1740 co-relation queries the response was YES. [2022-12-13 01:44:49,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 408 events. 59/408 cut-off events. For 1726/1740 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3084 event pairs, 8 based on Foata normal form. 3/391 useless extension candidates. Maximal degree in co-relation 1553. Up to 80 conditions per place. [2022-12-13 01:44:49,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 80 transitions, 807 flow [2022-12-13 01:44:49,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-13 01:44:49,564 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:49,564 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 01:44:49,564 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 79 transitions, 803 flow [2022-12-13 01:44:49,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:49,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:49,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:49,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-13 01:44:49,565 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:49,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1047487186, now seen corresponding path program 1 times [2022-12-13 01:44:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:49,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160878792] [2022-12-13 01:44:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:50,330 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-13 01:44:50,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:50,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160878792] [2022-12-13 01:44:50,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160878792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:50,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:50,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:50,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532547002] [2022-12-13 01:44:50,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:50,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:50,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:50,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:50,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:50,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:44:50,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 79 transitions, 803 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:50,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:50,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:44:50,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:50,669 INFO L130 PetriNetUnfolder]: 785/1629 cut-off events. [2022-12-13 01:44:50,669 INFO L131 PetriNetUnfolder]: For 9920/9920 co-relation queries the response was YES. [2022-12-13 01:44:50,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7900 conditions, 1629 events. 785/1629 cut-off events. For 9920/9920 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9938 event pairs, 294 based on Foata normal form. 2/1631 useless extension candidates. Maximal degree in co-relation 7838. Up to 1160 conditions per place. [2022-12-13 01:44:50,677 INFO L137 encePairwiseOnDemand]: 36/46 looper letters, 113 selfloop transitions, 14 changer transitions 25/152 dead transitions. [2022-12-13 01:44:50,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 152 transitions, 1601 flow [2022-12-13 01:44:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2022-12-13 01:44:50,680 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3532608695652174 [2022-12-13 01:44:50,680 INFO L175 Difference]: Start difference. First operand has 102 places, 79 transitions, 803 flow. Second operand 8 states and 130 transitions. [2022-12-13 01:44:50,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 152 transitions, 1601 flow [2022-12-13 01:44:50,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 152 transitions, 1560 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-13 01:44:50,692 INFO L231 Difference]: Finished difference. Result has 106 places, 81 transitions, 821 flow [2022-12-13 01:44:50,692 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=821, PETRI_PLACES=106, PETRI_TRANSITIONS=81} [2022-12-13 01:44:50,692 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 01:44:50,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:50,692 INFO L89 Accepts]: Start accepts. Operand has 106 places, 81 transitions, 821 flow [2022-12-13 01:44:50,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:50,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:50,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 81 transitions, 821 flow [2022-12-13 01:44:50,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 81 transitions, 821 flow [2022-12-13 01:44:50,719 INFO L130 PetriNetUnfolder]: 57/413 cut-off events. [2022-12-13 01:44:50,719 INFO L131 PetriNetUnfolder]: For 1727/1745 co-relation queries the response was YES. [2022-12-13 01:44:50,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 413 events. 57/413 cut-off events. For 1727/1745 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3168 event pairs, 4 based on Foata normal form. 3/398 useless extension candidates. Maximal degree in co-relation 1564. Up to 77 conditions per place. [2022-12-13 01:44:50,722 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 81 transitions, 821 flow [2022-12-13 01:44:50,722 INFO L226 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-13 01:44:50,723 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:50,723 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 01:44:50,723 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 81 transitions, 821 flow [2022-12-13 01:44:50,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:50,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:50,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:50,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-13 01:44:50,724 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:50,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1036499346, now seen corresponding path program 2 times [2022-12-13 01:44:50,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:50,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426190967] [2022-12-13 01:44:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:50,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:51,131 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-13 01:44:51,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:51,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426190967] [2022-12-13 01:44:51,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426190967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:51,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:51,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:44:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843136789] [2022-12-13 01:44:51,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:51,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:51,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:51,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:51,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:44:51,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:44:51,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 81 transitions, 821 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:51,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:51,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:44:51,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:51,500 INFO L130 PetriNetUnfolder]: 775/1631 cut-off events. [2022-12-13 01:44:51,500 INFO L131 PetriNetUnfolder]: For 9739/9739 co-relation queries the response was YES. [2022-12-13 01:44:51,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7879 conditions, 1631 events. 775/1631 cut-off events. For 9739/9739 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10091 event pairs, 326 based on Foata normal form. 2/1633 useless extension candidates. Maximal degree in co-relation 7817. Up to 1160 conditions per place. [2022-12-13 01:44:51,510 INFO L137 encePairwiseOnDemand]: 36/46 looper letters, 110 selfloop transitions, 12 changer transitions 28/150 dead transitions. [2022-12-13 01:44:51,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 150 transitions, 1616 flow [2022-12-13 01:44:51,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:51,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2022-12-13 01:44:51,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3451086956521739 [2022-12-13 01:44:51,511 INFO L175 Difference]: Start difference. First operand has 105 places, 81 transitions, 821 flow. Second operand 8 states and 127 transitions. [2022-12-13 01:44:51,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 150 transitions, 1616 flow [2022-12-13 01:44:51,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 150 transitions, 1578 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-13 01:44:51,525 INFO L231 Difference]: Finished difference. Result has 108 places, 80 transitions, 805 flow [2022-12-13 01:44:51,525 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=805, PETRI_PLACES=108, PETRI_TRANSITIONS=80} [2022-12-13 01:44:51,525 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:44:51,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:51,525 INFO L89 Accepts]: Start accepts. Operand has 108 places, 80 transitions, 805 flow [2022-12-13 01:44:51,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:51,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:51,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 80 transitions, 805 flow [2022-12-13 01:44:51,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 80 transitions, 805 flow [2022-12-13 01:44:51,554 INFO L130 PetriNetUnfolder]: 54/412 cut-off events. [2022-12-13 01:44:51,554 INFO L131 PetriNetUnfolder]: For 1753/1767 co-relation queries the response was YES. [2022-12-13 01:44:51,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 412 events. 54/412 cut-off events. For 1753/1767 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3189 event pairs, 6 based on Foata normal form. 3/397 useless extension candidates. Maximal degree in co-relation 1567. Up to 66 conditions per place. [2022-12-13 01:44:51,557 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 80 transitions, 805 flow [2022-12-13 01:44:51,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 01:44:51,558 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:51,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 01:44:51,558 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 80 transitions, 805 flow [2022-12-13 01:44:51,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:51,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:51,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:51,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-13 01:44:51,558 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash 178225702, now seen corresponding path program 3 times [2022-12-13 01:44:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:51,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347409813] [2022-12-13 01:44:51,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:51,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:52,117 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-13 01:44:52,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:52,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347409813] [2022-12-13 01:44:52,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347409813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:52,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:52,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:44:52,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564691480] [2022-12-13 01:44:52,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:52,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:44:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:44:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:44:52,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:44:52,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 80 transitions, 805 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:52,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:52,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:44:52,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:52,607 INFO L130 PetriNetUnfolder]: 779/1649 cut-off events. [2022-12-13 01:44:52,607 INFO L131 PetriNetUnfolder]: For 9843/9843 co-relation queries the response was YES. [2022-12-13 01:44:52,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7914 conditions, 1649 events. 779/1649 cut-off events. For 9843/9843 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10392 event pairs, 288 based on Foata normal form. 2/1651 useless extension candidates. Maximal degree in co-relation 7851. Up to 1160 conditions per place. [2022-12-13 01:44:52,619 INFO L137 encePairwiseOnDemand]: 33/46 looper letters, 114 selfloop transitions, 17 changer transitions 26/157 dead transitions. [2022-12-13 01:44:52,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 157 transitions, 1638 flow [2022-12-13 01:44:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:44:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:44:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2022-12-13 01:44:52,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32367149758454106 [2022-12-13 01:44:52,620 INFO L175 Difference]: Start difference. First operand has 106 places, 80 transitions, 805 flow. Second operand 9 states and 134 transitions. [2022-12-13 01:44:52,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 157 transitions, 1638 flow [2022-12-13 01:44:52,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 157 transitions, 1602 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 01:44:52,641 INFO L231 Difference]: Finished difference. Result has 111 places, 85 transitions, 893 flow [2022-12-13 01:44:52,641 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=893, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2022-12-13 01:44:52,642 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:44:52,642 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:52,642 INFO L89 Accepts]: Start accepts. Operand has 111 places, 85 transitions, 893 flow [2022-12-13 01:44:52,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:52,643 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:52,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 85 transitions, 893 flow [2022-12-13 01:44:52,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 85 transitions, 893 flow [2022-12-13 01:44:52,675 INFO L130 PetriNetUnfolder]: 51/403 cut-off events. [2022-12-13 01:44:52,675 INFO L131 PetriNetUnfolder]: For 1932/1965 co-relation queries the response was YES. [2022-12-13 01:44:52,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1639 conditions, 403 events. 51/403 cut-off events. For 1932/1965 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3096 event pairs, 1 based on Foata normal form. 5/391 useless extension candidates. Maximal degree in co-relation 1584. Up to 64 conditions per place. [2022-12-13 01:44:52,678 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 85 transitions, 893 flow [2022-12-13 01:44:52,678 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 01:44:52,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [849] L97-->L106: Formula: (and (= v_~i2~0_347 v_~i~0_1304) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_513| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_513|) (= (ite (or (< v_~n2~0_816 v_~n1~0_755) (= v_~n1~0_755 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_513|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_513| 0)) (= v_~i~0_1303 (select (select |v_#memory_int_810| v_~f~0.base_709) (+ v_~f~0.offset_715 (* v_~i2~0_347 4))))) InVars {~n2~0=v_~n2~0_816, ~i~0=v_~i~0_1304, ~f~0.base=v_~f~0.base_709, ~n1~0=v_~n1~0_755, #memory_int=|v_#memory_int_810|, ~f~0.offset=v_~f~0.offset_715} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_189|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_513|, ~n2~0=v_~n2~0_816, ~i~0=v_~i~0_1303, ~f~0.base=v_~f~0.base_709, ~n1~0=v_~n1~0_755, #memory_int=|v_#memory_int_810|, ~i2~0=v_~i2~0_347, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_513|, ~f~0.offset=v_~f~0.offset_715} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [754] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (= v_~e1~0_188 1) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| 0)) (= v_~n2~0_335 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|) (= v_~n2~0_336 v_~tmp1~0_159) (= (ite (and (<= 0 v_~i~0_539) (< v_~i~0_539 v_~n~0_218)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|)) InVars {~n2~0=v_~n2~0_336, ~i~0=v_~i~0_539, ~n~0=v_~n~0_218} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, ~n2~0=v_~n2~0_335, ~i~0=v_~i~0_539, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|, ~n~0=v_~n~0_218, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, ~tmp1~0=v_~tmp1~0_159, ~e1~0=v_~e1~0_188} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:44:52,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [849] L97-->L106: Formula: (and (= v_~i2~0_347 v_~i~0_1304) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_513| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_513|) (= (ite (or (< v_~n2~0_816 v_~n1~0_755) (= v_~n1~0_755 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_513|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_513| 0)) (= v_~i~0_1303 (select (select |v_#memory_int_810| v_~f~0.base_709) (+ v_~f~0.offset_715 (* v_~i2~0_347 4))))) InVars {~n2~0=v_~n2~0_816, ~i~0=v_~i~0_1304, ~f~0.base=v_~f~0.base_709, ~n1~0=v_~n1~0_755, #memory_int=|v_#memory_int_810|, ~f~0.offset=v_~f~0.offset_715} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_189|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_513|, ~n2~0=v_~n2~0_816, ~i~0=v_~i~0_1303, ~f~0.base=v_~f~0.base_709, ~n1~0=v_~n1~0_755, #memory_int=|v_#memory_int_810|, ~i2~0=v_~i2~0_347, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_513|, ~f~0.offset=v_~f~0.offset_715} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [756] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~n2~0_342 v_~tmp1~0_163) (= v_~n2~0_341 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_41| 0) (= v_~n1~0_353 (+ v_~tmp1~0_163 1)) (= (ite (and (<= 0 v_~i~0_541) (< v_~i~0_541 v_~n~0_220)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|) (= v_~e1~0_194 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|)) InVars {~n2~0=v_~n2~0_342, ~i~0=v_~i~0_541, ~n~0=v_~n~0_220} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_41|, ~n2~0=v_~n2~0_341, ~i~0=v_~i~0_541, ~n1~0=v_~n1~0_353, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|, ~n~0=v_~n~0_220, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_41|, ~tmp1~0=v_~tmp1~0_163, ~e1~0=v_~e1~0_194} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:44:52,819 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:52,820 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 178 [2022-12-13 01:44:52,820 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 85 transitions, 947 flow [2022-12-13 01:44:52,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:52,820 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:52,820 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:52,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-13 01:44:52,820 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:52,820 INFO L85 PathProgramCache]: Analyzing trace with hash 275030139, now seen corresponding path program 1 times [2022-12-13 01:44:52,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:52,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530653739] [2022-12-13 01:44:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:52,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:53,266 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-13 01:44:53,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:53,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530653739] [2022-12-13 01:44:53,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530653739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:53,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:53,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:44:53,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030542311] [2022-12-13 01:44:53,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:53,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:53,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:53,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:53,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:44:53,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:44:53,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 85 transitions, 947 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:53,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:53,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:44:53,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:53,620 INFO L130 PetriNetUnfolder]: 743/1597 cut-off events. [2022-12-13 01:44:53,620 INFO L131 PetriNetUnfolder]: For 11376/11376 co-relation queries the response was YES. [2022-12-13 01:44:53,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8022 conditions, 1597 events. 743/1597 cut-off events. For 11376/11376 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10089 event pairs, 328 based on Foata normal form. 2/1599 useless extension candidates. Maximal degree in co-relation 7957. Up to 1160 conditions per place. [2022-12-13 01:44:53,627 INFO L137 encePairwiseOnDemand]: 37/49 looper letters, 109 selfloop transitions, 14 changer transitions 26/149 dead transitions. [2022-12-13 01:44:53,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 149 transitions, 1694 flow [2022-12-13 01:44:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2022-12-13 01:44:53,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3163265306122449 [2022-12-13 01:44:53,627 INFO L175 Difference]: Start difference. First operand has 110 places, 85 transitions, 947 flow. Second operand 8 states and 124 transitions. [2022-12-13 01:44:53,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 149 transitions, 1694 flow [2022-12-13 01:44:53,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 149 transitions, 1639 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-13 01:44:53,644 INFO L231 Difference]: Finished difference. Result has 113 places, 84 transitions, 922 flow [2022-12-13 01:44:53,644 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=922, PETRI_PLACES=113, PETRI_TRANSITIONS=84} [2022-12-13 01:44:53,645 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2022-12-13 01:44:53,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:53,645 INFO L89 Accepts]: Start accepts. Operand has 113 places, 84 transitions, 922 flow [2022-12-13 01:44:53,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:53,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:53,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 84 transitions, 922 flow [2022-12-13 01:44:53,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 84 transitions, 922 flow [2022-12-13 01:44:53,671 INFO L130 PetriNetUnfolder]: 49/400 cut-off events. [2022-12-13 01:44:53,671 INFO L131 PetriNetUnfolder]: For 2105/2119 co-relation queries the response was YES. [2022-12-13 01:44:53,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1675 conditions, 400 events. 49/400 cut-off events. For 2105/2119 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3127 event pairs, 1 based on Foata normal form. 3/385 useless extension candidates. Maximal degree in co-relation 1620. Up to 66 conditions per place. [2022-12-13 01:44:53,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 84 transitions, 922 flow [2022-12-13 01:44:53,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-13 01:44:53,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [852] L97-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_85| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_523| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_85| 0) (= v_~n2~0_827 v_~tmp1~0_217) (= (+ v_~tmp1~0_217 1) v_~n1~0_761) (= v_~n2~0_826 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_523| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_523|) (= v_~i2~0_353 v_~i~0_1316) (= (select (select |v_#memory_int_816| v_~f~0.base_715) (+ v_~f~0.offset_721 (* v_~i2~0_353 4))) v_~i~0_1315) (not (= (ite (or (= v_~n1~0_762 0) (< v_~n2~0_827 v_~n1~0_762)) 1 0) 0)) (= (ite (and (< v_~i~0_1315 v_~n~0_464) (<= 0 v_~i~0_1315)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_523|) (= v_~e1~0_529 0)) InVars {~n2~0=v_~n2~0_827, ~i~0=v_~i~0_1316, ~f~0.base=v_~f~0.base_715, ~n1~0=v_~n1~0_762, #memory_int=|v_#memory_int_816|, ~n~0=v_~n~0_464, ~f~0.offset=v_~f~0.offset_721} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_85|, ~n2~0=v_~n2~0_826, ~i~0=v_~i~0_1315, ~n1~0=v_~n1~0_761, ~f~0.base=v_~f~0.base_715, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_523|, ~i2~0=v_~i2~0_353, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_85|, ~f~0.offset=v_~f~0.offset_721, ~e1~0=v_~e1~0_529, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_195|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_523|, #memory_int=|v_#memory_int_816|, ~n~0=v_~n~0_464, ~tmp1~0=v_~tmp1~0_217} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~i~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] and [741] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| (ite (or (= v_~n2~0_287 0) (<= v_~n1~0_315 v_~n2~0_287)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142|) (not (= (ite (= 0 (mod v_~e2~0_231 256)) 1 0) 0)) (= v_~i1~0_229 v_~i~0_496) (= (select (select |v_#memory_int_369| v_~f~0.base_292) (+ v_~f~0.offset_299 (* v_~i1~0_229 4))) v_~i~0_495)) InVars {~n2~0=v_~n2~0_287, ~i~0=v_~i~0_496, ~f~0.base=v_~f~0.base_292, ~n1~0=v_~n1~0_315, #memory_int=|v_#memory_int_369|, ~f~0.offset=v_~f~0.offset_299, ~e2~0=v_~e2~0_231} OutVars{~n2~0=v_~n2~0_287, ~i~0=v_~i~0_495, ~f~0.base=v_~f~0.base_292, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142|, ~n1~0=v_~n1~0_315, #memory_int=|v_#memory_int_369|, ~i1~0=v_~i1~0_229, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_146|, ~f~0.offset=v_~f~0.offset_299, ~e2~0=v_~e2~0_231, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:44:53,834 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:53,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 190 [2022-12-13 01:44:53,835 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 84 transitions, 923 flow [2022-12-13 01:44:53,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:53,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:53,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:53,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-13 01:44:53,835 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:53,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1876907315, now seen corresponding path program 1 times [2022-12-13 01:44:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:53,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035075231] [2022-12-13 01:44:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:53,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:54,268 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-13 01:44:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:54,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035075231] [2022-12-13 01:44:54,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035075231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:54,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:54,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:44:54,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511176198] [2022-12-13 01:44:54,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:54,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:44:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:54,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:44:54,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:44:54,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:44:54,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 84 transitions, 923 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:54,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:54,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:44:54,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:54,597 INFO L130 PetriNetUnfolder]: 745/1607 cut-off events. [2022-12-13 01:44:54,597 INFO L131 PetriNetUnfolder]: For 11132/11132 co-relation queries the response was YES. [2022-12-13 01:44:54,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7990 conditions, 1607 events. 745/1607 cut-off events. For 11132/11132 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10233 event pairs, 337 based on Foata normal form. 1/1608 useless extension candidates. Maximal degree in co-relation 7925. Up to 1160 conditions per place. [2022-12-13 01:44:54,606 INFO L137 encePairwiseOnDemand]: 38/49 looper letters, 107 selfloop transitions, 12 changer transitions 27/146 dead transitions. [2022-12-13 01:44:54,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 146 transitions, 1628 flow [2022-12-13 01:44:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:44:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:44:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2022-12-13 01:44:54,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3556851311953353 [2022-12-13 01:44:54,607 INFO L175 Difference]: Start difference. First operand has 111 places, 84 transitions, 923 flow. Second operand 7 states and 122 transitions. [2022-12-13 01:44:54,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 146 transitions, 1628 flow [2022-12-13 01:44:54,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 146 transitions, 1570 flow, removed 15 selfloop flow, removed 8 redundant places. [2022-12-13 01:44:54,623 INFO L231 Difference]: Finished difference. Result has 111 places, 83 transitions, 881 flow [2022-12-13 01:44:54,623 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=881, PETRI_PLACES=111, PETRI_TRANSITIONS=83} [2022-12-13 01:44:54,624 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:44:54,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:54,624 INFO L89 Accepts]: Start accepts. Operand has 111 places, 83 transitions, 881 flow [2022-12-13 01:44:54,624 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:54,624 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:54,624 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 83 transitions, 881 flow [2022-12-13 01:44:54,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 83 transitions, 881 flow [2022-12-13 01:44:54,650 INFO L130 PetriNetUnfolder]: 47/395 cut-off events. [2022-12-13 01:44:54,651 INFO L131 PetriNetUnfolder]: For 1916/1930 co-relation queries the response was YES. [2022-12-13 01:44:54,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1609 conditions, 395 events. 47/395 cut-off events. For 1916/1930 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3071 event pairs, 1 based on Foata normal form. 3/381 useless extension candidates. Maximal degree in co-relation 1555. Up to 64 conditions per place. [2022-12-13 01:44:54,653 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 83 transitions, 881 flow [2022-12-13 01:44:54,653 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 01:44:54,654 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:54,654 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 01:44:54,654 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 83 transitions, 881 flow [2022-12-13 01:44:54,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:44:54,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:54,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:54,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-13 01:44:54,655 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1882569080, now seen corresponding path program 1 times [2022-12-13 01:44:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:54,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870398067] [2022-12-13 01:44:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:55,190 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-13 01:44:55,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:55,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870398067] [2022-12-13 01:44:55,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870398067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:55,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:55,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:44:55,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911148481] [2022-12-13 01:44:55,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:55,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:55,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:55,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:44:55,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:44:55,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 83 transitions, 881 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:55,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:55,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:44:55,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:55,532 INFO L130 PetriNetUnfolder]: 724/1568 cut-off events. [2022-12-13 01:44:55,532 INFO L131 PetriNetUnfolder]: For 10447/10447 co-relation queries the response was YES. [2022-12-13 01:44:55,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7692 conditions, 1568 events. 724/1568 cut-off events. For 10447/10447 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9932 event pairs, 314 based on Foata normal form. 2/1570 useless extension candidates. Maximal degree in co-relation 7628. Up to 1212 conditions per place. [2022-12-13 01:44:55,541 INFO L137 encePairwiseOnDemand]: 37/48 looper letters, 87 selfloop transitions, 12 changer transitions 35/134 dead transitions. [2022-12-13 01:44:55,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 134 transitions, 1479 flow [2022-12-13 01:44:55,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:44:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:44:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-12-13 01:44:55,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33630952380952384 [2022-12-13 01:44:55,542 INFO L175 Difference]: Start difference. First operand has 109 places, 83 transitions, 881 flow. Second operand 7 states and 113 transitions. [2022-12-13 01:44:55,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 134 transitions, 1479 flow [2022-12-13 01:44:55,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 134 transitions, 1449 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 01:44:55,560 INFO L231 Difference]: Finished difference. Result has 111 places, 79 transitions, 815 flow [2022-12-13 01:44:55,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=815, PETRI_PLACES=111, PETRI_TRANSITIONS=79} [2022-12-13 01:44:55,561 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:44:55,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:55,561 INFO L89 Accepts]: Start accepts. Operand has 111 places, 79 transitions, 815 flow [2022-12-13 01:44:55,562 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:55,562 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:55,562 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 79 transitions, 815 flow [2022-12-13 01:44:55,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 79 transitions, 815 flow [2022-12-13 01:44:55,589 INFO L130 PetriNetUnfolder]: 45/355 cut-off events. [2022-12-13 01:44:55,589 INFO L131 PetriNetUnfolder]: For 1650/1664 co-relation queries the response was YES. [2022-12-13 01:44:55,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 355 events. 45/355 cut-off events. For 1650/1664 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2627 event pairs, 1 based on Foata normal form. 3/343 useless extension candidates. Maximal degree in co-relation 1380. Up to 58 conditions per place. [2022-12-13 01:44:55,592 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 79 transitions, 815 flow [2022-12-13 01:44:55,592 INFO L226 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-13 01:44:55,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [849] L97-->L106: Formula: (and (= v_~i2~0_347 v_~i~0_1304) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_513| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_513|) (= (ite (or (< v_~n2~0_816 v_~n1~0_755) (= v_~n1~0_755 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_513|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_513| 0)) (= v_~i~0_1303 (select (select |v_#memory_int_810| v_~f~0.base_709) (+ v_~f~0.offset_715 (* v_~i2~0_347 4))))) InVars {~n2~0=v_~n2~0_816, ~i~0=v_~i~0_1304, ~f~0.base=v_~f~0.base_709, ~n1~0=v_~n1~0_755, #memory_int=|v_#memory_int_810|, ~f~0.offset=v_~f~0.offset_715} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_189|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_513|, ~n2~0=v_~n2~0_816, ~i~0=v_~i~0_1303, ~f~0.base=v_~f~0.base_709, ~n1~0=v_~n1~0_755, #memory_int=|v_#memory_int_810|, ~i2~0=v_~i2~0_347, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_513|, ~f~0.offset=v_~f~0.offset_715} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:44:55,645 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:44:55,646 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-13 01:44:55,646 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 78 transitions, 813 flow [2022-12-13 01:44:55,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:44:55,646 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:55,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:44:55,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-13 01:44:55,646 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash 779116363, now seen corresponding path program 1 times [2022-12-13 01:44:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:55,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226963172] [2022-12-13 01:44:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:56,371 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-13 01:44:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:56,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226963172] [2022-12-13 01:44:56,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226963172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:56,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:56,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:44:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547052537] [2022-12-13 01:44:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:56,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:44:56,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:56,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:44:56,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:44:56,372 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:44:56,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 78 transitions, 813 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:56,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:56,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:44:56,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:56,734 INFO L130 PetriNetUnfolder]: 669/1428 cut-off events. [2022-12-13 01:44:56,734 INFO L131 PetriNetUnfolder]: For 9127/9127 co-relation queries the response was YES. [2022-12-13 01:44:56,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7036 conditions, 1428 events. 669/1428 cut-off events. For 9127/9127 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8652 event pairs, 282 based on Foata normal form. 2/1430 useless extension candidates. Maximal degree in co-relation 6743. Up to 1160 conditions per place. [2022-12-13 01:44:56,741 INFO L137 encePairwiseOnDemand]: 37/46 looper letters, 100 selfloop transitions, 9 changer transitions 30/139 dead transitions. [2022-12-13 01:44:56,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 139 transitions, 1516 flow [2022-12-13 01:44:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:44:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:44:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-12-13 01:44:56,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3179347826086957 [2022-12-13 01:44:56,742 INFO L175 Difference]: Start difference. First operand has 106 places, 78 transitions, 813 flow. Second operand 8 states and 117 transitions. [2022-12-13 01:44:56,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 139 transitions, 1516 flow [2022-12-13 01:44:56,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 139 transitions, 1464 flow, removed 15 selfloop flow, removed 8 redundant places. [2022-12-13 01:44:56,759 INFO L231 Difference]: Finished difference. Result has 107 places, 76 transitions, 765 flow [2022-12-13 01:44:56,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=765, PETRI_PLACES=107, PETRI_TRANSITIONS=76} [2022-12-13 01:44:56,759 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:44:56,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:56,759 INFO L89 Accepts]: Start accepts. Operand has 107 places, 76 transitions, 765 flow [2022-12-13 01:44:56,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:56,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:56,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 76 transitions, 765 flow [2022-12-13 01:44:56,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 76 transitions, 765 flow [2022-12-13 01:44:56,782 INFO L130 PetriNetUnfolder]: 44/349 cut-off events. [2022-12-13 01:44:56,783 INFO L131 PetriNetUnfolder]: For 1484/1498 co-relation queries the response was YES. [2022-12-13 01:44:56,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 349 events. 44/349 cut-off events. For 1484/1498 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2539 event pairs, 1 based on Foata normal form. 3/338 useless extension candidates. Maximal degree in co-relation 1321. Up to 56 conditions per place. [2022-12-13 01:44:56,785 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 76 transitions, 765 flow [2022-12-13 01:44:56,785 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 01:44:56,785 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:44:56,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 01:44:56,786 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 76 transitions, 765 flow [2022-12-13 01:44:56,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:44:56,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:44:56,786 INFO L214 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] [2022-12-13 01:44:56,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-13 01:44:56,786 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:44:56,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:44:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1906026553, now seen corresponding path program 1 times [2022-12-13 01:44:56,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:44:56,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018616225] [2022-12-13 01:44:56,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:44:56,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:44:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:44:57,232 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-13 01:44:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:44:57,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018616225] [2022-12-13 01:44:57,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018616225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:44:57,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:44:57,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:44:57,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011410563] [2022-12-13 01:44:57,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:44:57,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:44:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:44:57,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:44:57,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:44:57,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:44:57,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 76 transitions, 765 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:44:57,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:44:57,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:44:57,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:44:57,638 INFO L130 PetriNetUnfolder]: 655/1375 cut-off events. [2022-12-13 01:44:57,638 INFO L131 PetriNetUnfolder]: For 8379/8379 co-relation queries the response was YES. [2022-12-13 01:44:57,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6626 conditions, 1375 events. 655/1375 cut-off events. For 8379/8379 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8106 event pairs, 282 based on Foata normal form. 2/1377 useless extension candidates. Maximal degree in co-relation 6571. Up to 1160 conditions per place. [2022-12-13 01:44:57,645 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 74 selfloop transitions, 7 changer transitions 40/121 dead transitions. [2022-12-13 01:44:57,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 121 transitions, 1318 flow [2022-12-13 01:44:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:44:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:44:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-12-13 01:44:57,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2022-12-13 01:44:57,646 INFO L175 Difference]: Start difference. First operand has 103 places, 76 transitions, 765 flow. Second operand 10 states and 100 transitions. [2022-12-13 01:44:57,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 121 transitions, 1318 flow [2022-12-13 01:44:57,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 121 transitions, 1288 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-12-13 01:44:57,658 INFO L231 Difference]: Finished difference. Result has 108 places, 73 transitions, 730 flow [2022-12-13 01:44:57,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=730, PETRI_PLACES=108, PETRI_TRANSITIONS=73} [2022-12-13 01:44:57,658 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:44:57,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:44:57,658 INFO L89 Accepts]: Start accepts. Operand has 108 places, 73 transitions, 730 flow [2022-12-13 01:44:57,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:44:57,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:44:57,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 73 transitions, 730 flow [2022-12-13 01:44:57,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 73 transitions, 730 flow [2022-12-13 01:44:57,679 INFO L130 PetriNetUnfolder]: 43/304 cut-off events. [2022-12-13 01:44:57,679 INFO L131 PetriNetUnfolder]: For 1366/1380 co-relation queries the response was YES. [2022-12-13 01:44:57,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 304 events. 43/304 cut-off events. For 1366/1380 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2162 event pairs, 1 based on Foata normal form. 3/294 useless extension candidates. Maximal degree in co-relation 1166. Up to 52 conditions per place. [2022-12-13 01:44:57,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 73 transitions, 730 flow [2022-12-13 01:44:57,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-13 01:45:00,535 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:00,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2878 [2022-12-13 01:45:00,536 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 72 transitions, 722 flow [2022-12-13 01:45:00,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:00,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:00,536 INFO L214 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] [2022-12-13 01:45:00,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-13 01:45:00,536 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1038960726, now seen corresponding path program 1 times [2022-12-13 01:45:00,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:00,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962170150] [2022-12-13 01:45:00,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:00,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:01,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-13 01:45:01,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:01,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962170150] [2022-12-13 01:45:01,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962170150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:01,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:01,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280262253] [2022-12-13 01:45:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:01,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:01,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:01,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:01,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:45:01,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 72 transitions, 722 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:01,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:01,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:45:01,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:01,771 INFO L130 PetriNetUnfolder]: 1215/2476 cut-off events. [2022-12-13 01:45:01,772 INFO L131 PetriNetUnfolder]: For 15564/15564 co-relation queries the response was YES. [2022-12-13 01:45:01,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12028 conditions, 2476 events. 1215/2476 cut-off events. For 15564/15564 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16583 event pairs, 394 based on Foata normal form. 3/2479 useless extension candidates. Maximal degree in co-relation 11959. Up to 1160 conditions per place. [2022-12-13 01:45:01,785 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 151 selfloop transitions, 20 changer transitions 24/195 dead transitions. [2022-12-13 01:45:01,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 195 transitions, 2110 flow [2022-12-13 01:45:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2022-12-13 01:45:01,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39753086419753086 [2022-12-13 01:45:01,785 INFO L175 Difference]: Start difference. First operand has 97 places, 72 transitions, 722 flow. Second operand 9 states and 161 transitions. [2022-12-13 01:45:01,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 195 transitions, 2110 flow [2022-12-13 01:45:01,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 195 transitions, 2020 flow, removed 25 selfloop flow, removed 11 redundant places. [2022-12-13 01:45:01,808 INFO L231 Difference]: Finished difference. Result has 99 places, 86 transitions, 906 flow [2022-12-13 01:45:01,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=906, PETRI_PLACES=99, PETRI_TRANSITIONS=86} [2022-12-13 01:45:01,808 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-12-13 01:45:01,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:01,808 INFO L89 Accepts]: Start accepts. Operand has 99 places, 86 transitions, 906 flow [2022-12-13 01:45:01,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:01,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:01,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 86 transitions, 906 flow [2022-12-13 01:45:01,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 86 transitions, 906 flow [2022-12-13 01:45:01,846 INFO L130 PetriNetUnfolder]: 85/596 cut-off events. [2022-12-13 01:45:01,846 INFO L131 PetriNetUnfolder]: For 2753/2791 co-relation queries the response was YES. [2022-12-13 01:45:01,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2340 conditions, 596 events. 85/596 cut-off events. For 2753/2791 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5274 event pairs, 2 based on Foata normal form. 11/581 useless extension candidates. Maximal degree in co-relation 2286. Up to 103 conditions per place. [2022-12-13 01:45:01,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 86 transitions, 906 flow [2022-12-13 01:45:01,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 536 [2022-12-13 01:45:01,853 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:01,853 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 01:45:01,853 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 906 flow [2022-12-13 01:45:01,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:01,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:01,853 INFO L214 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] [2022-12-13 01:45:01,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-13 01:45:01,853 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:01,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:01,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1639299790, now seen corresponding path program 2 times [2022-12-13 01:45:01,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:01,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335110673] [2022-12-13 01:45:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:01,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:02,614 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-13 01:45:02,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:02,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335110673] [2022-12-13 01:45:02,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335110673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:02,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:02,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:02,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311544718] [2022-12-13 01:45:02,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:02,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:02,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:02,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:02,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:02,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:45:02,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 86 transitions, 906 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:02,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:02,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:45:02,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:03,089 INFO L130 PetriNetUnfolder]: 1185/2446 cut-off events. [2022-12-13 01:45:03,090 INFO L131 PetriNetUnfolder]: For 15133/15133 co-relation queries the response was YES. [2022-12-13 01:45:03,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11799 conditions, 2446 events. 1185/2446 cut-off events. For 15133/15133 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16531 event pairs, 381 based on Foata normal form. 3/2449 useless extension candidates. Maximal degree in co-relation 11733. Up to 1160 conditions per place. [2022-12-13 01:45:03,127 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 146 selfloop transitions, 18 changer transitions 30/194 dead transitions. [2022-12-13 01:45:03,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 194 transitions, 2096 flow [2022-12-13 01:45:03,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2022-12-13 01:45:03,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39753086419753086 [2022-12-13 01:45:03,128 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 906 flow. Second operand 9 states and 161 transitions. [2022-12-13 01:45:03,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 194 transitions, 2096 flow [2022-12-13 01:45:03,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 194 transitions, 2092 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 01:45:03,149 INFO L231 Difference]: Finished difference. Result has 109 places, 84 transitions, 944 flow [2022-12-13 01:45:03,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=944, PETRI_PLACES=109, PETRI_TRANSITIONS=84} [2022-12-13 01:45:03,150 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2022-12-13 01:45:03,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:03,150 INFO L89 Accepts]: Start accepts. Operand has 109 places, 84 transitions, 944 flow [2022-12-13 01:45:03,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:03,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:03,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 84 transitions, 944 flow [2022-12-13 01:45:03,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 84 transitions, 944 flow [2022-12-13 01:45:03,188 INFO L130 PetriNetUnfolder]: 77/562 cut-off events. [2022-12-13 01:45:03,188 INFO L131 PetriNetUnfolder]: For 3053/3084 co-relation queries the response was YES. [2022-12-13 01:45:03,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2311 conditions, 562 events. 77/562 cut-off events. For 3053/3084 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4830 event pairs, 2 based on Foata normal form. 5/544 useless extension candidates. Maximal degree in co-relation 2253. Up to 104 conditions per place. [2022-12-13 01:45:03,192 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 84 transitions, 944 flow [2022-12-13 01:45:03,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-13 01:45:03,327 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:03,327 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-13 01:45:03,327 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 83 transitions, 958 flow [2022-12-13 01:45:03,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:03,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:03,328 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:03,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-13 01:45:03,328 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:03,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:03,328 INFO L85 PathProgramCache]: Analyzing trace with hash -741737114, now seen corresponding path program 1 times [2022-12-13 01:45:03,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:03,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37101387] [2022-12-13 01:45:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:03,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:04,025 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-13 01:45:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:04,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37101387] [2022-12-13 01:45:04,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37101387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:04,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:04,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:45:04,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599170732] [2022-12-13 01:45:04,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:04,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:45:04,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:04,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:45:04,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:45:04,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:45:04,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 83 transitions, 958 flow. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:04,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:04,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:45:04,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:04,450 INFO L130 PetriNetUnfolder]: 1070/2226 cut-off events. [2022-12-13 01:45:04,450 INFO L131 PetriNetUnfolder]: For 17371/17371 co-relation queries the response was YES. [2022-12-13 01:45:04,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11149 conditions, 2226 events. 1070/2226 cut-off events. For 17371/17371 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14809 event pairs, 369 based on Foata normal form. 3/2229 useless extension candidates. Maximal degree in co-relation 11079. Up to 1160 conditions per place. [2022-12-13 01:45:04,462 INFO L137 encePairwiseOnDemand]: 37/48 looper letters, 135 selfloop transitions, 13 changer transitions 35/183 dead transitions. [2022-12-13 01:45:04,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 183 transitions, 2064 flow [2022-12-13 01:45:04,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2022-12-13 01:45:04,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4010416666666667 [2022-12-13 01:45:04,463 INFO L175 Difference]: Start difference. First operand has 106 places, 83 transitions, 958 flow. Second operand 8 states and 154 transitions. [2022-12-13 01:45:04,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 183 transitions, 2064 flow [2022-12-13 01:45:04,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 183 transitions, 1991 flow, removed 15 selfloop flow, removed 11 redundant places. [2022-12-13 01:45:04,487 INFO L231 Difference]: Finished difference. Result has 104 places, 79 transitions, 819 flow [2022-12-13 01:45:04,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=819, PETRI_PLACES=104, PETRI_TRANSITIONS=79} [2022-12-13 01:45:04,487 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places. [2022-12-13 01:45:04,487 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:04,487 INFO L89 Accepts]: Start accepts. Operand has 104 places, 79 transitions, 819 flow [2022-12-13 01:45:04,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:04,488 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:04,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 79 transitions, 819 flow [2022-12-13 01:45:04,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 79 transitions, 819 flow [2022-12-13 01:45:04,521 INFO L130 PetriNetUnfolder]: 70/528 cut-off events. [2022-12-13 01:45:04,522 INFO L131 PetriNetUnfolder]: For 2519/2549 co-relation queries the response was YES. [2022-12-13 01:45:04,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 528 events. 70/528 cut-off events. For 2519/2549 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4472 event pairs, 4 based on Foata normal form. 4/509 useless extension candidates. Maximal degree in co-relation 1977. Up to 103 conditions per place. [2022-12-13 01:45:04,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 79 transitions, 819 flow [2022-12-13 01:45:04,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 01:45:04,526 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:04,527 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 01:45:04,527 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 79 transitions, 819 flow [2022-12-13 01:45:04,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:04,527 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:04,527 INFO L214 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] [2022-12-13 01:45:04,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-13 01:45:04,527 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:04,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:04,527 INFO L85 PathProgramCache]: Analyzing trace with hash 228716943, now seen corresponding path program 1 times [2022-12-13 01:45:04,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:04,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629761338] [2022-12-13 01:45:04,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:04,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:05,656 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-13 01:45:05,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:05,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629761338] [2022-12-13 01:45:05,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629761338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:05,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:05,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:45:05,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627708847] [2022-12-13 01:45:05,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:05,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:45:05,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:05,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:45:05,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:45:05,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:45:05,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 79 transitions, 819 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:05,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:05,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:45:05,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:06,201 INFO L130 PetriNetUnfolder]: 1021/2119 cut-off events. [2022-12-13 01:45:06,201 INFO L131 PetriNetUnfolder]: For 13918/13918 co-relation queries the response was YES. [2022-12-13 01:45:06,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10167 conditions, 2119 events. 1021/2119 cut-off events. For 13918/13918 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13923 event pairs, 402 based on Foata normal form. 3/2122 useless extension candidates. Maximal degree in co-relation 10103. Up to 1160 conditions per place. [2022-12-13 01:45:06,212 INFO L137 encePairwiseOnDemand]: 31/45 looper letters, 124 selfloop transitions, 13 changer transitions 45/182 dead transitions. [2022-12-13 01:45:06,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 182 transitions, 1947 flow [2022-12-13 01:45:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:45:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:45:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2022-12-13 01:45:06,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2022-12-13 01:45:06,213 INFO L175 Difference]: Start difference. First operand has 101 places, 79 transitions, 819 flow. Second operand 10 states and 155 transitions. [2022-12-13 01:45:06,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 182 transitions, 1947 flow [2022-12-13 01:45:06,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 182 transitions, 1909 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 01:45:06,232 INFO L231 Difference]: Finished difference. Result has 107 places, 80 transitions, 842 flow [2022-12-13 01:45:06,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=842, PETRI_PLACES=107, PETRI_TRANSITIONS=80} [2022-12-13 01:45:06,232 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:45:06,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:06,232 INFO L89 Accepts]: Start accepts. Operand has 107 places, 80 transitions, 842 flow [2022-12-13 01:45:06,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:06,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:06,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 80 transitions, 842 flow [2022-12-13 01:45:06,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 80 transitions, 842 flow [2022-12-13 01:45:06,264 INFO L130 PetriNetUnfolder]: 68/505 cut-off events. [2022-12-13 01:45:06,264 INFO L131 PetriNetUnfolder]: For 2678/2710 co-relation queries the response was YES. [2022-12-13 01:45:06,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 505 events. 68/505 cut-off events. For 2678/2710 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4239 event pairs, 7 based on Foata normal form. 5/487 useless extension candidates. Maximal degree in co-relation 1984. Up to 99 conditions per place. [2022-12-13 01:45:06,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 80 transitions, 842 flow [2022-12-13 01:45:06,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-13 01:45:06,268 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:45:06,315 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:06,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 01:45:06,315 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 80 transitions, 849 flow [2022-12-13 01:45:06,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:06,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:06,315 INFO L214 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] [2022-12-13 01:45:06,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-13 01:45:06,316 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1484546384, now seen corresponding path program 3 times [2022-12-13 01:45:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:06,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477420812] [2022-12-13 01:45:06,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:06,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:07,018 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-13 01:45:07,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:07,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477420812] [2022-12-13 01:45:07,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477420812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:07,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:07,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:45:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298352009] [2022-12-13 01:45:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:07,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:45:07,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:07,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:45:07,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:45:07,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:45:07,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 80 transitions, 849 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:07,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:07,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:45:07,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:07,719 INFO L130 PetriNetUnfolder]: 979/2052 cut-off events. [2022-12-13 01:45:07,719 INFO L131 PetriNetUnfolder]: For 14362/14362 co-relation queries the response was YES. [2022-12-13 01:45:07,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10137 conditions, 2052 events. 979/2052 cut-off events. For 14362/14362 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13496 event pairs, 298 based on Foata normal form. 2/2054 useless extension candidates. Maximal degree in co-relation 10065. Up to 1160 conditions per place. [2022-12-13 01:45:07,732 INFO L137 encePairwiseOnDemand]: 31/46 looper letters, 158 selfloop transitions, 21 changer transitions 20/199 dead transitions. [2022-12-13 01:45:07,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 199 transitions, 2126 flow [2022-12-13 01:45:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:45:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:45:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2022-12-13 01:45:07,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3438735177865613 [2022-12-13 01:45:07,733 INFO L175 Difference]: Start difference. First operand has 103 places, 80 transitions, 849 flow. Second operand 11 states and 174 transitions. [2022-12-13 01:45:07,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 199 transitions, 2126 flow [2022-12-13 01:45:07,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 199 transitions, 2047 flow, removed 31 selfloop flow, removed 7 redundant places. [2022-12-13 01:45:07,755 INFO L231 Difference]: Finished difference. Result has 112 places, 89 transitions, 1004 flow [2022-12-13 01:45:07,755 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1004, PETRI_PLACES=112, PETRI_TRANSITIONS=89} [2022-12-13 01:45:07,755 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2022-12-13 01:45:07,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:07,755 INFO L89 Accepts]: Start accepts. Operand has 112 places, 89 transitions, 1004 flow [2022-12-13 01:45:07,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:07,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:07,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 89 transitions, 1004 flow [2022-12-13 01:45:07,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 89 transitions, 1004 flow [2022-12-13 01:45:07,790 INFO L130 PetriNetUnfolder]: 63/497 cut-off events. [2022-12-13 01:45:07,790 INFO L131 PetriNetUnfolder]: For 2784/2817 co-relation queries the response was YES. [2022-12-13 01:45:07,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 497 events. 63/497 cut-off events. For 2784/2817 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4128 event pairs, 2 based on Foata normal form. 4/481 useless extension candidates. Maximal degree in co-relation 1975. Up to 95 conditions per place. [2022-12-13 01:45:07,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 89 transitions, 1004 flow [2022-12-13 01:45:07,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 556 [2022-12-13 01:45:07,925 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:07,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 01:45:07,925 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 1020 flow [2022-12-13 01:45:07,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:07,925 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:07,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:07,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-13 01:45:07,926 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:07,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:07,926 INFO L85 PathProgramCache]: Analyzing trace with hash -498838543, now seen corresponding path program 1 times [2022-12-13 01:45:07,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:07,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862430571] [2022-12-13 01:45:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:07,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:08,467 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-13 01:45:08,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:08,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862430571] [2022-12-13 01:45:08,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862430571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:08,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:08,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:08,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313175909] [2022-12-13 01:45:08,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:08,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:08,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:08,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:08,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:08,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:45:08,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 1020 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:08,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:08,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:45:08,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:08,850 INFO L130 PetriNetUnfolder]: 949/2002 cut-off events. [2022-12-13 01:45:08,850 INFO L131 PetriNetUnfolder]: For 16517/16517 co-relation queries the response was YES. [2022-12-13 01:45:08,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10179 conditions, 2002 events. 949/2002 cut-off events. For 16517/16517 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13070 event pairs, 417 based on Foata normal form. 2/2004 useless extension candidates. Maximal degree in co-relation 10105. Up to 1160 conditions per place. [2022-12-13 01:45:08,861 INFO L137 encePairwiseOnDemand]: 39/49 looper letters, 145 selfloop transitions, 13 changer transitions 26/184 dead transitions. [2022-12-13 01:45:08,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 184 transitions, 2095 flow [2022-12-13 01:45:08,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2022-12-13 01:45:08,861 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3492063492063492 [2022-12-13 01:45:08,861 INFO L175 Difference]: Start difference. First operand has 110 places, 88 transitions, 1020 flow. Second operand 9 states and 154 transitions. [2022-12-13 01:45:08,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 184 transitions, 2095 flow [2022-12-13 01:45:08,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 184 transitions, 2022 flow, removed 24 selfloop flow, removed 7 redundant places. [2022-12-13 01:45:08,889 INFO L231 Difference]: Finished difference. Result has 115 places, 89 transitions, 995 flow [2022-12-13 01:45:08,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=995, PETRI_PLACES=115, PETRI_TRANSITIONS=89} [2022-12-13 01:45:08,892 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2022-12-13 01:45:08,892 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:08,892 INFO L89 Accepts]: Start accepts. Operand has 115 places, 89 transitions, 995 flow [2022-12-13 01:45:08,892 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:08,893 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:08,893 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 89 transitions, 995 flow [2022-12-13 01:45:08,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 89 transitions, 995 flow [2022-12-13 01:45:08,925 INFO L130 PetriNetUnfolder]: 62/480 cut-off events. [2022-12-13 01:45:08,926 INFO L131 PetriNetUnfolder]: For 2817/2851 co-relation queries the response was YES. [2022-12-13 01:45:08,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 480 events. 62/480 cut-off events. For 2817/2851 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3955 event pairs, 7 based on Foata normal form. 4/461 useless extension candidates. Maximal degree in co-relation 1971. Up to 91 conditions per place. [2022-12-13 01:45:08,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 89 transitions, 995 flow [2022-12-13 01:45:08,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 01:45:08,950 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:08,950 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 01:45:08,950 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 88 transitions, 991 flow [2022-12-13 01:45:08,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:08,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:08,951 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:08,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-13 01:45:08,951 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1507244474, now seen corresponding path program 1 times [2022-12-13 01:45:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:08,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48767220] [2022-12-13 01:45:08,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:08,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:09,131 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-13 01:45:09,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:09,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48767220] [2022-12-13 01:45:09,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48767220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:09,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:09,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:09,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080758568] [2022-12-13 01:45:09,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:09,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:09,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:09,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:09,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:09,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:45:09,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 88 transitions, 991 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:09,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:09,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:45:09,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:09,462 INFO L130 PetriNetUnfolder]: 960/2021 cut-off events. [2022-12-13 01:45:09,462 INFO L131 PetriNetUnfolder]: For 15474/15474 co-relation queries the response was YES. [2022-12-13 01:45:09,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10230 conditions, 2021 events. 960/2021 cut-off events. For 15474/15474 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13257 event pairs, 265 based on Foata normal form. 4/2025 useless extension candidates. Maximal degree in co-relation 10161. Up to 1010 conditions per place. [2022-12-13 01:45:09,473 INFO L137 encePairwiseOnDemand]: 37/49 looper letters, 102 selfloop transitions, 23 changer transitions 20/145 dead transitions. [2022-12-13 01:45:09,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 145 transitions, 1705 flow [2022-12-13 01:45:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:45:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:45:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2022-12-13 01:45:09,474 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32653061224489793 [2022-12-13 01:45:09,474 INFO L175 Difference]: Start difference. First operand has 112 places, 88 transitions, 991 flow. Second operand 7 states and 112 transitions. [2022-12-13 01:45:09,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 145 transitions, 1705 flow [2022-12-13 01:45:09,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 145 transitions, 1671 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 01:45:09,500 INFO L231 Difference]: Finished difference. Result has 116 places, 90 transitions, 1055 flow [2022-12-13 01:45:09,501 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1055, PETRI_PLACES=116, PETRI_TRANSITIONS=90} [2022-12-13 01:45:09,501 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2022-12-13 01:45:09,501 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:09,501 INFO L89 Accepts]: Start accepts. Operand has 116 places, 90 transitions, 1055 flow [2022-12-13 01:45:09,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:09,502 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:09,502 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 90 transitions, 1055 flow [2022-12-13 01:45:09,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 90 transitions, 1055 flow [2022-12-13 01:45:09,534 INFO L130 PetriNetUnfolder]: 60/501 cut-off events. [2022-12-13 01:45:09,535 INFO L131 PetriNetUnfolder]: For 3355/3397 co-relation queries the response was YES. [2022-12-13 01:45:09,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2153 conditions, 501 events. 60/501 cut-off events. For 3355/3397 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4182 event pairs, 5 based on Foata normal form. 4/483 useless extension candidates. Maximal degree in co-relation 2094. Up to 92 conditions per place. [2022-12-13 01:45:09,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 90 transitions, 1055 flow [2022-12-13 01:45:09,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 560 [2022-12-13 01:45:09,540 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:09,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 01:45:09,541 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 1055 flow [2022-12-13 01:45:09,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:09,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:09,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:09,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-13 01:45:09,541 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:09,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:09,541 INFO L85 PathProgramCache]: Analyzing trace with hash -891485924, now seen corresponding path program 2 times [2022-12-13 01:45:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:09,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084646794] [2022-12-13 01:45:09,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:09,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:10,099 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-13 01:45:10,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:10,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084646794] [2022-12-13 01:45:10,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084646794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:10,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:10,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:45:10,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007949731] [2022-12-13 01:45:10,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:10,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:45:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:45:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:45:10,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:45:10,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 1055 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:10,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:10,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:45:10,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:10,711 INFO L130 PetriNetUnfolder]: 921/1975 cut-off events. [2022-12-13 01:45:10,711 INFO L131 PetriNetUnfolder]: For 16859/16859 co-relation queries the response was YES. [2022-12-13 01:45:10,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10303 conditions, 1975 events. 921/1975 cut-off events. For 16859/16859 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13147 event pairs, 317 based on Foata normal form. 3/1978 useless extension candidates. Maximal degree in co-relation 10233. Up to 1160 conditions per place. [2022-12-13 01:45:10,723 INFO L137 encePairwiseOnDemand]: 33/49 looper letters, 132 selfloop transitions, 19 changer transitions 40/191 dead transitions. [2022-12-13 01:45:10,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 191 transitions, 2182 flow [2022-12-13 01:45:10,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2022-12-13 01:45:10,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3673469387755102 [2022-12-13 01:45:10,724 INFO L175 Difference]: Start difference. First operand has 114 places, 90 transitions, 1055 flow. Second operand 9 states and 162 transitions. [2022-12-13 01:45:10,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 191 transitions, 2182 flow [2022-12-13 01:45:10,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 191 transitions, 2145 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 01:45:10,751 INFO L231 Difference]: Finished difference. Result has 121 places, 87 transitions, 1000 flow [2022-12-13 01:45:10,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1000, PETRI_PLACES=121, PETRI_TRANSITIONS=87} [2022-12-13 01:45:10,752 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places. [2022-12-13 01:45:10,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:10,752 INFO L89 Accepts]: Start accepts. Operand has 121 places, 87 transitions, 1000 flow [2022-12-13 01:45:10,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:10,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:10,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 87 transitions, 1000 flow [2022-12-13 01:45:10,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 87 transitions, 1000 flow [2022-12-13 01:45:10,784 INFO L130 PetriNetUnfolder]: 54/436 cut-off events. [2022-12-13 01:45:10,784 INFO L131 PetriNetUnfolder]: For 3008/3030 co-relation queries the response was YES. [2022-12-13 01:45:10,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 436 events. 54/436 cut-off events. For 3008/3030 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3490 event pairs, 2 based on Foata normal form. 3/420 useless extension candidates. Maximal degree in co-relation 1891. Up to 76 conditions per place. [2022-12-13 01:45:10,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 87 transitions, 1000 flow [2022-12-13 01:45:10,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-13 01:45:10,790 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:10,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 01:45:10,790 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 87 transitions, 1000 flow [2022-12-13 01:45:10,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:10,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:10,791 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:10,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-13 01:45:10,791 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 353440020, now seen corresponding path program 1 times [2022-12-13 01:45:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:10,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620157320] [2022-12-13 01:45:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:11,464 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-13 01:45:11,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:11,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620157320] [2022-12-13 01:45:11,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620157320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:11,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:11,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:11,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013835755] [2022-12-13 01:45:11,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:11,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:11,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:11,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:11,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:11,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:45:11,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 87 transitions, 1000 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:11,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:11,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:45:11,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:11,930 INFO L130 PetriNetUnfolder]: 854/1813 cut-off events. [2022-12-13 01:45:11,930 INFO L131 PetriNetUnfolder]: For 15419/15419 co-relation queries the response was YES. [2022-12-13 01:45:11,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 1813 events. 854/1813 cut-off events. For 15419/15419 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11733 event pairs, 350 based on Foata normal form. 2/1815 useless extension candidates. Maximal degree in co-relation 9448. Up to 1160 conditions per place. [2022-12-13 01:45:11,940 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 132 selfloop transitions, 13 changer transitions 35/180 dead transitions. [2022-12-13 01:45:11,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 180 transitions, 2095 flow [2022-12-13 01:45:11,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2022-12-13 01:45:11,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3967391304347826 [2022-12-13 01:45:11,941 INFO L175 Difference]: Start difference. First operand has 117 places, 87 transitions, 1000 flow. Second operand 8 states and 146 transitions. [2022-12-13 01:45:11,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 180 transitions, 2095 flow [2022-12-13 01:45:11,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 180 transitions, 2010 flow, removed 20 selfloop flow, removed 10 redundant places. [2022-12-13 01:45:11,963 INFO L231 Difference]: Finished difference. Result has 117 places, 88 transitions, 987 flow [2022-12-13 01:45:11,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=987, PETRI_PLACES=117, PETRI_TRANSITIONS=88} [2022-12-13 01:45:11,963 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2022-12-13 01:45:11,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:11,963 INFO L89 Accepts]: Start accepts. Operand has 117 places, 88 transitions, 987 flow [2022-12-13 01:45:11,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:11,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:11,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 88 transitions, 987 flow [2022-12-13 01:45:11,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 88 transitions, 987 flow [2022-12-13 01:45:11,995 INFO L130 PetriNetUnfolder]: 53/434 cut-off events. [2022-12-13 01:45:11,995 INFO L131 PetriNetUnfolder]: For 2899/2920 co-relation queries the response was YES. [2022-12-13 01:45:11,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 434 events. 53/434 cut-off events. For 2899/2920 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3509 event pairs, 2 based on Foata normal form. 3/416 useless extension candidates. Maximal degree in co-relation 1849. Up to 76 conditions per place. [2022-12-13 01:45:11,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 88 transitions, 987 flow [2022-12-13 01:45:11,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-13 01:45:12,002 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:12,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 01:45:12,002 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 88 transitions, 987 flow [2022-12-13 01:45:12,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:12,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:12,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:12,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-12-13 01:45:12,003 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash -182632950, now seen corresponding path program 2 times [2022-12-13 01:45:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:12,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772676995] [2022-12-13 01:45:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:12,159 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-13 01:45:12,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:12,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772676995] [2022-12-13 01:45:12,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772676995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:12,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:12,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:45:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912328535] [2022-12-13 01:45:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:12,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:45:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:12,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:45:12,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:45:12,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:45:12,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 88 transitions, 987 flow. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:12,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:12,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:45:12,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:12,438 INFO L130 PetriNetUnfolder]: 842/1801 cut-off events. [2022-12-13 01:45:12,439 INFO L131 PetriNetUnfolder]: For 14370/14370 co-relation queries the response was YES. [2022-12-13 01:45:12,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9261 conditions, 1801 events. 842/1801 cut-off events. For 14370/14370 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11714 event pairs, 305 based on Foata normal form. 2/1803 useless extension candidates. Maximal degree in co-relation 9190. Up to 1062 conditions per place. [2022-12-13 01:45:12,447 INFO L137 encePairwiseOnDemand]: 37/46 looper letters, 91 selfloop transitions, 13 changer transitions 26/130 dead transitions. [2022-12-13 01:45:12,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 130 transitions, 1546 flow [2022-12-13 01:45:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:45:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:45:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2022-12-13 01:45:12,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36231884057971014 [2022-12-13 01:45:12,448 INFO L175 Difference]: Start difference. First operand has 115 places, 88 transitions, 987 flow. Second operand 6 states and 100 transitions. [2022-12-13 01:45:12,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 130 transitions, 1546 flow [2022-12-13 01:45:12,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 130 transitions, 1518 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-13 01:45:12,467 INFO L231 Difference]: Finished difference. Result has 117 places, 81 transitions, 909 flow [2022-12-13 01:45:12,467 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=909, PETRI_PLACES=117, PETRI_TRANSITIONS=81} [2022-12-13 01:45:12,467 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2022-12-13 01:45:12,467 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:12,467 INFO L89 Accepts]: Start accepts. Operand has 117 places, 81 transitions, 909 flow [2022-12-13 01:45:12,468 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:12,468 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:12,468 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 81 transitions, 909 flow [2022-12-13 01:45:12,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 81 transitions, 909 flow [2022-12-13 01:45:12,499 INFO L130 PetriNetUnfolder]: 48/412 cut-off events. [2022-12-13 01:45:12,499 INFO L131 PetriNetUnfolder]: For 2917/2938 co-relation queries the response was YES. [2022-12-13 01:45:12,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 412 events. 48/412 cut-off events. For 2917/2938 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3281 event pairs, 2 based on Foata normal form. 3/397 useless extension candidates. Maximal degree in co-relation 1759. Up to 68 conditions per place. [2022-12-13 01:45:12,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 81 transitions, 909 flow [2022-12-13 01:45:12,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-13 01:45:12,504 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:12,505 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 01:45:12,505 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 81 transitions, 909 flow [2022-12-13 01:45:12,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:12,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:12,505 INFO L214 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] [2022-12-13 01:45:12,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-12-13 01:45:12,505 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:12,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:12,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1890946992, now seen corresponding path program 4 times [2022-12-13 01:45:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:12,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94758512] [2022-12-13 01:45:12,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:12,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:13,130 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-13 01:45:13,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:13,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94758512] [2022-12-13 01:45:13,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94758512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:13,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:13,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:45:13,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93497155] [2022-12-13 01:45:13,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:13,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:45:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:13,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:45:13,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:45:13,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:45:13,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 81 transitions, 909 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:13,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:13,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:45:13,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:13,659 INFO L130 PetriNetUnfolder]: 783/1672 cut-off events. [2022-12-13 01:45:13,659 INFO L131 PetriNetUnfolder]: For 13961/13961 co-relation queries the response was YES. [2022-12-13 01:45:13,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8689 conditions, 1672 events. 783/1672 cut-off events. For 13961/13961 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10646 event pairs, 289 based on Foata normal form. 2/1674 useless extension candidates. Maximal degree in co-relation 8456. Up to 1160 conditions per place. [2022-12-13 01:45:13,673 INFO L137 encePairwiseOnDemand]: 34/45 looper letters, 100 selfloop transitions, 9 changer transitions 57/166 dead transitions. [2022-12-13 01:45:13,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 166 transitions, 1830 flow [2022-12-13 01:45:13,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:45:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:45:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-12-13 01:45:13,674 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31777777777777777 [2022-12-13 01:45:13,674 INFO L175 Difference]: Start difference. First operand has 115 places, 81 transitions, 909 flow. Second operand 10 states and 143 transitions. [2022-12-13 01:45:13,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 166 transitions, 1830 flow [2022-12-13 01:45:13,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 166 transitions, 1740 flow, removed 16 selfloop flow, removed 13 redundant places. [2022-12-13 01:45:13,703 INFO L231 Difference]: Finished difference. Result has 114 places, 76 transitions, 790 flow [2022-12-13 01:45:13,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=790, PETRI_PLACES=114, PETRI_TRANSITIONS=76} [2022-12-13 01:45:13,703 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places. [2022-12-13 01:45:13,704 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:13,704 INFO L89 Accepts]: Start accepts. Operand has 114 places, 76 transitions, 790 flow [2022-12-13 01:45:13,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:13,705 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:13,705 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 76 transitions, 790 flow [2022-12-13 01:45:13,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 76 transitions, 790 flow [2022-12-13 01:45:13,741 INFO L130 PetriNetUnfolder]: 44/349 cut-off events. [2022-12-13 01:45:13,741 INFO L131 PetriNetUnfolder]: For 1801/1820 co-relation queries the response was YES. [2022-12-13 01:45:13,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 349 events. 44/349 cut-off events. For 1801/1820 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2556 event pairs, 1 based on Foata normal form. 3/338 useless extension candidates. Maximal degree in co-relation 1375. Up to 56 conditions per place. [2022-12-13 01:45:13,744 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 76 transitions, 790 flow [2022-12-13 01:45:13,744 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 01:45:13,744 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:13,745 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 01:45:13,745 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 76 transitions, 790 flow [2022-12-13 01:45:13,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:13,745 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:13,745 INFO L214 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] [2022-12-13 01:45:13,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-12-13 01:45:13,745 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:13,745 INFO L85 PathProgramCache]: Analyzing trace with hash 720230063, now seen corresponding path program 1 times [2022-12-13 01:45:13,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:13,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186727750] [2022-12-13 01:45:13,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:13,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:14,464 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-13 01:45:14,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:14,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186727750] [2022-12-13 01:45:14,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186727750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:14,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:14,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:45:14,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330276658] [2022-12-13 01:45:14,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:14,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:45:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:14,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:45:14,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:45:14,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:45:14,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 76 transitions, 790 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:14,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:14,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:45:14,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:14,937 INFO L130 PetriNetUnfolder]: 655/1375 cut-off events. [2022-12-13 01:45:14,937 INFO L131 PetriNetUnfolder]: For 9566/9566 co-relation queries the response was YES. [2022-12-13 01:45:14,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6863 conditions, 1375 events. 655/1375 cut-off events. For 9566/9566 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8061 event pairs, 282 based on Foata normal form. 2/1377 useless extension candidates. Maximal degree in co-relation 6804. Up to 1160 conditions per place. [2022-12-13 01:45:14,943 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 74 selfloop transitions, 7 changer transitions 40/121 dead transitions. [2022-12-13 01:45:14,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 121 transitions, 1351 flow [2022-12-13 01:45:14,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:45:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:45:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2022-12-13 01:45:14,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2222222222222222 [2022-12-13 01:45:14,944 INFO L175 Difference]: Start difference. First operand has 106 places, 76 transitions, 790 flow. Second operand 10 states and 100 transitions. [2022-12-13 01:45:14,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 121 transitions, 1351 flow [2022-12-13 01:45:14,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 121 transitions, 1283 flow, removed 22 selfloop flow, removed 12 redundant places. [2022-12-13 01:45:14,956 INFO L231 Difference]: Finished difference. Result has 107 places, 73 transitions, 728 flow [2022-12-13 01:45:14,956 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=728, PETRI_PLACES=107, PETRI_TRANSITIONS=73} [2022-12-13 01:45:14,956 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:45:14,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:14,956 INFO L89 Accepts]: Start accepts. Operand has 107 places, 73 transitions, 728 flow [2022-12-13 01:45:14,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:14,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:14,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 73 transitions, 728 flow [2022-12-13 01:45:14,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 73 transitions, 728 flow [2022-12-13 01:45:14,976 INFO L130 PetriNetUnfolder]: 43/308 cut-off events. [2022-12-13 01:45:14,976 INFO L131 PetriNetUnfolder]: For 1400/1414 co-relation queries the response was YES. [2022-12-13 01:45:14,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 308 events. 43/308 cut-off events. For 1400/1414 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2227 event pairs, 1 based on Foata normal form. 3/298 useless extension candidates. Maximal degree in co-relation 1181. Up to 52 conditions per place. [2022-12-13 01:45:14,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 73 transitions, 728 flow [2022-12-13 01:45:14,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-13 01:45:16,967 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:16,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2011 [2022-12-13 01:45:16,968 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 72 transitions, 722 flow [2022-12-13 01:45:16,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:16,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:16,968 INFO L214 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] [2022-12-13 01:45:16,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2022-12-13 01:45:16,968 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2093369153, now seen corresponding path program 1 times [2022-12-13 01:45:16,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:16,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599850293] [2022-12-13 01:45:16,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:16,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:17,528 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-13 01:45:17,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:17,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599850293] [2022-12-13 01:45:17,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599850293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:17,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:17,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516997527] [2022-12-13 01:45:17,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:17,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:17,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:17,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:17,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:17,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:45:17,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 72 transitions, 722 flow. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:17,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:17,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:45:17,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:17,960 INFO L130 PetriNetUnfolder]: 1215/2473 cut-off events. [2022-12-13 01:45:17,960 INFO L131 PetriNetUnfolder]: For 15443/15443 co-relation queries the response was YES. [2022-12-13 01:45:17,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12019 conditions, 2473 events. 1215/2473 cut-off events. For 15443/15443 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16701 event pairs, 288 based on Foata normal form. 6/2479 useless extension candidates. Maximal degree in co-relation 11959. Up to 841 conditions per place. [2022-12-13 01:45:17,973 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 155 selfloop transitions, 28 changer transitions 47/230 dead transitions. [2022-12-13 01:45:17,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 230 transitions, 2366 flow [2022-12-13 01:45:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 01:45:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 01:45:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 204 transitions. [2022-12-13 01:45:17,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2022-12-13 01:45:17,974 INFO L175 Difference]: Start difference. First operand has 97 places, 72 transitions, 722 flow. Second operand 12 states and 204 transitions. [2022-12-13 01:45:17,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 230 transitions, 2366 flow [2022-12-13 01:45:17,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 230 transitions, 2276 flow, removed 25 selfloop flow, removed 11 redundant places. [2022-12-13 01:45:17,999 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 889 flow [2022-12-13 01:45:17,999 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=889, PETRI_PLACES=100, PETRI_TRANSITIONS=85} [2022-12-13 01:45:17,999 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2022-12-13 01:45:17,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:17,999 INFO L89 Accepts]: Start accepts. Operand has 100 places, 85 transitions, 889 flow [2022-12-13 01:45:18,000 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:18,000 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:18,000 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 85 transitions, 889 flow [2022-12-13 01:45:18,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 85 transitions, 889 flow [2022-12-13 01:45:18,035 INFO L130 PetriNetUnfolder]: 85/587 cut-off events. [2022-12-13 01:45:18,035 INFO L131 PetriNetUnfolder]: For 2551/2579 co-relation queries the response was YES. [2022-12-13 01:45:18,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2307 conditions, 587 events. 85/587 cut-off events. For 2551/2579 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5200 event pairs, 2 based on Foata normal form. 6/567 useless extension candidates. Maximal degree in co-relation 2253. Up to 103 conditions per place. [2022-12-13 01:45:18,039 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 85 transitions, 889 flow [2022-12-13 01:45:18,039 INFO L226 LiptonReduction]: Number of co-enabled transitions 520 [2022-12-13 01:45:18,042 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:18,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 01:45:18,042 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 85 transitions, 889 flow [2022-12-13 01:45:18,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:18,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:18,042 INFO L214 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] [2022-12-13 01:45:18,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-12-13 01:45:18,043 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:18,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:18,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1493030089, now seen corresponding path program 2 times [2022-12-13 01:45:18,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:18,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138269272] [2022-12-13 01:45:18,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:18,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:18,759 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-13 01:45:18,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:18,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138269272] [2022-12-13 01:45:18,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138269272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:18,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:18,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:45:18,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703675134] [2022-12-13 01:45:18,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:18,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:45:18,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:18,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:45:18,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:45:18,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:45:18,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 85 transitions, 889 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:18,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:18,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:45:18,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:19,310 INFO L130 PetriNetUnfolder]: 1149/2374 cut-off events. [2022-12-13 01:45:19,310 INFO L131 PetriNetUnfolder]: For 14206/14206 co-relation queries the response was YES. [2022-12-13 01:45:19,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11442 conditions, 2374 events. 1149/2374 cut-off events. For 14206/14206 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16119 event pairs, 330 based on Foata normal form. 3/2377 useless extension candidates. Maximal degree in co-relation 11379. Up to 1088 conditions per place. [2022-12-13 01:45:19,320 INFO L137 encePairwiseOnDemand]: 30/45 looper letters, 145 selfloop transitions, 22 changer transitions 33/200 dead transitions. [2022-12-13 01:45:19,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 200 transitions, 2134 flow [2022-12-13 01:45:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:45:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:45:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 168 transitions. [2022-12-13 01:45:19,320 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2022-12-13 01:45:19,321 INFO L175 Difference]: Start difference. First operand has 98 places, 85 transitions, 889 flow. Second operand 10 states and 168 transitions. [2022-12-13 01:45:19,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 200 transitions, 2134 flow [2022-12-13 01:45:19,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 200 transitions, 2093 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 01:45:19,339 INFO L231 Difference]: Finished difference. Result has 107 places, 87 transitions, 963 flow [2022-12-13 01:45:19,339 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=963, PETRI_PLACES=107, PETRI_TRANSITIONS=87} [2022-12-13 01:45:19,339 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:45:19,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:19,339 INFO L89 Accepts]: Start accepts. Operand has 107 places, 87 transitions, 963 flow [2022-12-13 01:45:19,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:19,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:19,340 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 87 transitions, 963 flow [2022-12-13 01:45:19,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 87 transitions, 963 flow [2022-12-13 01:45:19,373 INFO L130 PetriNetUnfolder]: 77/553 cut-off events. [2022-12-13 01:45:19,373 INFO L131 PetriNetUnfolder]: For 2821/2848 co-relation queries the response was YES. [2022-12-13 01:45:19,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 553 events. 77/553 cut-off events. For 2821/2848 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4713 event pairs, 1 based on Foata normal form. 5/535 useless extension candidates. Maximal degree in co-relation 2222. Up to 104 conditions per place. [2022-12-13 01:45:19,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 87 transitions, 963 flow [2022-12-13 01:45:19,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-13 01:45:19,491 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (not (= (ite (= (mod v_~e2~0_229 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (or (<= v_~n1~0_313 v_~n2~0_285) (= v_~n2~0_285 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= v_~i~0_491 (select (select |v_#memory_int_367| v_~f~0.base_290) (+ v_~f~0.offset_297 (* v_~i1~0_227 4)))) (= v_~i1~0_227 v_~i~0_492)) InVars {~n2~0=v_~n2~0_285, ~i~0=v_~i~0_492, ~f~0.base=v_~f~0.base_290, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229} OutVars{~n2~0=v_~n2~0_285, ~i~0=v_~i~0_491, ~f~0.base=v_~f~0.base_290, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~i1~0=v_~i1~0_227, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_144|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 01:45:19,740 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] L53-->L97: Formula: (and (= v_~e2~0_167 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|) (= (+ v_~tmp1~0_123 1) v_~n1~0_225) (= v_~e1~0_133 0) (= (+ v_~tmp2~0_121 1) v_~n2~0_206) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| (ite (= (mod v_~e1~0_133 256) 0) 1 0))) InVars {~tmp2~0=v_~tmp2~0_121, ~tmp1~0=v_~tmp1~0_123} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|, ~n2~0=v_~n2~0_206, ~n1~0=v_~n1~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77|, ~tmp2~0=v_~tmp2~0_121, ~e2~0=v_~e2~0_167, ~tmp1~0=v_~tmp1~0_123, ~e1~0=v_~e1~0_133} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0, ~e1~0] and [871] L59-->thread1EXIT: Formula: (and (= v_~i1~0_531 v_~i~0_1486) (= |v_thread1Thread1of1ForFork1_#res#1.offset_62| 0) (= (select (select |v_#memory_int_908| v_~f~0.base_800) (+ v_~f~0.offset_807 (* v_~i1~0_531 4))) v_~i~0_1485) (= v_~n1~0_845 0) (not (= (ite (= (mod v_~e2~0_748 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_#res#1.base_62| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_462| 0)) (not (= (ite (or (<= v_~n1~0_846 v_~n2~0_922) (= v_~n2~0_922 0)) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_462| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_462|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_462| (ite (and (<= 0 v_~i~0_1485) (< v_~i~0_1485 v_~n~0_494)) 1 0))) InVars {~n2~0=v_~n2~0_922, ~i~0=v_~i~0_1486, ~f~0.base=v_~f~0.base_800, ~n1~0=v_~n1~0_846, #memory_int=|v_#memory_int_908|, ~n~0=v_~n~0_494, ~f~0.offset=v_~f~0.offset_807, ~e2~0=v_~e2~0_748} OutVars{~n2~0=v_~n2~0_922, ~i~0=v_~i~0_1485, ~n1~0=v_~n1~0_845, ~f~0.base=v_~f~0.base_800, ~i1~0=v_~i1~0_531, ~f~0.offset=v_~f~0.offset_807, ~e2~0=v_~e2~0_748, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_462|, #memory_int=|v_#memory_int_908|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_62|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_62|, ~n~0=v_~n~0_494, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_438|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_462|} AuxVars[] AssignedVars[~i~0, ~n1~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:45:19,848 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 01:45:19,848 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 509 [2022-12-13 01:45:19,848 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 1037 flow [2022-12-13 01:45:19,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:19,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:19,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:19,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2022-12-13 01:45:19,849 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:19,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:19,849 INFO L85 PathProgramCache]: Analyzing trace with hash 305711649, now seen corresponding path program 1 times [2022-12-13 01:45:19,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:19,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096436619] [2022-12-13 01:45:19,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:19,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:20,336 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-13 01:45:20,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:20,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096436619] [2022-12-13 01:45:20,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096436619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:20,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:20,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:20,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810274912] [2022-12-13 01:45:20,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:20,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:20,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:20,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:20,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 01:45:20,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 1037 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:20,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:20,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 01:45:20,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:20,674 INFO L130 PetriNetUnfolder]: 1034/2154 cut-off events. [2022-12-13 01:45:20,674 INFO L131 PetriNetUnfolder]: For 19146/19146 co-relation queries the response was YES. [2022-12-13 01:45:20,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11029 conditions, 2154 events. 1034/2154 cut-off events. For 19146/19146 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14425 event pairs, 389 based on Foata normal form. 3/2157 useless extension candidates. Maximal degree in co-relation 10970. Up to 1088 conditions per place. [2022-12-13 01:45:20,683 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 133 selfloop transitions, 14 changer transitions 36/183 dead transitions. [2022-12-13 01:45:20,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 183 transitions, 2119 flow [2022-12-13 01:45:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2022-12-13 01:45:20,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37259615384615385 [2022-12-13 01:45:20,684 INFO L175 Difference]: Start difference. First operand has 104 places, 86 transitions, 1037 flow. Second operand 8 states and 155 transitions. [2022-12-13 01:45:20,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 183 transitions, 2119 flow [2022-12-13 01:45:20,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 183 transitions, 2020 flow, removed 23 selfloop flow, removed 10 redundant places. [2022-12-13 01:45:20,708 INFO L231 Difference]: Finished difference. Result has 103 places, 79 transitions, 822 flow [2022-12-13 01:45:20,708 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=822, PETRI_PLACES=103, PETRI_TRANSITIONS=79} [2022-12-13 01:45:20,717 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2022-12-13 01:45:20,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:20,717 INFO L89 Accepts]: Start accepts. Operand has 103 places, 79 transitions, 822 flow [2022-12-13 01:45:20,717 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:20,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:20,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 79 transitions, 822 flow [2022-12-13 01:45:20,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 79 transitions, 822 flow [2022-12-13 01:45:20,748 INFO L130 PetriNetUnfolder]: 70/500 cut-off events. [2022-12-13 01:45:20,748 INFO L131 PetriNetUnfolder]: For 2478/2505 co-relation queries the response was YES. [2022-12-13 01:45:20,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 500 events. 70/500 cut-off events. For 2478/2505 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4175 event pairs, 6 based on Foata normal form. 5/482 useless extension candidates. Maximal degree in co-relation 1907. Up to 104 conditions per place. [2022-12-13 01:45:20,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 79 transitions, 822 flow [2022-12-13 01:45:20,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-13 01:45:20,760 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:20,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 01:45:20,761 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 79 transitions, 822 flow [2022-12-13 01:45:20,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:20,761 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:20,761 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:20,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2022-12-13 01:45:20,761 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1367591309, now seen corresponding path program 1 times [2022-12-13 01:45:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:20,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958258792] [2022-12-13 01:45:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:21,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-13 01:45:21,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:21,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958258792] [2022-12-13 01:45:21,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958258792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:21,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:21,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298466493] [2022-12-13 01:45:21,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:21,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:21,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:21,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:21,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:21,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:45:21,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 79 transitions, 822 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:21,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:21,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:45:21,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:21,894 INFO L130 PetriNetUnfolder]: 960/2013 cut-off events. [2022-12-13 01:45:21,894 INFO L131 PetriNetUnfolder]: For 14089/14089 co-relation queries the response was YES. [2022-12-13 01:45:21,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9814 conditions, 2013 events. 960/2013 cut-off events. For 14089/14089 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13159 event pairs, 291 based on Foata normal form. 2/2015 useless extension candidates. Maximal degree in co-relation 9751. Up to 1088 conditions per place. [2022-12-13 01:45:21,903 INFO L137 encePairwiseOnDemand]: 34/47 looper letters, 164 selfloop transitions, 20 changer transitions 11/195 dead transitions. [2022-12-13 01:45:21,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 195 transitions, 2056 flow [2022-12-13 01:45:21,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:45:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:45:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2022-12-13 01:45:21,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3595744680851064 [2022-12-13 01:45:21,919 INFO L175 Difference]: Start difference. First operand has 99 places, 79 transitions, 822 flow. Second operand 10 states and 169 transitions. [2022-12-13 01:45:21,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 195 transitions, 2056 flow [2022-12-13 01:45:21,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 195 transitions, 2002 flow, removed 13 selfloop flow, removed 8 redundant places. [2022-12-13 01:45:21,936 INFO L231 Difference]: Finished difference. Result has 105 places, 86 transitions, 952 flow [2022-12-13 01:45:21,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=952, PETRI_PLACES=105, PETRI_TRANSITIONS=86} [2022-12-13 01:45:21,937 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2022-12-13 01:45:21,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:21,937 INFO L89 Accepts]: Start accepts. Operand has 105 places, 86 transitions, 952 flow [2022-12-13 01:45:21,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:21,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:21,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 86 transitions, 952 flow [2022-12-13 01:45:21,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 86 transitions, 952 flow [2022-12-13 01:45:21,969 INFO L130 PetriNetUnfolder]: 66/511 cut-off events. [2022-12-13 01:45:21,969 INFO L131 PetriNetUnfolder]: For 2682/2709 co-relation queries the response was YES. [2022-12-13 01:45:21,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2015 conditions, 511 events. 66/511 cut-off events. For 2682/2709 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4263 event pairs, 1 based on Foata normal form. 5/494 useless extension candidates. Maximal degree in co-relation 1961. Up to 105 conditions per place. [2022-12-13 01:45:21,972 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 86 transitions, 952 flow [2022-12-13 01:45:21,972 INFO L226 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-13 01:45:22,087 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:22,088 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 01:45:22,088 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 968 flow [2022-12-13 01:45:22,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:22,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:22,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:22,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2022-12-13 01:45:22,088 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:22,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1167149808, now seen corresponding path program 1 times [2022-12-13 01:45:22,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:22,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857396538] [2022-12-13 01:45:22,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:22,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:22,846 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-13 01:45:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:22,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857396538] [2022-12-13 01:45:22,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857396538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:22,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:22,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:22,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052764635] [2022-12-13 01:45:22,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:22,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:22,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:22,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:22,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:45:22,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 968 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:22,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:22,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:45:22,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:23,312 INFO L130 PetriNetUnfolder]: 1011/2106 cut-off events. [2022-12-13 01:45:23,312 INFO L131 PetriNetUnfolder]: For 18894/18894 co-relation queries the response was YES. [2022-12-13 01:45:23,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10806 conditions, 2106 events. 1011/2106 cut-off events. For 18894/18894 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13935 event pairs, 383 based on Foata normal form. 2/2108 useless extension candidates. Maximal degree in co-relation 10741. Up to 1088 conditions per place. [2022-12-13 01:45:23,325 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 150 selfloop transitions, 18 changer transitions 16/184 dead transitions. [2022-12-13 01:45:23,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 184 transitions, 2142 flow [2022-12-13 01:45:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2022-12-13 01:45:23,326 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-13 01:45:23,326 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 968 flow. Second operand 8 states and 155 transitions. [2022-12-13 01:45:23,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 184 transitions, 2142 flow [2022-12-13 01:45:23,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 184 transitions, 2036 flow, removed 39 selfloop flow, removed 8 redundant places. [2022-12-13 01:45:23,351 INFO L231 Difference]: Finished difference. Result has 105 places, 90 transitions, 1060 flow [2022-12-13 01:45:23,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1060, PETRI_PLACES=105, PETRI_TRANSITIONS=90} [2022-12-13 01:45:23,352 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2022-12-13 01:45:23,352 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:23,352 INFO L89 Accepts]: Start accepts. Operand has 105 places, 90 transitions, 1060 flow [2022-12-13 01:45:23,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:23,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:23,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 90 transitions, 1060 flow [2022-12-13 01:45:23,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 90 transitions, 1060 flow [2022-12-13 01:45:23,387 INFO L130 PetriNetUnfolder]: 71/533 cut-off events. [2022-12-13 01:45:23,388 INFO L131 PetriNetUnfolder]: For 3257/3302 co-relation queries the response was YES. [2022-12-13 01:45:23,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2150 conditions, 533 events. 71/533 cut-off events. For 3257/3302 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4539 event pairs, 1 based on Foata normal form. 7/511 useless extension candidates. Maximal degree in co-relation 2097. Up to 110 conditions per place. [2022-12-13 01:45:23,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 90 transitions, 1060 flow [2022-12-13 01:45:23,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-13 01:45:23,394 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:23,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 01:45:23,395 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 90 transitions, 1060 flow [2022-12-13 01:45:23,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:23,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:23,395 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:23,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2022-12-13 01:45:23,395 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:23,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2131457056, now seen corresponding path program 2 times [2022-12-13 01:45:23,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:23,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423826025] [2022-12-13 01:45:23,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:23,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:24,031 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-13 01:45:24,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:24,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423826025] [2022-12-13 01:45:24,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423826025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:24,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:24,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:24,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387314347] [2022-12-13 01:45:24,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:24,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:24,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:24,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:24,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:24,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:45:24,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 90 transitions, 1060 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:24,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:24,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:45:24,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:24,443 INFO L130 PetriNetUnfolder]: 1017/2136 cut-off events. [2022-12-13 01:45:24,443 INFO L131 PetriNetUnfolder]: For 17912/17912 co-relation queries the response was YES. [2022-12-13 01:45:24,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10688 conditions, 2136 events. 1017/2136 cut-off events. For 17912/17912 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14209 event pairs, 427 based on Foata normal form. 2/2138 useless extension candidates. Maximal degree in co-relation 10624. Up to 1088 conditions per place. [2022-12-13 01:45:24,454 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 146 selfloop transitions, 14 changer transitions 24/184 dead transitions. [2022-12-13 01:45:24,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 184 transitions, 2108 flow [2022-12-13 01:45:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:24,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2022-12-13 01:45:24,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3875 [2022-12-13 01:45:24,455 INFO L175 Difference]: Start difference. First operand has 104 places, 90 transitions, 1060 flow. Second operand 8 states and 155 transitions. [2022-12-13 01:45:24,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 184 transitions, 2108 flow [2022-12-13 01:45:24,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 184 transitions, 2075 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 01:45:24,480 INFO L231 Difference]: Finished difference. Result has 108 places, 86 transitions, 966 flow [2022-12-13 01:45:24,480 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=966, PETRI_PLACES=108, PETRI_TRANSITIONS=86} [2022-12-13 01:45:24,480 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:45:24,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:24,480 INFO L89 Accepts]: Start accepts. Operand has 108 places, 86 transitions, 966 flow [2022-12-13 01:45:24,481 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:24,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:24,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 86 transitions, 966 flow [2022-12-13 01:45:24,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 86 transitions, 966 flow [2022-12-13 01:45:24,513 INFO L130 PetriNetUnfolder]: 67/527 cut-off events. [2022-12-13 01:45:24,514 INFO L131 PetriNetUnfolder]: For 2917/2947 co-relation queries the response was YES. [2022-12-13 01:45:24,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 527 events. 67/527 cut-off events. For 2917/2947 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4485 event pairs, 2 based on Foata normal form. 6/507 useless extension candidates. Maximal degree in co-relation 2008. Up to 104 conditions per place. [2022-12-13 01:45:24,517 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 86 transitions, 966 flow [2022-12-13 01:45:24,517 INFO L226 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-13 01:45:24,518 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:24,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 01:45:24,518 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 86 transitions, 966 flow [2022-12-13 01:45:24,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:24,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:24,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:24,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2022-12-13 01:45:24,519 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:24,519 INFO L85 PathProgramCache]: Analyzing trace with hash 890100889, now seen corresponding path program 1 times [2022-12-13 01:45:24,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:24,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677053823] [2022-12-13 01:45:24,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:25,257 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-13 01:45:25,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:25,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677053823] [2022-12-13 01:45:25,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677053823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:25,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:25,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424535937] [2022-12-13 01:45:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:25,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:25,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:45:25,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 86 transitions, 966 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:25,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:25,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:45:25,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:25,730 INFO L130 PetriNetUnfolder]: 961/2004 cut-off events. [2022-12-13 01:45:25,730 INFO L131 PetriNetUnfolder]: For 15743/15743 co-relation queries the response was YES. [2022-12-13 01:45:25,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9930 conditions, 2004 events. 961/2004 cut-off events. For 15743/15743 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13042 event pairs, 305 based on Foata normal form. 2/2006 useless extension candidates. Maximal degree in co-relation 9871. Up to 1088 conditions per place. [2022-12-13 01:45:25,740 INFO L137 encePairwiseOnDemand]: 36/50 looper letters, 148 selfloop transitions, 21 changer transitions 16/185 dead transitions. [2022-12-13 01:45:25,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 185 transitions, 2047 flow [2022-12-13 01:45:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2022-12-13 01:45:25,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3511111111111111 [2022-12-13 01:45:25,741 INFO L175 Difference]: Start difference. First operand has 105 places, 86 transitions, 966 flow. Second operand 9 states and 158 transitions. [2022-12-13 01:45:25,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 185 transitions, 2047 flow [2022-12-13 01:45:25,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 185 transitions, 2007 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 01:45:25,763 INFO L231 Difference]: Finished difference. Result has 107 places, 87 transitions, 999 flow [2022-12-13 01:45:25,763 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=999, PETRI_PLACES=107, PETRI_TRANSITIONS=87} [2022-12-13 01:45:25,763 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:45:25,763 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:25,763 INFO L89 Accepts]: Start accepts. Operand has 107 places, 87 transitions, 999 flow [2022-12-13 01:45:25,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:25,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:25,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 87 transitions, 999 flow [2022-12-13 01:45:25,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 87 transitions, 999 flow [2022-12-13 01:45:25,796 INFO L130 PetriNetUnfolder]: 67/515 cut-off events. [2022-12-13 01:45:25,796 INFO L131 PetriNetUnfolder]: For 3060/3094 co-relation queries the response was YES. [2022-12-13 01:45:25,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2066 conditions, 515 events. 67/515 cut-off events. For 3060/3094 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4318 event pairs, 1 based on Foata normal form. 6/496 useless extension candidates. Maximal degree in co-relation 2017. Up to 104 conditions per place. [2022-12-13 01:45:25,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 87 transitions, 999 flow [2022-12-13 01:45:25,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-13 01:45:25,817 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [868] L59-->L154-3: Formula: (and (= (store |v_#memory_int_901| |v_ULTIMATE.start_main_~#t2~0#1.base_129| (store (select |v_#memory_int_901| |v_ULTIMATE.start_main_~#t2~0#1.base_129|) |v_ULTIMATE.start_main_~#t2~0#1.offset_73| |v_ULTIMATE.start_main_#t~pre15#1_111|)) |v_#memory_int_900|) (= v_~i~0_1473 (select (select |v_#memory_int_901| v_~f~0.base_794) (+ v_~f~0.offset_801 (* v_~i1~0_525 4)))) (= |v_#pthreadsForks_193| |v_ULTIMATE.start_main_#t~pre15#1_111|) (not (= (ite (= (mod v_~e2~0_742 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_452| (ite (or (<= v_~n1~0_837 v_~n2~0_916) (= v_~n2~0_916 0)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_452| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_452|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_452| 0)) (= v_~i1~0_525 v_~i~0_1474) (= (+ |v_#pthreadsForks_193| 1) |v_#pthreadsForks_192|)) InVars {#pthreadsForks=|v_#pthreadsForks_193|, ~n2~0=v_~n2~0_916, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_73|, ~i~0=v_~i~0_1474, ~f~0.base=v_~f~0.base_794, ~n1~0=v_~n1~0_837, #memory_int=|v_#memory_int_901|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_129|, ~f~0.offset=v_~f~0.offset_801, ~e2~0=v_~e2~0_742} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_95|, ~n2~0=v_~n2~0_916, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_73|, ~i~0=v_~i~0_1473, ~f~0.base=v_~f~0.base_794, ~n1~0=v_~n1~0_837, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_111|, ~i1~0=v_~i1~0_525, ~f~0.offset=v_~f~0.offset_801, ~e2~0=v_~e2~0_742, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_65|, #pthreadsForks=|v_#pthreadsForks_192|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_452|, #memory_int=|v_#memory_int_900|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_432|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_129|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_452|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre15#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, ULTIMATE.start_main_#t~nondet14#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [506] L71-->L74: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= (ite (and (<= 0 v_~i~0_32) (< v_~i~0_32 v_~n~0_22)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~n~0=v_~n~0_22, ~i~0=v_~i~0_32} OutVars{~n~0=v_~n~0_22, ~i~0=v_~i~0_32, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:45:25,908 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:25,909 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 01:45:25,909 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 1016 flow [2022-12-13 01:45:25,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:25,909 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:25,909 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:25,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2022-12-13 01:45:25,909 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:25,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:25,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1956135985, now seen corresponding path program 1 times [2022-12-13 01:45:25,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:25,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223118994] [2022-12-13 01:45:25,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:25,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:26,559 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-13 01:45:26,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:26,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223118994] [2022-12-13 01:45:26,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223118994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:26,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:26,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:26,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468935185] [2022-12-13 01:45:26,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:26,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:26,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:26,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:26,561 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:45:26,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 1016 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:45:26,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:26,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:45:26,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:27,014 INFO L130 PetriNetUnfolder]: 933/1976 cut-off events. [2022-12-13 01:45:27,014 INFO L131 PetriNetUnfolder]: For 15927/15927 co-relation queries the response was YES. [2022-12-13 01:45:27,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9865 conditions, 1976 events. 933/1976 cut-off events. For 15927/15927 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12996 event pairs, 319 based on Foata normal form. 2/1978 useless extension candidates. Maximal degree in co-relation 9807. Up to 1088 conditions per place. [2022-12-13 01:45:27,023 INFO L137 encePairwiseOnDemand]: 38/51 looper letters, 138 selfloop transitions, 17 changer transitions 24/179 dead transitions. [2022-12-13 01:45:27,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 179 transitions, 2035 flow [2022-12-13 01:45:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2022-12-13 01:45:27,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2022-12-13 01:45:27,024 INFO L175 Difference]: Start difference. First operand has 105 places, 87 transitions, 1016 flow. Second operand 8 states and 152 transitions. [2022-12-13 01:45:27,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 179 transitions, 2035 flow [2022-12-13 01:45:27,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 179 transitions, 1975 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-13 01:45:27,046 INFO L231 Difference]: Finished difference. Result has 107 places, 83 transitions, 909 flow [2022-12-13 01:45:27,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=909, PETRI_PLACES=107, PETRI_TRANSITIONS=83} [2022-12-13 01:45:27,046 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:45:27,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:27,046 INFO L89 Accepts]: Start accepts. Operand has 107 places, 83 transitions, 909 flow [2022-12-13 01:45:27,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:27,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:27,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 83 transitions, 909 flow [2022-12-13 01:45:27,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 83 transitions, 909 flow [2022-12-13 01:45:27,087 INFO L130 PetriNetUnfolder]: 63/491 cut-off events. [2022-12-13 01:45:27,087 INFO L131 PetriNetUnfolder]: For 2593/2611 co-relation queries the response was YES. [2022-12-13 01:45:27,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1935 conditions, 491 events. 63/491 cut-off events. For 2593/2611 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4046 event pairs, 1 based on Foata normal form. 5/473 useless extension candidates. Maximal degree in co-relation 1885. Up to 98 conditions per place. [2022-12-13 01:45:27,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 83 transitions, 909 flow [2022-12-13 01:45:27,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-13 01:45:27,093 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:27,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 01:45:27,094 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 83 transitions, 909 flow [2022-12-13 01:45:27,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:45:27,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:27,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:27,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-12-13 01:45:27,094 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:27,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash 79767357, now seen corresponding path program 1 times [2022-12-13 01:45:27,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:27,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534190087] [2022-12-13 01:45:27,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:27,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:27,664 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-13 01:45:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:27,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534190087] [2022-12-13 01:45:27,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534190087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:27,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:27,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777735881] [2022-12-13 01:45:27,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:27,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:27,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:27,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:27,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:27,665 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:45:27,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 83 transitions, 909 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:27,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:27,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:45:27,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:28,084 INFO L130 PetriNetUnfolder]: 909/1932 cut-off events. [2022-12-13 01:45:28,084 INFO L131 PetriNetUnfolder]: For 13987/13987 co-relation queries the response was YES. [2022-12-13 01:45:28,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9413 conditions, 1932 events. 909/1932 cut-off events. For 13987/13987 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12625 event pairs, 317 based on Foata normal form. 2/1934 useless extension candidates. Maximal degree in co-relation 9354. Up to 1088 conditions per place. [2022-12-13 01:45:28,092 INFO L137 encePairwiseOnDemand]: 35/48 looper letters, 128 selfloop transitions, 11 changer transitions 43/182 dead transitions. [2022-12-13 01:45:28,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 182 transitions, 1996 flow [2022-12-13 01:45:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:28,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2022-12-13 01:45:28,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35648148148148145 [2022-12-13 01:45:28,093 INFO L175 Difference]: Start difference. First operand has 104 places, 83 transitions, 909 flow. Second operand 9 states and 154 transitions. [2022-12-13 01:45:28,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 182 transitions, 1996 flow [2022-12-13 01:45:28,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 182 transitions, 1948 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-12-13 01:45:28,111 INFO L231 Difference]: Finished difference. Result has 107 places, 76 transitions, 774 flow [2022-12-13 01:45:28,111 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=774, PETRI_PLACES=107, PETRI_TRANSITIONS=76} [2022-12-13 01:45:28,112 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:45:28,112 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:28,112 INFO L89 Accepts]: Start accepts. Operand has 107 places, 76 transitions, 774 flow [2022-12-13 01:45:28,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:28,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:28,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 76 transitions, 774 flow [2022-12-13 01:45:28,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 76 transitions, 774 flow [2022-12-13 01:45:28,139 INFO L130 PetriNetUnfolder]: 60/435 cut-off events. [2022-12-13 01:45:28,139 INFO L131 PetriNetUnfolder]: For 1902/1917 co-relation queries the response was YES. [2022-12-13 01:45:28,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 435 events. 60/435 cut-off events. For 1902/1917 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3446 event pairs, 1 based on Foata normal form. 4/422 useless extension candidates. Maximal degree in co-relation 1663. Up to 83 conditions per place. [2022-12-13 01:45:28,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 76 transitions, 774 flow [2022-12-13 01:45:28,142 INFO L226 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-13 01:45:28,142 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:28,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 01:45:28,142 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 76 transitions, 774 flow [2022-12-13 01:45:28,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:28,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:28,143 INFO L214 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] [2022-12-13 01:45:28,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2022-12-13 01:45:28,143 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash -852939436, now seen corresponding path program 1 times [2022-12-13 01:45:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:28,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620572868] [2022-12-13 01:45:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:28,843 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-13 01:45:28,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:28,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620572868] [2022-12-13 01:45:28,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620572868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:28,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:28,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:45:28,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380776982] [2022-12-13 01:45:28,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:28,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:45:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:28,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:45:28,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:45:28,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:45:28,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 76 transitions, 774 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:28,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:28,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:45:28,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:29,264 INFO L130 PetriNetUnfolder]: 778/1627 cut-off events. [2022-12-13 01:45:29,264 INFO L131 PetriNetUnfolder]: For 9884/9884 co-relation queries the response was YES. [2022-12-13 01:45:29,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7860 conditions, 1627 events. 778/1627 cut-off events. For 9884/9884 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10080 event pairs, 257 based on Foata normal form. 3/1630 useless extension candidates. Maximal degree in co-relation 7808. Up to 1088 conditions per place. [2022-12-13 01:45:29,271 INFO L137 encePairwiseOnDemand]: 31/45 looper letters, 105 selfloop transitions, 12 changer transitions 44/161 dead transitions. [2022-12-13 01:45:29,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 161 transitions, 1698 flow [2022-12-13 01:45:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:45:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:45:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-12-13 01:45:29,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3088888888888889 [2022-12-13 01:45:29,272 INFO L175 Difference]: Start difference. First operand has 98 places, 76 transitions, 774 flow. Second operand 10 states and 139 transitions. [2022-12-13 01:45:29,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 161 transitions, 1698 flow [2022-12-13 01:45:29,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 161 transitions, 1634 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-12-13 01:45:29,286 INFO L231 Difference]: Finished difference. Result has 104 places, 77 transitions, 791 flow [2022-12-13 01:45:29,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=791, PETRI_PLACES=104, PETRI_TRANSITIONS=77} [2022-12-13 01:45:29,287 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places. [2022-12-13 01:45:29,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:29,287 INFO L89 Accepts]: Start accepts. Operand has 104 places, 77 transitions, 791 flow [2022-12-13 01:45:29,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:29,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:29,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 77 transitions, 791 flow [2022-12-13 01:45:29,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 77 transitions, 791 flow [2022-12-13 01:45:29,312 INFO L130 PetriNetUnfolder]: 57/396 cut-off events. [2022-12-13 01:45:29,313 INFO L131 PetriNetUnfolder]: For 1836/1852 co-relation queries the response was YES. [2022-12-13 01:45:29,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 396 events. 57/396 cut-off events. For 1836/1852 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2985 event pairs, 1 based on Foata normal form. 4/384 useless extension candidates. Maximal degree in co-relation 1555. Up to 77 conditions per place. [2022-12-13 01:45:29,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 77 transitions, 791 flow [2022-12-13 01:45:29,315 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 01:45:29,316 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:45:29,355 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:29,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-13 01:45:29,368 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 77 transitions, 798 flow [2022-12-13 01:45:29,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:29,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:29,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:29,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2022-12-13 01:45:29,368 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2133923416, now seen corresponding path program 1 times [2022-12-13 01:45:29,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:29,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115391395] [2022-12-13 01:45:29,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:29,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:29,514 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-13 01:45:29,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:29,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115391395] [2022-12-13 01:45:29,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115391395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:29,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:29,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:45:29,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164464193] [2022-12-13 01:45:29,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:29,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:45:29,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:29,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:45:29,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:45:29,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:45:29,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 77 transitions, 798 flow. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:29,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:29,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:45:29,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:29,731 INFO L130 PetriNetUnfolder]: 708/1488 cut-off events. [2022-12-13 01:45:29,731 INFO L131 PetriNetUnfolder]: For 9263/9263 co-relation queries the response was YES. [2022-12-13 01:45:29,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7280 conditions, 1488 events. 708/1488 cut-off events. For 9263/9263 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8986 event pairs, 231 based on Foata normal form. 2/1490 useless extension candidates. Maximal degree in co-relation 7227. Up to 1087 conditions per place. [2022-12-13 01:45:29,739 INFO L137 encePairwiseOnDemand]: 38/46 looper letters, 93 selfloop transitions, 11 changer transitions 18/122 dead transitions. [2022-12-13 01:45:29,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 122 transitions, 1339 flow [2022-12-13 01:45:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:45:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:45:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-13 01:45:29,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35144927536231885 [2022-12-13 01:45:29,740 INFO L175 Difference]: Start difference. First operand has 100 places, 77 transitions, 798 flow. Second operand 6 states and 97 transitions. [2022-12-13 01:45:29,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 122 transitions, 1339 flow [2022-12-13 01:45:29,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 122 transitions, 1277 flow, removed 19 selfloop flow, removed 8 redundant places. [2022-12-13 01:45:29,753 INFO L231 Difference]: Finished difference. Result has 99 places, 78 transitions, 788 flow [2022-12-13 01:45:29,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=788, PETRI_PLACES=99, PETRI_TRANSITIONS=78} [2022-12-13 01:45:29,753 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-12-13 01:45:29,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:29,753 INFO L89 Accepts]: Start accepts. Operand has 99 places, 78 transitions, 788 flow [2022-12-13 01:45:29,754 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:29,754 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:29,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 78 transitions, 788 flow [2022-12-13 01:45:29,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 78 transitions, 788 flow [2022-12-13 01:45:29,778 INFO L130 PetriNetUnfolder]: 55/379 cut-off events. [2022-12-13 01:45:29,778 INFO L131 PetriNetUnfolder]: For 1692/1709 co-relation queries the response was YES. [2022-12-13 01:45:29,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 379 events. 55/379 cut-off events. For 1692/1709 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2815 event pairs, 6 based on Foata normal form. 5/369 useless extension candidates. Maximal degree in co-relation 1362. Up to 73 conditions per place. [2022-12-13 01:45:29,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 78 transitions, 788 flow [2022-12-13 01:45:29,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-13 01:45:29,850 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [753] L97-->L103: Formula: (and (= v_~i2~0_219 v_~i~0_537) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_158| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_158| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_158|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_158| (ite (or (= v_~n1~0_349 0) (< v_~n2~0_333 v_~n1~0_349)) 1 0))) InVars {~n2~0=v_~n2~0_333, ~i~0=v_~i~0_537, ~n1~0=v_~n1~0_349} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_158|, ~n2~0=v_~n2~0_333, ~i~0=v_~i~0_537, ~n1~0=v_~n1~0_349, ~i2~0=v_~i2~0_219, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_158|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:45:29,914 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:29,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-13 01:45:29,915 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 77 transitions, 804 flow [2022-12-13 01:45:29,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:29,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:29,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:29,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2022-12-13 01:45:29,915 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:29,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1736261575, now seen corresponding path program 1 times [2022-12-13 01:45:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:29,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061931253] [2022-12-13 01:45:29,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:29,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:30,628 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-13 01:45:30,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:30,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061931253] [2022-12-13 01:45:30,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061931253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:30,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:30,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:30,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553900606] [2022-12-13 01:45:30,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:30,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:30,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:30,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:30,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:30,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:45:30,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 77 transitions, 804 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:30,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:30,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:45:30,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:31,030 INFO L130 PetriNetUnfolder]: 746/1550 cut-off events. [2022-12-13 01:45:31,031 INFO L131 PetriNetUnfolder]: For 9532/9532 co-relation queries the response was YES. [2022-12-13 01:45:31,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7547 conditions, 1550 events. 746/1550 cut-off events. For 9532/9532 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9443 event pairs, 289 based on Foata normal form. 2/1552 useless extension candidates. Maximal degree in co-relation 7344. Up to 1088 conditions per place. [2022-12-13 01:45:31,039 INFO L137 encePairwiseOnDemand]: 34/48 looper letters, 110 selfloop transitions, 20 changer transitions 25/155 dead transitions. [2022-12-13 01:45:31,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 155 transitions, 1633 flow [2022-12-13 01:45:31,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2022-12-13 01:45:31,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3101851851851852 [2022-12-13 01:45:31,040 INFO L175 Difference]: Start difference. First operand has 97 places, 77 transitions, 804 flow. Second operand 9 states and 134 transitions. [2022-12-13 01:45:31,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 155 transitions, 1633 flow [2022-12-13 01:45:31,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 155 transitions, 1569 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-13 01:45:31,052 INFO L231 Difference]: Finished difference. Result has 105 places, 86 transitions, 906 flow [2022-12-13 01:45:31,053 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=906, PETRI_PLACES=105, PETRI_TRANSITIONS=86} [2022-12-13 01:45:31,053 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2022-12-13 01:45:31,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:31,053 INFO L89 Accepts]: Start accepts. Operand has 105 places, 86 transitions, 906 flow [2022-12-13 01:45:31,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:31,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:31,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 86 transitions, 906 flow [2022-12-13 01:45:31,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 86 transitions, 906 flow [2022-12-13 01:45:31,080 INFO L130 PetriNetUnfolder]: 60/407 cut-off events. [2022-12-13 01:45:31,081 INFO L131 PetriNetUnfolder]: For 1932/1959 co-relation queries the response was YES. [2022-12-13 01:45:31,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 407 events. 60/407 cut-off events. For 1932/1959 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3117 event pairs, 6 based on Foata normal form. 6/397 useless extension candidates. Maximal degree in co-relation 1609. Up to 81 conditions per place. [2022-12-13 01:45:31,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 86 transitions, 906 flow [2022-12-13 01:45:31,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-13 01:45:31,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L97-->L106: Formula: (and (= (select (select |v_#memory_int_953| v_~f~0.base_848) (+ v_~f~0.offset_855 (* v_~i2~0_395 4))) v_~i~0_1577) (= v_~i2~0_395 v_~i~0_1578) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630| 0)) (= (ite (or (< v_~n2~0_974 v_~n1~0_891) (= v_~n1~0_891 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|)) InVars {~n2~0=v_~n2~0_974, ~i~0=v_~i~0_1578, ~f~0.base=v_~f~0.base_848, ~n1~0=v_~n1~0_891, #memory_int=|v_#memory_int_953|, ~f~0.offset=v_~f~0.offset_855} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_233|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630|, ~n2~0=v_~n2~0_974, ~i~0=v_~i~0_1577, ~f~0.base=v_~f~0.base_848, ~n1~0=v_~n1~0_891, #memory_int=|v_#memory_int_953|, ~i2~0=v_~i2~0_395, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|, ~f~0.offset=v_~f~0.offset_855} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [754] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_39| 0) (= v_~e1~0_188 1) (= |v_thread2Thread1of1ForFork2_#res#1.offset_39| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| 0)) (= v_~n2~0_335 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|) (= v_~n2~0_336 v_~tmp1~0_159) (= (ite (and (<= 0 v_~i~0_539) (< v_~i~0_539 v_~n~0_218)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|)) InVars {~n2~0=v_~n2~0_336, ~i~0=v_~i~0_539, ~n~0=v_~n~0_218} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_160|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_39|, ~n2~0=v_~n2~0_335, ~i~0=v_~i~0_539, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_160|, ~n~0=v_~n~0_218, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_39|, ~tmp1~0=v_~tmp1~0_159, ~e1~0=v_~e1~0_188} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:45:31,167 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L97-->L106: Formula: (and (= (select (select |v_#memory_int_953| v_~f~0.base_848) (+ v_~f~0.offset_855 (* v_~i2~0_395 4))) v_~i~0_1577) (= v_~i2~0_395 v_~i~0_1578) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630| 0)) (= (ite (or (< v_~n2~0_974 v_~n1~0_891) (= v_~n1~0_891 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|)) InVars {~n2~0=v_~n2~0_974, ~i~0=v_~i~0_1578, ~f~0.base=v_~f~0.base_848, ~n1~0=v_~n1~0_891, #memory_int=|v_#memory_int_953|, ~f~0.offset=v_~f~0.offset_855} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_233|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630|, ~n2~0=v_~n2~0_974, ~i~0=v_~i~0_1577, ~f~0.base=v_~f~0.base_848, ~n1~0=v_~n1~0_891, #memory_int=|v_#memory_int_953|, ~i2~0=v_~i2~0_395, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|, ~f~0.offset=v_~f~0.offset_855} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:45:31,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L97-->L106: Formula: (and (= (select (select |v_#memory_int_953| v_~f~0.base_848) (+ v_~f~0.offset_855 (* v_~i2~0_395 4))) v_~i~0_1577) (= v_~i2~0_395 v_~i~0_1578) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630| 0)) (= (ite (or (< v_~n2~0_974 v_~n1~0_891) (= v_~n1~0_891 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|)) InVars {~n2~0=v_~n2~0_974, ~i~0=v_~i~0_1578, ~f~0.base=v_~f~0.base_848, ~n1~0=v_~n1~0_891, #memory_int=|v_#memory_int_953|, ~f~0.offset=v_~f~0.offset_855} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_233|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630|, ~n2~0=v_~n2~0_974, ~i~0=v_~i~0_1577, ~f~0.base=v_~f~0.base_848, ~n1~0=v_~n1~0_891, #memory_int=|v_#memory_int_953|, ~i2~0=v_~i2~0_395, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|, ~f~0.offset=v_~f~0.offset_855} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [756] $Ultimate##0-->thread2EXIT: Formula: (and (= v_~n2~0_342 v_~tmp1~0_163) (= v_~n2~0_341 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_41| 0) (= v_~n1~0_353 (+ v_~tmp1~0_163 1)) (= (ite (and (<= 0 v_~i~0_541) (< v_~i~0_541 v_~n~0_220)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|) (= v_~e1~0_194 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_41| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|)) InVars {~n2~0=v_~n2~0_342, ~i~0=v_~i~0_541, ~n~0=v_~n~0_220} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_162|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_41|, ~n2~0=v_~n2~0_341, ~i~0=v_~i~0_541, ~n1~0=v_~n1~0_353, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_162|, ~n~0=v_~n~0_220, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_41|, ~tmp1~0=v_~tmp1~0_163, ~e1~0=v_~e1~0_194} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 01:45:31,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [879] L97-->L106: Formula: (and (= (select (select |v_#memory_int_953| v_~f~0.base_848) (+ v_~f~0.offset_855 (* v_~i2~0_395 4))) v_~i~0_1577) (= v_~i2~0_395 v_~i~0_1578) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630| 0)) (= (ite (or (< v_~n2~0_974 v_~n1~0_891) (= v_~n1~0_891 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|)) InVars {~n2~0=v_~n2~0_974, ~i~0=v_~i~0_1578, ~f~0.base=v_~f~0.base_848, ~n1~0=v_~n1~0_891, #memory_int=|v_#memory_int_953|, ~f~0.offset=v_~f~0.offset_855} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_233|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_630|, ~n2~0=v_~n2~0_974, ~i~0=v_~i~0_1577, ~f~0.base=v_~f~0.base_848, ~n1~0=v_~n1~0_891, #memory_int=|v_#memory_int_953|, ~i2~0=v_~i2~0_395, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_630|, ~f~0.offset=v_~f~0.offset_855} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:45:31,417 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:31,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 364 [2022-12-13 01:45:31,417 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 960 flow [2022-12-13 01:45:31,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:31,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:31,417 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:31,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2022-12-13 01:45:31,417 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash -844205609, now seen corresponding path program 1 times [2022-12-13 01:45:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:31,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355320480] [2022-12-13 01:45:31,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:31,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:31,912 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-13 01:45:31,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:31,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355320480] [2022-12-13 01:45:31,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355320480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:31,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:31,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446354036] [2022-12-13 01:45:31,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:31,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:31,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:31,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:31,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 01:45:31,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 960 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:31,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:31,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 01:45:31,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:32,282 INFO L130 PetriNetUnfolder]: 734/1546 cut-off events. [2022-12-13 01:45:32,282 INFO L131 PetriNetUnfolder]: For 10681/10681 co-relation queries the response was YES. [2022-12-13 01:45:32,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7659 conditions, 1546 events. 734/1546 cut-off events. For 10681/10681 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9557 event pairs, 317 based on Foata normal form. 2/1548 useless extension candidates. Maximal degree in co-relation 7606. Up to 1088 conditions per place. [2022-12-13 01:45:32,289 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 105 selfloop transitions, 16 changer transitions 29/150 dead transitions. [2022-12-13 01:45:32,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 150 transitions, 1724 flow [2022-12-13 01:45:32,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2022-12-13 01:45:32,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-13 01:45:32,290 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 960 flow. Second operand 8 states and 128 transitions. [2022-12-13 01:45:32,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 150 transitions, 1724 flow [2022-12-13 01:45:32,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 150 transitions, 1669 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-12-13 01:45:32,304 INFO L231 Difference]: Finished difference. Result has 109 places, 83 transitions, 919 flow [2022-12-13 01:45:32,304 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=919, PETRI_PLACES=109, PETRI_TRANSITIONS=83} [2022-12-13 01:45:32,304 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2022-12-13 01:45:32,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:32,304 INFO L89 Accepts]: Start accepts. Operand has 109 places, 83 transitions, 919 flow [2022-12-13 01:45:32,305 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:32,305 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:32,305 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 83 transitions, 919 flow [2022-12-13 01:45:32,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 83 transitions, 919 flow [2022-12-13 01:45:32,331 INFO L130 PetriNetUnfolder]: 56/395 cut-off events. [2022-12-13 01:45:32,331 INFO L131 PetriNetUnfolder]: For 1955/1979 co-relation queries the response was YES. [2022-12-13 01:45:32,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 395 events. 56/395 cut-off events. For 1955/1979 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3005 event pairs, 8 based on Foata normal form. 6/383 useless extension candidates. Maximal degree in co-relation 1628. Up to 72 conditions per place. [2022-12-13 01:45:32,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 83 transitions, 919 flow [2022-12-13 01:45:32,334 INFO L226 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-13 01:45:32,334 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:32,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 01:45:32,335 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 83 transitions, 919 flow [2022-12-13 01:45:32,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:32,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:32,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:32,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2022-12-13 01:45:32,335 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:32,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1873525627, now seen corresponding path program 2 times [2022-12-13 01:45:32,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:32,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478419585] [2022-12-13 01:45:32,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:32,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:45:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:32,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478419585] [2022-12-13 01:45:32,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478419585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:32,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:32,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:32,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671046265] [2022-12-13 01:45:32,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:32,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:32,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:32,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:32,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:32,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:45:32,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 83 transitions, 919 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:32,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:32,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:45:32,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:33,350 INFO L130 PetriNetUnfolder]: 738/1564 cut-off events. [2022-12-13 01:45:33,350 INFO L131 PetriNetUnfolder]: For 10745/10745 co-relation queries the response was YES. [2022-12-13 01:45:33,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7750 conditions, 1564 events. 738/1564 cut-off events. For 10745/10745 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9852 event pairs, 289 based on Foata normal form. 2/1566 useless extension candidates. Maximal degree in co-relation 7695. Up to 1208 conditions per place. [2022-12-13 01:45:33,356 INFO L137 encePairwiseOnDemand]: 36/51 looper letters, 94 selfloop transitions, 18 changer transitions 24/136 dead transitions. [2022-12-13 01:45:33,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 136 transitions, 1561 flow [2022-12-13 01:45:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:45:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:45:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-12-13 01:45:33,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32212885154061627 [2022-12-13 01:45:33,360 INFO L175 Difference]: Start difference. First operand has 107 places, 83 transitions, 919 flow. Second operand 7 states and 115 transitions. [2022-12-13 01:45:33,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 136 transitions, 1561 flow [2022-12-13 01:45:33,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 136 transitions, 1505 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-12-13 01:45:33,376 INFO L231 Difference]: Finished difference. Result has 108 places, 84 transitions, 944 flow [2022-12-13 01:45:33,376 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=944, PETRI_PLACES=108, PETRI_TRANSITIONS=84} [2022-12-13 01:45:33,376 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:45:33,376 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:33,376 INFO L89 Accepts]: Start accepts. Operand has 108 places, 84 transitions, 944 flow [2022-12-13 01:45:33,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:33,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:33,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 84 transitions, 944 flow [2022-12-13 01:45:33,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 84 transitions, 944 flow [2022-12-13 01:45:33,403 INFO L130 PetriNetUnfolder]: 54/392 cut-off events. [2022-12-13 01:45:33,403 INFO L131 PetriNetUnfolder]: For 2037/2063 co-relation queries the response was YES. [2022-12-13 01:45:33,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 392 events. 54/392 cut-off events. For 2037/2063 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3034 event pairs, 7 based on Foata normal form. 6/380 useless extension candidates. Maximal degree in co-relation 1596. Up to 70 conditions per place. [2022-12-13 01:45:33,406 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 84 transitions, 944 flow [2022-12-13 01:45:33,406 INFO L226 LiptonReduction]: Number of co-enabled transitions 472 [2022-12-13 01:45:33,413 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:33,413 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 01:45:33,413 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 84 transitions, 944 flow [2022-12-13 01:45:33,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:33,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:33,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:33,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2022-12-13 01:45:33,413 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:33,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:33,414 INFO L85 PathProgramCache]: Analyzing trace with hash -836826023, now seen corresponding path program 3 times [2022-12-13 01:45:33,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:33,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278821297] [2022-12-13 01:45:33,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:33,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:33,945 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-13 01:45:33,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:33,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278821297] [2022-12-13 01:45:33,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278821297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:33,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:33,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893031893] [2022-12-13 01:45:33,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:33,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:33,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:33,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:33,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:33,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:45:33,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 84 transitions, 944 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:33,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:33,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:45:33,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:34,325 INFO L130 PetriNetUnfolder]: 716/1528 cut-off events. [2022-12-13 01:45:34,325 INFO L131 PetriNetUnfolder]: For 10733/10733 co-relation queries the response was YES. [2022-12-13 01:45:34,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7684 conditions, 1528 events. 716/1528 cut-off events. For 10733/10733 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9601 event pairs, 313 based on Foata normal form. 2/1530 useless extension candidates. Maximal degree in co-relation 7367. Up to 1088 conditions per place. [2022-12-13 01:45:34,333 INFO L137 encePairwiseOnDemand]: 38/51 looper letters, 105 selfloop transitions, 14 changer transitions 33/152 dead transitions. [2022-12-13 01:45:34,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 152 transitions, 1740 flow [2022-12-13 01:45:34,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2022-12-13 01:45:34,334 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31862745098039214 [2022-12-13 01:45:34,334 INFO L175 Difference]: Start difference. First operand has 108 places, 84 transitions, 944 flow. Second operand 8 states and 130 transitions. [2022-12-13 01:45:34,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 152 transitions, 1740 flow [2022-12-13 01:45:34,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 152 transitions, 1678 flow, removed 11 selfloop flow, removed 7 redundant places. [2022-12-13 01:45:34,351 INFO L231 Difference]: Finished difference. Result has 110 places, 81 transitions, 889 flow [2022-12-13 01:45:34,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=889, PETRI_PLACES=110, PETRI_TRANSITIONS=81} [2022-12-13 01:45:34,351 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2022-12-13 01:45:34,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:34,351 INFO L89 Accepts]: Start accepts. Operand has 110 places, 81 transitions, 889 flow [2022-12-13 01:45:34,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:34,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:34,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 81 transitions, 889 flow [2022-12-13 01:45:34,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 81 transitions, 889 flow [2022-12-13 01:45:34,376 INFO L130 PetriNetUnfolder]: 48/362 cut-off events. [2022-12-13 01:45:34,376 INFO L131 PetriNetUnfolder]: For 1811/1834 co-relation queries the response was YES. [2022-12-13 01:45:34,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 362 events. 48/362 cut-off events. For 1811/1834 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2755 event pairs, 6 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1503. Up to 65 conditions per place. [2022-12-13 01:45:34,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 81 transitions, 889 flow [2022-12-13 01:45:34,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 01:45:34,382 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [883] L97-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_91| 0) (not (= (ite (or (= v_~n1~0_900 0) (< v_~n2~0_985 v_~n1~0_900)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_640| 0)) (= (ite (and (< v_~i~0_1591 v_~n~0_541) (<= 0 v_~i~0_1591)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_640|) (= (select (select |v_#memory_int_961| v_~f~0.base_856) (+ v_~f~0.offset_863 (* v_~i2~0_403 4))) v_~i~0_1591) (= v_~n2~0_985 v_~tmp1~0_231) (= v_~i2~0_403 v_~i~0_1592) (= v_~e1~0_626 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_91| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_640| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_640|) (= v_~n1~0_899 (+ v_~tmp1~0_231 1)) (= v_~n2~0_984 0)) InVars {~n2~0=v_~n2~0_985, ~i~0=v_~i~0_1592, ~f~0.base=v_~f~0.base_856, ~n1~0=v_~n1~0_900, #memory_int=|v_#memory_int_961|, ~n~0=v_~n~0_541, ~f~0.offset=v_~f~0.offset_863} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_91|, ~n2~0=v_~n2~0_984, ~i~0=v_~i~0_1591, ~n1~0=v_~n1~0_899, ~f~0.base=v_~f~0.base_856, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_640|, ~i2~0=v_~i2~0_403, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_91|, ~f~0.offset=v_~f~0.offset_863, ~e1~0=v_~e1~0_626, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_239|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_640|, #memory_int=|v_#memory_int_961|, ~n~0=v_~n~0_541, ~tmp1~0=v_~tmp1~0_231} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, ~i~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] and [741] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| (ite (or (= v_~n2~0_287 0) (<= v_~n1~0_315 v_~n2~0_287)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142|) (not (= (ite (= 0 (mod v_~e2~0_231 256)) 1 0) 0)) (= v_~i1~0_229 v_~i~0_496) (= (select (select |v_#memory_int_369| v_~f~0.base_292) (+ v_~f~0.offset_299 (* v_~i1~0_229 4))) v_~i~0_495)) InVars {~n2~0=v_~n2~0_287, ~i~0=v_~i~0_496, ~f~0.base=v_~f~0.base_292, ~n1~0=v_~n1~0_315, #memory_int=|v_#memory_int_369|, ~f~0.offset=v_~f~0.offset_299, ~e2~0=v_~e2~0_231} OutVars{~n2~0=v_~n2~0_287, ~i~0=v_~i~0_495, ~f~0.base=v_~f~0.base_292, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142|, ~n1~0=v_~n1~0_315, #memory_int=|v_#memory_int_369|, ~i1~0=v_~i1~0_229, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_146|, ~f~0.offset=v_~f~0.offset_299, ~e2~0=v_~e2~0_231, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:45:34,581 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:34,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 231 [2022-12-13 01:45:34,582 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 81 transitions, 891 flow [2022-12-13 01:45:34,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:34,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:34,582 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:34,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2022-12-13 01:45:34,582 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:34,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:34,582 INFO L85 PathProgramCache]: Analyzing trace with hash -953883325, now seen corresponding path program 1 times [2022-12-13 01:45:34,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:34,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531082651] [2022-12-13 01:45:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:34,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:35,106 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-13 01:45:35,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:35,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531082651] [2022-12-13 01:45:35,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531082651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:35,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:35,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:45:35,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667944323] [2022-12-13 01:45:35,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:35,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:45:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:45:35,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:45:35,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:45:35,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 81 transitions, 891 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:45:35,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:35,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:45:35,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:35,428 INFO L130 PetriNetUnfolder]: 693/1493 cut-off events. [2022-12-13 01:45:35,428 INFO L131 PetriNetUnfolder]: For 9848/9848 co-relation queries the response was YES. [2022-12-13 01:45:35,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7290 conditions, 1493 events. 693/1493 cut-off events. For 9848/9848 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9423 event pairs, 293 based on Foata normal form. 1/1494 useless extension candidates. Maximal degree in co-relation 7235. Up to 1170 conditions per place. [2022-12-13 01:45:35,436 INFO L137 encePairwiseOnDemand]: 39/50 looper letters, 94 selfloop transitions, 13 changer transitions 26/133 dead transitions. [2022-12-13 01:45:35,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 133 transitions, 1465 flow [2022-12-13 01:45:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:45:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:45:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-13 01:45:35,436 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2022-12-13 01:45:35,436 INFO L175 Difference]: Start difference. First operand has 108 places, 81 transitions, 891 flow. Second operand 6 states and 112 transitions. [2022-12-13 01:45:35,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 133 transitions, 1465 flow [2022-12-13 01:45:35,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 133 transitions, 1423 flow, removed 4 selfloop flow, removed 9 redundant places. [2022-12-13 01:45:35,452 INFO L231 Difference]: Finished difference. Result has 107 places, 81 transitions, 879 flow [2022-12-13 01:45:35,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=879, PETRI_PLACES=107, PETRI_TRANSITIONS=81} [2022-12-13 01:45:35,452 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:45:35,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:35,453 INFO L89 Accepts]: Start accepts. Operand has 107 places, 81 transitions, 879 flow [2022-12-13 01:45:35,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:35,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:35,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 81 transitions, 879 flow [2022-12-13 01:45:35,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 81 transitions, 879 flow [2022-12-13 01:45:35,478 INFO L130 PetriNetUnfolder]: 46/360 cut-off events. [2022-12-13 01:45:35,478 INFO L131 PetriNetUnfolder]: For 1782/1805 co-relation queries the response was YES. [2022-12-13 01:45:35,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 360 events. 46/360 cut-off events. For 1782/1805 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2743 event pairs, 6 based on Foata normal form. 6/349 useless extension candidates. Maximal degree in co-relation 1425. Up to 63 conditions per place. [2022-12-13 01:45:35,481 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 81 transitions, 879 flow [2022-12-13 01:45:35,481 INFO L226 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-13 01:45:35,482 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:35,482 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 01:45:35,482 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 81 transitions, 879 flow [2022-12-13 01:45:35,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:45:35,482 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:35,482 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:35,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2022-12-13 01:45:35,482 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:35,483 INFO L85 PathProgramCache]: Analyzing trace with hash -361479036, now seen corresponding path program 1 times [2022-12-13 01:45:35,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:35,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143748028] [2022-12-13 01:45:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:35,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:36,056 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-13 01:45:36,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:36,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143748028] [2022-12-13 01:45:36,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143748028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:36,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:36,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:45:36,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450502888] [2022-12-13 01:45:36,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:36,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:45:36,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:36,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:45:36,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:45:36,057 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:45:36,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 81 transitions, 879 flow. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:36,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:36,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:45:36,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:36,361 INFO L130 PetriNetUnfolder]: 672/1454 cut-off events. [2022-12-13 01:45:36,361 INFO L131 PetriNetUnfolder]: For 9845/9845 co-relation queries the response was YES. [2022-12-13 01:45:36,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7178 conditions, 1454 events. 672/1454 cut-off events. For 9845/9845 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9056 event pairs, 285 based on Foata normal form. 2/1456 useless extension candidates. Maximal degree in co-relation 6793. Up to 1088 conditions per place. [2022-12-13 01:45:36,367 INFO L137 encePairwiseOnDemand]: 38/49 looper letters, 98 selfloop transitions, 10 changer transitions 37/145 dead transitions. [2022-12-13 01:45:36,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 145 transitions, 1576 flow [2022-12-13 01:45:36,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2022-12-13 01:45:36,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3163265306122449 [2022-12-13 01:45:36,368 INFO L175 Difference]: Start difference. First operand has 106 places, 81 transitions, 879 flow. Second operand 8 states and 124 transitions. [2022-12-13 01:45:36,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 145 transitions, 1576 flow [2022-12-13 01:45:36,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 145 transitions, 1532 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-13 01:45:36,381 INFO L231 Difference]: Finished difference. Result has 108 places, 76 transitions, 787 flow [2022-12-13 01:45:36,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=787, PETRI_PLACES=108, PETRI_TRANSITIONS=76} [2022-12-13 01:45:36,381 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:45:36,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:36,381 INFO L89 Accepts]: Start accepts. Operand has 108 places, 76 transitions, 787 flow [2022-12-13 01:45:36,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:36,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:36,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 76 transitions, 787 flow [2022-12-13 01:45:36,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 76 transitions, 787 flow [2022-12-13 01:45:36,403 INFO L130 PetriNetUnfolder]: 44/335 cut-off events. [2022-12-13 01:45:36,403 INFO L131 PetriNetUnfolder]: For 1570/1593 co-relation queries the response was YES. [2022-12-13 01:45:36,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 335 events. 44/335 cut-off events. For 1570/1593 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2440 event pairs, 6 based on Foata normal form. 6/326 useless extension candidates. Maximal degree in co-relation 1327. Up to 57 conditions per place. [2022-12-13 01:45:36,405 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 76 transitions, 787 flow [2022-12-13 01:45:36,405 INFO L226 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-13 01:45:41,318 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:41,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4937 [2022-12-13 01:45:41,319 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 76 transitions, 807 flow [2022-12-13 01:45:41,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:41,319 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:41,319 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:41,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2022-12-13 01:45:41,319 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:41,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:41,319 INFO L85 PathProgramCache]: Analyzing trace with hash 679694800, now seen corresponding path program 1 times [2022-12-13 01:45:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:41,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216292858] [2022-12-13 01:45:41,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:42,087 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-13 01:45:42,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:42,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216292858] [2022-12-13 01:45:42,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216292858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:42,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:42,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:42,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308822113] [2022-12-13 01:45:42,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:42,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:42,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:42,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:42,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:42,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:45:42,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 76 transitions, 807 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:42,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:42,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:45:42,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:42,393 INFO L130 PetriNetUnfolder]: 616/1296 cut-off events. [2022-12-13 01:45:42,393 INFO L131 PetriNetUnfolder]: For 8396/8396 co-relation queries the response was YES. [2022-12-13 01:45:42,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6347 conditions, 1296 events. 616/1296 cut-off events. For 8396/8396 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7595 event pairs, 273 based on Foata normal form. 2/1297 useless extension candidates. Maximal degree in co-relation 6300. Up to 1089 conditions per place. [2022-12-13 01:45:42,399 INFO L137 encePairwiseOnDemand]: 39/49 looper letters, 73 selfloop transitions, 6 changer transitions 40/119 dead transitions. [2022-12-13 01:45:42,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 119 transitions, 1342 flow [2022-12-13 01:45:42,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2022-12-13 01:45:42,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25255102040816324 [2022-12-13 01:45:42,399 INFO L175 Difference]: Start difference. First operand has 102 places, 76 transitions, 807 flow. Second operand 8 states and 99 transitions. [2022-12-13 01:45:42,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 119 transitions, 1342 flow [2022-12-13 01:45:42,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 119 transitions, 1298 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-13 01:45:42,410 INFO L231 Difference]: Finished difference. Result has 105 places, 72 transitions, 732 flow [2022-12-13 01:45:42,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=732, PETRI_PLACES=105, PETRI_TRANSITIONS=72} [2022-12-13 01:45:42,410 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2022-12-13 01:45:42,410 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:42,410 INFO L89 Accepts]: Start accepts. Operand has 105 places, 72 transitions, 732 flow [2022-12-13 01:45:42,411 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:42,411 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:42,411 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 72 transitions, 732 flow [2022-12-13 01:45:42,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 72 transitions, 732 flow [2022-12-13 01:45:42,429 INFO L130 PetriNetUnfolder]: 43/289 cut-off events. [2022-12-13 01:45:42,429 INFO L131 PetriNetUnfolder]: For 1394/1415 co-relation queries the response was YES. [2022-12-13 01:45:42,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190 conditions, 289 events. 43/289 cut-off events. For 1394/1415 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2064 event pairs, 6 based on Foata normal form. 6/281 useless extension candidates. Maximal degree in co-relation 1154. Up to 53 conditions per place. [2022-12-13 01:45:42,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 72 transitions, 732 flow [2022-12-13 01:45:42,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-13 01:45:42,432 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:42,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 01:45:42,432 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 72 transitions, 732 flow [2022-12-13 01:45:42,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:42,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:42,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:42,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2022-12-13 01:45:42,432 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:42,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash 204046058, now seen corresponding path program 1 times [2022-12-13 01:45:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:42,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101644949] [2022-12-13 01:45:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:43,079 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-13 01:45:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:43,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101644949] [2022-12-13 01:45:43,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101644949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:43,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:43,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619585722] [2022-12-13 01:45:43,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:43,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:43,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:43,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:43,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:45:43,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 72 transitions, 732 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:43,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:43,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:45:43,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:43,614 INFO L130 PetriNetUnfolder]: 1195/2445 cut-off events. [2022-12-13 01:45:43,615 INFO L131 PetriNetUnfolder]: For 15567/15567 co-relation queries the response was YES. [2022-12-13 01:45:43,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11767 conditions, 2445 events. 1195/2445 cut-off events. For 15567/15567 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16606 event pairs, 431 based on Foata normal form. 2/2447 useless extension candidates. Maximal degree in co-relation 11708. Up to 1088 conditions per place. [2022-12-13 01:45:43,628 INFO L137 encePairwiseOnDemand]: 29/47 looper letters, 158 selfloop transitions, 32 changer transitions 19/209 dead transitions. [2022-12-13 01:45:43,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 209 transitions, 2269 flow [2022-12-13 01:45:43,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:43,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2022-12-13 01:45:43,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40425531914893614 [2022-12-13 01:45:43,629 INFO L175 Difference]: Start difference. First operand has 96 places, 72 transitions, 732 flow. Second operand 9 states and 171 transitions. [2022-12-13 01:45:43,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 209 transitions, 2269 flow [2022-12-13 01:45:43,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 209 transitions, 2169 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-13 01:45:43,652 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 1068 flow [2022-12-13 01:45:43,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1068, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2022-12-13 01:45:43,652 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-12-13 01:45:43,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:43,652 INFO L89 Accepts]: Start accepts. Operand has 99 places, 98 transitions, 1068 flow [2022-12-13 01:45:43,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:43,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:43,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 98 transitions, 1068 flow [2022-12-13 01:45:43,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 98 transitions, 1068 flow [2022-12-13 01:45:43,692 INFO L130 PetriNetUnfolder]: 101/622 cut-off events. [2022-12-13 01:45:43,692 INFO L131 PetriNetUnfolder]: For 3154/3203 co-relation queries the response was YES. [2022-12-13 01:45:43,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 622 events. 101/622 cut-off events. For 3154/3203 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5489 event pairs, 8 based on Foata normal form. 13/608 useless extension candidates. Maximal degree in co-relation 2553. Up to 118 conditions per place. [2022-12-13 01:45:43,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 98 transitions, 1068 flow [2022-12-13 01:45:43,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 564 [2022-12-13 01:45:43,698 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:43,698 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 01:45:43,699 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 1068 flow [2022-12-13 01:45:43,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:43,699 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:43,699 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:43,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2022-12-13 01:45:43,699 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:43,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:43,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1848586244, now seen corresponding path program 2 times [2022-12-13 01:45:43,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:43,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191191667] [2022-12-13 01:45:43,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:43,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:44,470 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-13 01:45:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:44,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191191667] [2022-12-13 01:45:44,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191191667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:44,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:44,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:44,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196660087] [2022-12-13 01:45:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:44,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:44,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:44,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:44,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:45:44,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 1068 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:44,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:44,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:45:44,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:44,939 INFO L130 PetriNetUnfolder]: 1185/2447 cut-off events. [2022-12-13 01:45:44,939 INFO L131 PetriNetUnfolder]: For 16820/16820 co-relation queries the response was YES. [2022-12-13 01:45:44,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12179 conditions, 2447 events. 1185/2447 cut-off events. For 16820/16820 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16725 event pairs, 431 based on Foata normal form. 2/2449 useless extension candidates. Maximal degree in co-relation 12122. Up to 1088 conditions per place. [2022-12-13 01:45:44,951 INFO L137 encePairwiseOnDemand]: 29/47 looper letters, 153 selfloop transitions, 29 changer transitions 25/207 dead transitions. [2022-12-13 01:45:44,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 207 transitions, 2361 flow [2022-12-13 01:45:44,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2022-12-13 01:45:44,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3947990543735225 [2022-12-13 01:45:44,952 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 1068 flow. Second operand 9 states and 167 transitions. [2022-12-13 01:45:44,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 207 transitions, 2361 flow [2022-12-13 01:45:44,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 207 transitions, 2311 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-13 01:45:44,980 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 1068 flow [2022-12-13 01:45:44,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1068, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2022-12-13 01:45:44,981 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:45:44,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:44,981 INFO L89 Accepts]: Start accepts. Operand has 107 places, 96 transitions, 1068 flow [2022-12-13 01:45:44,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:44,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:44,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 96 transitions, 1068 flow [2022-12-13 01:45:44,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 96 transitions, 1068 flow [2022-12-13 01:45:45,025 INFO L130 PetriNetUnfolder]: 97/637 cut-off events. [2022-12-13 01:45:45,025 INFO L131 PetriNetUnfolder]: For 3318/3366 co-relation queries the response was YES. [2022-12-13 01:45:45,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 637 events. 97/637 cut-off events. For 3318/3366 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5661 event pairs, 8 based on Foata normal form. 13/624 useless extension candidates. Maximal degree in co-relation 2619. Up to 105 conditions per place. [2022-12-13 01:45:45,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 96 transitions, 1068 flow [2022-12-13 01:45:45,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-13 01:45:45,036 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:45,036 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 01:45:45,036 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 96 transitions, 1068 flow [2022-12-13 01:45:45,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:45,036 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:45,036 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:45,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2022-12-13 01:45:45,036 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:45,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:45,037 INFO L85 PathProgramCache]: Analyzing trace with hash 89360359, now seen corresponding path program 1 times [2022-12-13 01:45:45,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:45,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669084428] [2022-12-13 01:45:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:45,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:45,683 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-13 01:45:45,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:45,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669084428] [2022-12-13 01:45:45,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669084428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:45,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:45,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59818002] [2022-12-13 01:45:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:45,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:45,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:45,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:45:45,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 96 transitions, 1068 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:45,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:45,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:45:45,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:46,196 INFO L130 PetriNetUnfolder]: 1174/2438 cut-off events. [2022-12-13 01:45:46,196 INFO L131 PetriNetUnfolder]: For 17214/17214 co-relation queries the response was YES. [2022-12-13 01:45:46,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12246 conditions, 2438 events. 1174/2438 cut-off events. For 17214/17214 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16756 event pairs, 495 based on Foata normal form. 2/2440 useless extension candidates. Maximal degree in co-relation 12187. Up to 1152 conditions per place. [2022-12-13 01:45:46,208 INFO L137 encePairwiseOnDemand]: 37/47 looper letters, 155 selfloop transitions, 13 changer transitions 20/188 dead transitions. [2022-12-13 01:45:46,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 188 transitions, 2237 flow [2022-12-13 01:45:46,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2022-12-13 01:45:46,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3617021276595745 [2022-12-13 01:45:46,209 INFO L175 Difference]: Start difference. First operand has 105 places, 96 transitions, 1068 flow. Second operand 8 states and 136 transitions. [2022-12-13 01:45:46,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 188 transitions, 2237 flow [2022-12-13 01:45:46,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 188 transitions, 2147 flow, removed 16 selfloop flow, removed 9 redundant places. [2022-12-13 01:45:46,235 INFO L231 Difference]: Finished difference. Result has 106 places, 95 transitions, 1013 flow [2022-12-13 01:45:46,235 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1013, PETRI_PLACES=106, PETRI_TRANSITIONS=95} [2022-12-13 01:45:46,235 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 01:45:46,235 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:46,235 INFO L89 Accepts]: Start accepts. Operand has 106 places, 95 transitions, 1013 flow [2022-12-13 01:45:46,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:46,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:46,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 95 transitions, 1013 flow [2022-12-13 01:45:46,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 1013 flow [2022-12-13 01:45:46,275 INFO L130 PetriNetUnfolder]: 97/624 cut-off events. [2022-12-13 01:45:46,275 INFO L131 PetriNetUnfolder]: For 3135/3178 co-relation queries the response was YES. [2022-12-13 01:45:46,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2578 conditions, 624 events. 97/624 cut-off events. For 3135/3178 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5564 event pairs, 15 based on Foata normal form. 12/610 useless extension candidates. Maximal degree in co-relation 2528. Up to 104 conditions per place. [2022-12-13 01:45:46,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 1013 flow [2022-12-13 01:45:46,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-13 01:45:46,282 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:46,282 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 01:45:46,282 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 95 transitions, 1013 flow [2022-12-13 01:45:46,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:46,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:46,283 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:46,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2022-12-13 01:45:46,283 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:46,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1751793586, now seen corresponding path program 3 times [2022-12-13 01:45:46,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:46,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902939085] [2022-12-13 01:45:46,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:46,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:46,915 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-13 01:45:46,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:46,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902939085] [2022-12-13 01:45:46,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902939085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:46,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:46,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8976694] [2022-12-13 01:45:46,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:46,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:46,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:46,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:46,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:46,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:45:46,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 95 transitions, 1013 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:46,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:46,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:45:46,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:47,429 INFO L130 PetriNetUnfolder]: 1187/2463 cut-off events. [2022-12-13 01:45:47,430 INFO L131 PetriNetUnfolder]: For 17036/17036 co-relation queries the response was YES. [2022-12-13 01:45:47,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12155 conditions, 2463 events. 1187/2463 cut-off events. For 17036/17036 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16990 event pairs, 425 based on Foata normal form. 2/2465 useless extension candidates. Maximal degree in co-relation 12096. Up to 1088 conditions per place. [2022-12-13 01:45:47,442 INFO L137 encePairwiseOnDemand]: 29/47 looper letters, 164 selfloop transitions, 33 changer transitions 18/215 dead transitions. [2022-12-13 01:45:47,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 215 transitions, 2396 flow [2022-12-13 01:45:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2022-12-13 01:45:47,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40189125295508277 [2022-12-13 01:45:47,443 INFO L175 Difference]: Start difference. First operand has 103 places, 95 transitions, 1013 flow. Second operand 9 states and 170 transitions. [2022-12-13 01:45:47,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 215 transitions, 2396 flow [2022-12-13 01:45:47,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 215 transitions, 2356 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-12-13 01:45:47,467 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 1209 flow [2022-12-13 01:45:47,467 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1209, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2022-12-13 01:45:47,467 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:45:47,467 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:47,467 INFO L89 Accepts]: Start accepts. Operand has 108 places, 104 transitions, 1209 flow [2022-12-13 01:45:47,468 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:47,468 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:47,468 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 104 transitions, 1209 flow [2022-12-13 01:45:47,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 104 transitions, 1209 flow [2022-12-13 01:45:47,509 INFO L130 PetriNetUnfolder]: 93/618 cut-off events. [2022-12-13 01:45:47,509 INFO L131 PetriNetUnfolder]: For 3626/3675 co-relation queries the response was YES. [2022-12-13 01:45:47,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 618 events. 93/618 cut-off events. For 3626/3675 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5515 event pairs, 8 based on Foata normal form. 12/601 useless extension candidates. Maximal degree in co-relation 2650. Up to 101 conditions per place. [2022-12-13 01:45:47,519 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 104 transitions, 1209 flow [2022-12-13 01:45:47,519 INFO L226 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-13 01:45:47,522 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:47,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 01:45:47,522 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 104 transitions, 1209 flow [2022-12-13 01:45:47,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:47,523 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:47,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:47,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2022-12-13 01:45:47,523 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:47,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1849696944, now seen corresponding path program 4 times [2022-12-13 01:45:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:47,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128084969] [2022-12-13 01:45:47,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:47,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:48,329 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-13 01:45:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:48,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128084969] [2022-12-13 01:45:48,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128084969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:48,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:48,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:48,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076930282] [2022-12-13 01:45:48,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:48,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:48,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:48,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:48,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:48,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:45:48,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 104 transitions, 1209 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:48,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:48,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:45:48,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:48,860 INFO L130 PetriNetUnfolder]: 1165/2427 cut-off events. [2022-12-13 01:45:48,860 INFO L131 PetriNetUnfolder]: For 19193/19193 co-relation queries the response was YES. [2022-12-13 01:45:48,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12605 conditions, 2427 events. 1165/2427 cut-off events. For 19193/19193 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16733 event pairs, 443 based on Foata normal form. 2/2429 useless extension candidates. Maximal degree in co-relation 12545. Up to 1088 conditions per place. [2022-12-13 01:45:48,871 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 161 selfloop transitions, 27 changer transitions 24/212 dead transitions. [2022-12-13 01:45:48,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 212 transitions, 2517 flow [2022-12-13 01:45:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2022-12-13 01:45:48,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39243498817966904 [2022-12-13 01:45:48,872 INFO L175 Difference]: Start difference. First operand has 107 places, 104 transitions, 1209 flow. Second operand 9 states and 166 transitions. [2022-12-13 01:45:48,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 212 transitions, 2517 flow [2022-12-13 01:45:48,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 212 transitions, 2462 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-13 01:45:48,899 INFO L231 Difference]: Finished difference. Result has 111 places, 97 transitions, 1138 flow [2022-12-13 01:45:48,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1138, PETRI_PLACES=111, PETRI_TRANSITIONS=97} [2022-12-13 01:45:48,900 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:45:48,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:48,900 INFO L89 Accepts]: Start accepts. Operand has 111 places, 97 transitions, 1138 flow [2022-12-13 01:45:48,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:48,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:48,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 97 transitions, 1138 flow [2022-12-13 01:45:48,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 97 transitions, 1138 flow [2022-12-13 01:45:48,937 INFO L130 PetriNetUnfolder]: 87/596 cut-off events. [2022-12-13 01:45:48,937 INFO L131 PetriNetUnfolder]: For 3497/3548 co-relation queries the response was YES. [2022-12-13 01:45:48,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 596 events. 87/596 cut-off events. For 3497/3548 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5281 event pairs, 10 based on Foata normal form. 12/580 useless extension candidates. Maximal degree in co-relation 2618. Up to 98 conditions per place. [2022-12-13 01:45:48,941 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 97 transitions, 1138 flow [2022-12-13 01:45:48,941 INFO L226 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-13 01:45:48,943 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:48,944 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 01:45:48,944 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 1138 flow [2022-12-13 01:45:48,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:48,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:48,944 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:48,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2022-12-13 01:45:48,944 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:48,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash 688913730, now seen corresponding path program 5 times [2022-12-13 01:45:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:48,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630470697] [2022-12-13 01:45:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:50,303 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-13 01:45:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:50,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630470697] [2022-12-13 01:45:50,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630470697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:50,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:50,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958276621] [2022-12-13 01:45:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:50,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:50,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:50,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:50,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:45:50,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 1138 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:50,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:50,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:45:50,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:50,833 INFO L130 PetriNetUnfolder]: 1125/2357 cut-off events. [2022-12-13 01:45:50,833 INFO L131 PetriNetUnfolder]: For 18446/18446 co-relation queries the response was YES. [2022-12-13 01:45:50,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12286 conditions, 2357 events. 1125/2357 cut-off events. For 18446/18446 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16211 event pairs, 414 based on Foata normal form. 2/2359 useless extension candidates. Maximal degree in co-relation 12226. Up to 1088 conditions per place. [2022-12-13 01:45:50,844 INFO L137 encePairwiseOnDemand]: 30/47 looper letters, 156 selfloop transitions, 22 changer transitions 28/206 dead transitions. [2022-12-13 01:45:50,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 206 transitions, 2401 flow [2022-12-13 01:45:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2022-12-13 01:45:50,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3971631205673759 [2022-12-13 01:45:50,845 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 1138 flow. Second operand 9 states and 168 transitions. [2022-12-13 01:45:50,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 206 transitions, 2401 flow [2022-12-13 01:45:50,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 206 transitions, 2307 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-12-13 01:45:50,868 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 1029 flow [2022-12-13 01:45:50,868 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1029, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2022-12-13 01:45:50,868 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:45:50,868 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:50,868 INFO L89 Accepts]: Start accepts. Operand has 111 places, 91 transitions, 1029 flow [2022-12-13 01:45:50,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:50,869 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:50,869 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 91 transitions, 1029 flow [2022-12-13 01:45:50,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 91 transitions, 1029 flow [2022-12-13 01:45:50,903 INFO L130 PetriNetUnfolder]: 81/558 cut-off events. [2022-12-13 01:45:50,903 INFO L131 PetriNetUnfolder]: For 3085/3130 co-relation queries the response was YES. [2022-12-13 01:45:50,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2413 conditions, 558 events. 81/558 cut-off events. For 3085/3130 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4827 event pairs, 8 based on Foata normal form. 12/546 useless extension candidates. Maximal degree in co-relation 2362. Up to 93 conditions per place. [2022-12-13 01:45:50,907 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 91 transitions, 1029 flow [2022-12-13 01:45:50,907 INFO L226 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-13 01:45:51,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (not (= (ite (= (mod v_~e2~0_229 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (or (<= v_~n1~0_313 v_~n2~0_285) (= v_~n2~0_285 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= v_~i~0_491 (select (select |v_#memory_int_367| v_~f~0.base_290) (+ v_~f~0.offset_297 (* v_~i1~0_227 4)))) (= v_~i1~0_227 v_~i~0_492)) InVars {~n2~0=v_~n2~0_285, ~i~0=v_~i~0_492, ~f~0.base=v_~f~0.base_290, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229} OutVars{~n2~0=v_~n2~0_285, ~i~0=v_~i~0_491, ~f~0.base=v_~f~0.base_290, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~i1~0=v_~i1~0_227, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_144|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 01:45:51,156 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (not (= (ite (= (mod v_~e2~0_229 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (or (<= v_~n1~0_313 v_~n2~0_285) (= v_~n2~0_285 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= v_~i~0_491 (select (select |v_#memory_int_367| v_~f~0.base_290) (+ v_~f~0.offset_297 (* v_~i1~0_227 4)))) (= v_~i1~0_227 v_~i~0_492)) InVars {~n2~0=v_~n2~0_285, ~i~0=v_~i~0_492, ~f~0.base=v_~f~0.base_290, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229} OutVars{~n2~0=v_~n2~0_285, ~i~0=v_~i~0_491, ~f~0.base=v_~f~0.base_290, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~i1~0=v_~i1~0_227, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_144|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:45:51,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] L53-->L97: Formula: (and (= v_~e2~0_167 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|) (= (+ v_~tmp1~0_123 1) v_~n1~0_225) (= v_~e1~0_133 0) (= (+ v_~tmp2~0_121 1) v_~n2~0_206) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| (ite (= (mod v_~e1~0_133 256) 0) 1 0))) InVars {~tmp2~0=v_~tmp2~0_121, ~tmp1~0=v_~tmp1~0_123} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|, ~n2~0=v_~n2~0_206, ~n1~0=v_~n1~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77|, ~tmp2~0=v_~tmp2~0_121, ~e2~0=v_~e2~0_167, ~tmp1~0=v_~tmp1~0_123, ~e1~0=v_~e1~0_133} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0, ~e1~0] and [890] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_538| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_538|) (= v_~i1~0_605 v_~i~0_1695) (= |v_thread1Thread1of1ForFork1_#res#1.base_68| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_68| 0) (= v_~n1~0_954 0) (= (ite (and (<= 0 v_~i~0_1694) (< v_~i~0_1694 v_~n~0_565)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_538|) (= v_~i~0_1694 (select (select |v_#memory_int_1018| v_~f~0.base_908) (+ v_~f~0.offset_917 (* v_~i1~0_605 4)))) (not (= (ite (or (<= v_~n1~0_955 v_~n2~0_1050) (= v_~n2~0_1050 0)) 1 0) 0)) (not (= (ite (= 0 (mod v_~e2~0_848 256)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_538| 0))) InVars {~n2~0=v_~n2~0_1050, ~i~0=v_~i~0_1695, ~f~0.base=v_~f~0.base_908, ~n1~0=v_~n1~0_955, #memory_int=|v_#memory_int_1018|, ~n~0=v_~n~0_565, ~f~0.offset=v_~f~0.offset_917, ~e2~0=v_~e2~0_848} OutVars{~n2~0=v_~n2~0_1050, ~i~0=v_~i~0_1694, ~n1~0=v_~n1~0_954, ~f~0.base=v_~f~0.base_908, ~i1~0=v_~i1~0_605, ~f~0.offset=v_~f~0.offset_917, ~e2~0=v_~e2~0_848, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_538|, #memory_int=|v_#memory_int_1018|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_68|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_68|, ~n~0=v_~n~0_565, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_508|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_538|} AuxVars[] AssignedVars[~i~0, ~n1~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:45:51,349 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [893] L59-->L155-3: Formula: (and (not (= (ite (= (mod v_~e2~0_854 256) 0) 1 0) 0)) (= v_~i1~0_611 v_~i~0_1707) (= (+ |v_#pthreadsForks_213| 1) |v_#pthreadsForks_212|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_548| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_548|) (= |v_ULTIMATE.start_main_#t~pre17#1_101| |v_#pthreadsForks_213|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_548| 0)) (= v_~i~0_1706 (select (select |v_#memory_int_1027| v_~f~0.base_914) (+ v_~f~0.offset_923 (* v_~i1~0_611 4)))) (= (store |v_#memory_int_1027| |v_ULTIMATE.start_main_~#t3~0#1.base_193| (store (select |v_#memory_int_1027| |v_ULTIMATE.start_main_~#t3~0#1.base_193|) |v_ULTIMATE.start_main_~#t3~0#1.offset_97| |v_ULTIMATE.start_main_#t~pre17#1_101|)) |v_#memory_int_1026|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_548| (ite (or (= v_~n2~0_1056 0) (<= v_~n1~0_962 v_~n2~0_1056)) 1 0))) InVars {#pthreadsForks=|v_#pthreadsForks_213|, ~n2~0=v_~n2~0_1056, ~i~0=v_~i~0_1707, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_97|, ~f~0.base=v_~f~0.base_914, ~n1~0=v_~n1~0_962, #memory_int=|v_#memory_int_1027|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_193|, ~f~0.offset=v_~f~0.offset_923, ~e2~0=v_~e2~0_854} OutVars{~n2~0=v_~n2~0_1056, ~i~0=v_~i~0_1706, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_97|, ~f~0.base=v_~f~0.base_914, ~n1~0=v_~n1~0_962, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_193|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_123|, ~i1~0=v_~i1~0_611, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_101|, ~f~0.offset=v_~f~0.offset_923, ~e2~0=v_~e2~0_854, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_91|, #pthreadsForks=|v_#pthreadsForks_212|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_548|, #memory_int=|v_#memory_int_1026|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_514|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_548|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, ~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre15#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, ULTIMATE.start_main_#t~pre17#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [506] L71-->L74: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= (ite (and (<= 0 v_~i~0_32) (< v_~i~0_32 v_~n~0_22)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~n~0=v_~n~0_22, ~i~0=v_~i~0_32} OutVars{~n~0=v_~n~0_22, ~i~0=v_~i~0_32, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:45:51,454 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 01:45:51,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 586 [2022-12-13 01:45:51,454 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 90 transitions, 1107 flow [2022-12-13 01:45:51,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:51,455 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:51,455 INFO L214 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] [2022-12-13 01:45:51,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2022-12-13 01:45:51,455 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1987500469, now seen corresponding path program 1 times [2022-12-13 01:45:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:51,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632013916] [2022-12-13 01:45:51,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:51,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:45:52,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:52,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632013916] [2022-12-13 01:45:52,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632013916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:45:52,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973823861] [2022-12-13 01:45:52,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:52,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:45:52,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:45:52,154 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:45:52,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 01:45:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:52,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 01:45:52,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:45:52,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:45:52,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:45:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:45:52,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:45:52,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973823861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:52,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:45:52,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 01:45:52,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758848469] [2022-12-13 01:45:52,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:52,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:45:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:52,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:45:52,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:45:52,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:45:52,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 90 transitions, 1107 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:52,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:52,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:45:52,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:52,771 INFO L130 PetriNetUnfolder]: 1092/2264 cut-off events. [2022-12-13 01:45:52,772 INFO L131 PetriNetUnfolder]: For 20304/20304 co-relation queries the response was YES. [2022-12-13 01:45:52,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11833 conditions, 2264 events. 1092/2264 cut-off events. For 20304/20304 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15319 event pairs, 406 based on Foata normal form. 2/2266 useless extension candidates. Maximal degree in co-relation 11773. Up to 1668 conditions per place. [2022-12-13 01:45:52,785 INFO L137 encePairwiseOnDemand]: 37/53 looper letters, 94 selfloop transitions, 27 changer transitions 18/139 dead transitions. [2022-12-13 01:45:52,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 139 transitions, 1716 flow [2022-12-13 01:45:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:45:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:45:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-13 01:45:52,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41509433962264153 [2022-12-13 01:45:52,786 INFO L175 Difference]: Start difference. First operand has 107 places, 90 transitions, 1107 flow. Second operand 5 states and 110 transitions. [2022-12-13 01:45:52,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 139 transitions, 1716 flow [2022-12-13 01:45:52,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 139 transitions, 1620 flow, removed 26 selfloop flow, removed 10 redundant places. [2022-12-13 01:45:52,813 INFO L231 Difference]: Finished difference. Result has 104 places, 94 transitions, 1155 flow [2022-12-13 01:45:52,813 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1155, PETRI_PLACES=104, PETRI_TRANSITIONS=94} [2022-12-13 01:45:52,813 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places. [2022-12-13 01:45:52,813 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:52,813 INFO L89 Accepts]: Start accepts. Operand has 104 places, 94 transitions, 1155 flow [2022-12-13 01:45:52,814 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:52,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:52,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 94 transitions, 1155 flow [2022-12-13 01:45:52,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 94 transitions, 1155 flow [2022-12-13 01:45:52,853 INFO L130 PetriNetUnfolder]: 84/585 cut-off events. [2022-12-13 01:45:52,853 INFO L131 PetriNetUnfolder]: For 4074/4138 co-relation queries the response was YES. [2022-12-13 01:45:52,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 585 events. 84/585 cut-off events. For 4074/4138 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5091 event pairs, 6 based on Foata normal form. 13/570 useless extension candidates. Maximal degree in co-relation 2465. Up to 110 conditions per place. [2022-12-13 01:45:52,857 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 94 transitions, 1155 flow [2022-12-13 01:45:52,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-13 01:45:52,867 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:52,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 01:45:52,868 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 94 transitions, 1155 flow [2022-12-13 01:45:52,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:45:52,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:52,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:52,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 01:45:53,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:45:53,073 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash 270271426, now seen corresponding path program 1 times [2022-12-13 01:45:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:53,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815522818] [2022-12-13 01:45:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:53,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:54,059 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-13 01:45:54,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:54,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815522818] [2022-12-13 01:45:54,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815522818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:54,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:54,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:54,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667259118] [2022-12-13 01:45:54,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:54,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:54,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:54,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:54,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:54,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:45:54,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 1155 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:54,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:54,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:45:54,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:54,653 INFO L130 PetriNetUnfolder]: 1161/2440 cut-off events. [2022-12-13 01:45:54,653 INFO L131 PetriNetUnfolder]: For 20252/20252 co-relation queries the response was YES. [2022-12-13 01:45:54,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12716 conditions, 2440 events. 1161/2440 cut-off events. For 20252/20252 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17095 event pairs, 437 based on Foata normal form. 3/2443 useless extension candidates. Maximal degree in co-relation 12195. Up to 1168 conditions per place. [2022-12-13 01:45:54,663 INFO L137 encePairwiseOnDemand]: 33/53 looper letters, 148 selfloop transitions, 23 changer transitions 32/203 dead transitions. [2022-12-13 01:45:54,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 203 transitions, 2425 flow [2022-12-13 01:45:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2022-12-13 01:45:54,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3417190775681342 [2022-12-13 01:45:54,664 INFO L175 Difference]: Start difference. First operand has 104 places, 94 transitions, 1155 flow. Second operand 9 states and 163 transitions. [2022-12-13 01:45:54,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 203 transitions, 2425 flow [2022-12-13 01:45:54,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 203 transitions, 2369 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 01:45:54,691 INFO L231 Difference]: Finished difference. Result has 114 places, 94 transitions, 1172 flow [2022-12-13 01:45:54,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1172, PETRI_PLACES=114, PETRI_TRANSITIONS=94} [2022-12-13 01:45:54,691 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places. [2022-12-13 01:45:54,691 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:54,691 INFO L89 Accepts]: Start accepts. Operand has 114 places, 94 transitions, 1172 flow [2022-12-13 01:45:54,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:54,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:54,692 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 94 transitions, 1172 flow [2022-12-13 01:45:54,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 94 transitions, 1172 flow [2022-12-13 01:45:54,731 INFO L130 PetriNetUnfolder]: 79/569 cut-off events. [2022-12-13 01:45:54,731 INFO L131 PetriNetUnfolder]: For 4002/4058 co-relation queries the response was YES. [2022-12-13 01:45:54,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2577 conditions, 569 events. 79/569 cut-off events. For 4002/4058 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4954 event pairs, 6 based on Foata normal form. 17/559 useless extension candidates. Maximal degree in co-relation 2523. Up to 93 conditions per place. [2022-12-13 01:45:54,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 94 transitions, 1172 flow [2022-12-13 01:45:54,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-13 01:45:54,739 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:54,739 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 01:45:54,739 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 94 transitions, 1172 flow [2022-12-13 01:45:54,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:54,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:54,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:54,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2022-12-13 01:45:54,740 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:54,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:54,745 INFO L85 PathProgramCache]: Analyzing trace with hash -837737284, now seen corresponding path program 1 times [2022-12-13 01:45:54,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:54,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801420319] [2022-12-13 01:45:54,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:54,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:55,861 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-13 01:45:55,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:55,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801420319] [2022-12-13 01:45:55,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801420319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:55,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:55,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:55,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868627087] [2022-12-13 01:45:55,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:55,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:55,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:55,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:55,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:55,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 01:45:55,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 94 transitions, 1172 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:55,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:55,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 01:45:55,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:56,421 INFO L130 PetriNetUnfolder]: 1056/2224 cut-off events. [2022-12-13 01:45:56,421 INFO L131 PetriNetUnfolder]: For 19668/19668 co-relation queries the response was YES. [2022-12-13 01:45:56,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11816 conditions, 2224 events. 1056/2224 cut-off events. For 19668/19668 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15239 event pairs, 389 based on Foata normal form. 3/2227 useless extension candidates. Maximal degree in co-relation 11753. Up to 1168 conditions per place. [2022-12-13 01:45:56,432 INFO L137 encePairwiseOnDemand]: 33/51 looper letters, 143 selfloop transitions, 21 changer transitions 30/194 dead transitions. [2022-12-13 01:45:56,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 194 transitions, 2302 flow [2022-12-13 01:45:56,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:45:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:45:56,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2022-12-13 01:45:56,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3464052287581699 [2022-12-13 01:45:56,433 INFO L175 Difference]: Start difference. First operand has 112 places, 94 transitions, 1172 flow. Second operand 9 states and 159 transitions. [2022-12-13 01:45:56,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 194 transitions, 2302 flow [2022-12-13 01:45:56,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 194 transitions, 2247 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-13 01:45:56,459 INFO L231 Difference]: Finished difference. Result has 117 places, 91 transitions, 1146 flow [2022-12-13 01:45:56,459 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1146, PETRI_PLACES=117, PETRI_TRANSITIONS=91} [2022-12-13 01:45:56,459 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2022-12-13 01:45:56,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:56,459 INFO L89 Accepts]: Start accepts. Operand has 117 places, 91 transitions, 1146 flow [2022-12-13 01:45:56,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:56,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:56,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 91 transitions, 1146 flow [2022-12-13 01:45:56,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 91 transitions, 1146 flow [2022-12-13 01:45:56,494 INFO L130 PetriNetUnfolder]: 71/517 cut-off events. [2022-12-13 01:45:56,494 INFO L131 PetriNetUnfolder]: For 3908/3961 co-relation queries the response was YES. [2022-12-13 01:45:56,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 517 events. 71/517 cut-off events. For 3908/3961 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4352 event pairs, 6 based on Foata normal form. 14/506 useless extension candidates. Maximal degree in co-relation 2347. Up to 93 conditions per place. [2022-12-13 01:45:56,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 91 transitions, 1146 flow [2022-12-13 01:45:56,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-13 01:45:56,604 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:56,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:45:56,604 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 1174 flow [2022-12-13 01:45:56,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:56,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:56,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:56,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2022-12-13 01:45:56,605 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:56,605 INFO L85 PathProgramCache]: Analyzing trace with hash -869935912, now seen corresponding path program 1 times [2022-12-13 01:45:56,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:56,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899036208] [2022-12-13 01:45:56,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:56,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:57,132 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-13 01:45:57,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:57,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899036208] [2022-12-13 01:45:57,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899036208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:57,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:57,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:45:57,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155970457] [2022-12-13 01:45:57,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:57,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:45:57,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:57,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:45:57,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:45:57,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 01:45:57,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 1174 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:45:57,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:57,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 01:45:57,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:57,523 INFO L130 PetriNetUnfolder]: 971/2049 cut-off events. [2022-12-13 01:45:57,523 INFO L131 PetriNetUnfolder]: For 20738/20738 co-relation queries the response was YES. [2022-12-13 01:45:57,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11075 conditions, 2049 events. 971/2049 cut-off events. For 20738/20738 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13666 event pairs, 420 based on Foata normal form. 3/2052 useless extension candidates. Maximal degree in co-relation 11011. Up to 1168 conditions per place. [2022-12-13 01:45:57,532 INFO L137 encePairwiseOnDemand]: 38/54 looper letters, 134 selfloop transitions, 14 changer transitions 35/183 dead transitions. [2022-12-13 01:45:57,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 183 transitions, 2223 flow [2022-12-13 01:45:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:45:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:45:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2022-12-13 01:45:57,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2022-12-13 01:45:57,533 INFO L175 Difference]: Start difference. First operand has 114 places, 90 transitions, 1174 flow. Second operand 8 states and 152 transitions. [2022-12-13 01:45:57,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 183 transitions, 2223 flow [2022-12-13 01:45:57,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 183 transitions, 2137 flow, removed 9 selfloop flow, removed 11 redundant places. [2022-12-13 01:45:57,560 INFO L231 Difference]: Finished difference. Result has 112 places, 84 transitions, 942 flow [2022-12-13 01:45:57,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=942, PETRI_PLACES=112, PETRI_TRANSITIONS=84} [2022-12-13 01:45:57,561 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2022-12-13 01:45:57,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:57,561 INFO L89 Accepts]: Start accepts. Operand has 112 places, 84 transitions, 942 flow [2022-12-13 01:45:57,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:57,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:57,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 84 transitions, 942 flow [2022-12-13 01:45:57,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 84 transitions, 942 flow [2022-12-13 01:45:57,592 INFO L130 PetriNetUnfolder]: 64/481 cut-off events. [2022-12-13 01:45:57,592 INFO L131 PetriNetUnfolder]: For 3042/3082 co-relation queries the response was YES. [2022-12-13 01:45:57,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2034 conditions, 481 events. 64/481 cut-off events. For 3042/3082 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3973 event pairs, 9 based on Foata normal form. 10/466 useless extension candidates. Maximal degree in co-relation 1980. Up to 87 conditions per place. [2022-12-13 01:45:57,595 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 84 transitions, 942 flow [2022-12-13 01:45:57,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 01:45:57,598 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:45:57,598 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 01:45:57,598 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 84 transitions, 942 flow [2022-12-13 01:45:57,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:45:57,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:57,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:57,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2022-12-13 01:45:57,598 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1798267203, now seen corresponding path program 1 times [2022-12-13 01:45:57,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:57,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734944572] [2022-12-13 01:45:57,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:57,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:58,278 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-13 01:45:58,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:58,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734944572] [2022-12-13 01:45:58,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734944572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:58,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:58,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:45:58,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647200178] [2022-12-13 01:45:58,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:58,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:45:58,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:45:58,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:45:58,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:45:58,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 84 transitions, 942 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:58,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:58,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:45:58,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:45:58,797 INFO L130 PetriNetUnfolder]: 916/1949 cut-off events. [2022-12-13 01:45:58,797 INFO L131 PetriNetUnfolder]: For 16054/16054 co-relation queries the response was YES. [2022-12-13 01:45:58,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9900 conditions, 1949 events. 916/1949 cut-off events. For 16054/16054 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12856 event pairs, 329 based on Foata normal form. 2/1951 useless extension candidates. Maximal degree in co-relation 9831. Up to 1168 conditions per place. [2022-12-13 01:45:58,808 INFO L137 encePairwiseOnDemand]: 34/49 looper letters, 164 selfloop transitions, 20 changer transitions 11/195 dead transitions. [2022-12-13 01:45:58,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 195 transitions, 2140 flow [2022-12-13 01:45:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:45:58,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:45:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2022-12-13 01:45:58,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33877551020408164 [2022-12-13 01:45:58,809 INFO L175 Difference]: Start difference. First operand has 109 places, 84 transitions, 942 flow. Second operand 10 states and 166 transitions. [2022-12-13 01:45:58,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 195 transitions, 2140 flow [2022-12-13 01:45:58,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 195 transitions, 2079 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-12-13 01:45:58,833 INFO L231 Difference]: Finished difference. Result has 113 places, 91 transitions, 1061 flow [2022-12-13 01:45:58,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1061, PETRI_PLACES=113, PETRI_TRANSITIONS=91} [2022-12-13 01:45:58,833 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2022-12-13 01:45:58,833 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:45:58,833 INFO L89 Accepts]: Start accepts. Operand has 113 places, 91 transitions, 1061 flow [2022-12-13 01:45:58,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:45:58,834 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:45:58,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 91 transitions, 1061 flow [2022-12-13 01:45:58,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 91 transitions, 1061 flow [2022-12-13 01:45:58,868 INFO L130 PetriNetUnfolder]: 60/490 cut-off events. [2022-12-13 01:45:58,868 INFO L131 PetriNetUnfolder]: For 3149/3184 co-relation queries the response was YES. [2022-12-13 01:45:58,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 490 events. 60/490 cut-off events. For 3149/3184 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4100 event pairs, 5 based on Foata normal form. 10/475 useless extension candidates. Maximal degree in co-relation 2005. Up to 87 conditions per place. [2022-12-13 01:45:58,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 91 transitions, 1061 flow [2022-12-13 01:45:58,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 548 [2022-12-13 01:45:59,007 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:45:59,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-13 01:45:59,008 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 90 transitions, 1077 flow [2022-12-13 01:45:59,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:45:59,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:45:59,008 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:45:59,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2022-12-13 01:45:59,008 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:45:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:45:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2147363711, now seen corresponding path program 1 times [2022-12-13 01:45:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:45:59,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304416581] [2022-12-13 01:45:59,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:45:59,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:45:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:45:59,742 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-13 01:45:59,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:45:59,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304416581] [2022-12-13 01:45:59,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304416581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:45:59,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:45:59,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:45:59,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685853354] [2022-12-13 01:45:59,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:45:59,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:45:59,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:45:59,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:45:59,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:45:59,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 01:45:59,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 90 transitions, 1077 flow. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:45:59,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:45:59,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 01:45:59,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:00,203 INFO L130 PetriNetUnfolder]: 888/1877 cut-off events. [2022-12-13 01:46:00,203 INFO L131 PetriNetUnfolder]: For 17528/17528 co-relation queries the response was YES. [2022-12-13 01:46:00,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9805 conditions, 1877 events. 888/1877 cut-off events. For 17528/17528 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12243 event pairs, 342 based on Foata normal form. 2/1879 useless extension candidates. Maximal degree in co-relation 9741. Up to 1168 conditions per place. [2022-12-13 01:46:00,214 INFO L137 encePairwiseOnDemand]: 37/52 looper letters, 148 selfloop transitions, 20 changer transitions 16/184 dead transitions. [2022-12-13 01:46:00,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 184 transitions, 2122 flow [2022-12-13 01:46:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:46:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:46:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2022-12-13 01:46:00,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3311965811965812 [2022-12-13 01:46:00,215 INFO L175 Difference]: Start difference. First operand has 111 places, 90 transitions, 1077 flow. Second operand 9 states and 155 transitions. [2022-12-13 01:46:00,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 184 transitions, 2122 flow [2022-12-13 01:46:00,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 184 transitions, 2050 flow, removed 26 selfloop flow, removed 7 redundant places. [2022-12-13 01:46:00,239 INFO L231 Difference]: Finished difference. Result has 114 places, 91 transitions, 1080 flow [2022-12-13 01:46:00,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1080, PETRI_PLACES=114, PETRI_TRANSITIONS=91} [2022-12-13 01:46:00,239 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places. [2022-12-13 01:46:00,240 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:00,240 INFO L89 Accepts]: Start accepts. Operand has 114 places, 91 transitions, 1080 flow [2022-12-13 01:46:00,240 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:00,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:00,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 91 transitions, 1080 flow [2022-12-13 01:46:00,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 91 transitions, 1080 flow [2022-12-13 01:46:00,271 INFO L130 PetriNetUnfolder]: 61/481 cut-off events. [2022-12-13 01:46:00,271 INFO L131 PetriNetUnfolder]: For 3208/3250 co-relation queries the response was YES. [2022-12-13 01:46:00,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 481 events. 61/481 cut-off events. For 3208/3250 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3958 event pairs, 4 based on Foata normal form. 11/467 useless extension candidates. Maximal degree in co-relation 2020. Up to 86 conditions per place. [2022-12-13 01:46:00,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 91 transitions, 1080 flow [2022-12-13 01:46:00,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-13 01:46:00,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [892] L59-->L154-3: Formula: (and (= |v_#memory_int_1022| (store |v_#memory_int_1023| |v_ULTIMATE.start_main_~#t2~0#1.base_145| (store (select |v_#memory_int_1023| |v_ULTIMATE.start_main_~#t2~0#1.base_145|) |v_ULTIMATE.start_main_~#t2~0#1.offset_81| |v_ULTIMATE.start_main_#t~pre15#1_121|))) (= v_~i~0_1702 (select (select |v_#memory_int_1023| v_~f~0.base_912) (+ v_~f~0.offset_921 (* v_~i1~0_609 4)))) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_546| 0)) (= (+ |v_#pthreadsForks_209| 1) |v_#pthreadsForks_208|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_546| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_546|) (= |v_#pthreadsForks_209| |v_ULTIMATE.start_main_#t~pre15#1_121|) (= v_~i1~0_609 v_~i~0_1703) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_546| (ite (or (<= v_~n1~0_960 v_~n2~0_1054) (= v_~n2~0_1054 0)) 1 0)) (not (= (ite (= (mod v_~e2~0_852 256) 0) 1 0) 0))) InVars {#pthreadsForks=|v_#pthreadsForks_209|, ~n2~0=v_~n2~0_1054, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_81|, ~i~0=v_~i~0_1703, ~f~0.base=v_~f~0.base_912, ~n1~0=v_~n1~0_960, #memory_int=|v_#memory_int_1023|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_145|, ~f~0.offset=v_~f~0.offset_921, ~e2~0=v_~e2~0_852} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_105|, ~n2~0=v_~n2~0_1054, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_81|, ~i~0=v_~i~0_1702, ~f~0.base=v_~f~0.base_912, ~n1~0=v_~n1~0_960, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_121|, ~i1~0=v_~i1~0_609, ~f~0.offset=v_~f~0.offset_921, ~e2~0=v_~e2~0_852, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_73|, #pthreadsForks=|v_#pthreadsForks_208|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_546|, #memory_int=|v_#memory_int_1022|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_512|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_145|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_546|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre15#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, ULTIMATE.start_main_#t~nondet14#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [506] L71-->L74: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= (ite (and (<= 0 v_~i~0_32) (< v_~i~0_32 v_~n~0_22)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~n~0=v_~n~0_22, ~i~0=v_~i~0_32} OutVars{~n~0=v_~n~0_22, ~i~0=v_~i~0_32, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:46:00,384 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:46:00,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:46:00,385 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 91 transitions, 1100 flow [2022-12-13 01:46:00,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:00,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:00,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:00,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2022-12-13 01:46:00,385 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:00,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:00,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1623943640, now seen corresponding path program 1 times [2022-12-13 01:46:00,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:00,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662781750] [2022-12-13 01:46:00,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:00,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:01,006 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-13 01:46:01,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:01,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662781750] [2022-12-13 01:46:01,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662781750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:01,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:01,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:46:01,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580797955] [2022-12-13 01:46:01,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:01,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:46:01,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:46:01,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:46:01,007 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:46:01,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 91 transitions, 1100 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:01,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:01,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:46:01,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:01,461 INFO L130 PetriNetUnfolder]: 860/1849 cut-off events. [2022-12-13 01:46:01,462 INFO L131 PetriNetUnfolder]: For 16206/16206 co-relation queries the response was YES. [2022-12-13 01:46:01,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9574 conditions, 1849 events. 860/1849 cut-off events. For 16206/16206 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12181 event pairs, 335 based on Foata normal form. 2/1851 useless extension candidates. Maximal degree in co-relation 9512. Up to 1168 conditions per place. [2022-12-13 01:46:01,472 INFO L137 encePairwiseOnDemand]: 39/53 looper letters, 141 selfloop transitions, 15 changer transitions 24/180 dead transitions. [2022-12-13 01:46:01,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 180 transitions, 2097 flow [2022-12-13 01:46:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:46:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:46:01,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2022-12-13 01:46:01,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3561320754716981 [2022-12-13 01:46:01,472 INFO L175 Difference]: Start difference. First operand has 112 places, 91 transitions, 1100 flow. Second operand 8 states and 151 transitions. [2022-12-13 01:46:01,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 180 transitions, 2097 flow [2022-12-13 01:46:01,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 180 transitions, 2039 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-13 01:46:01,504 INFO L231 Difference]: Finished difference. Result has 114 places, 87 transitions, 997 flow [2022-12-13 01:46:01,505 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=997, PETRI_PLACES=114, PETRI_TRANSITIONS=87} [2022-12-13 01:46:01,505 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places. [2022-12-13 01:46:01,505 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:01,505 INFO L89 Accepts]: Start accepts. Operand has 114 places, 87 transitions, 997 flow [2022-12-13 01:46:01,505 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:01,506 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:01,506 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 87 transitions, 997 flow [2022-12-13 01:46:01,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 87 transitions, 997 flow [2022-12-13 01:46:01,535 INFO L130 PetriNetUnfolder]: 57/449 cut-off events. [2022-12-13 01:46:01,535 INFO L131 PetriNetUnfolder]: For 2862/2891 co-relation queries the response was YES. [2022-12-13 01:46:01,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1933 conditions, 449 events. 57/449 cut-off events. For 2862/2891 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3623 event pairs, 4 based on Foata normal form. 10/436 useless extension candidates. Maximal degree in co-relation 1879. Up to 78 conditions per place. [2022-12-13 01:46:01,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 87 transitions, 997 flow [2022-12-13 01:46:01,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-13 01:46:01,541 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:01,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 01:46:01,541 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 87 transitions, 997 flow [2022-12-13 01:46:01,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:01,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:01,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:01,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2022-12-13 01:46:01,542 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1531066165, now seen corresponding path program 1 times [2022-12-13 01:46:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:01,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974828256] [2022-12-13 01:46:01,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:02,304 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-13 01:46:02,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:02,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974828256] [2022-12-13 01:46:02,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974828256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:02,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:02,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:46:02,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345314674] [2022-12-13 01:46:02,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:02,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:46:02,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:02,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:46:02,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:46:02,305 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:46:02,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 87 transitions, 997 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:02,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:02,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:46:02,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:02,759 INFO L130 PetriNetUnfolder]: 832/1797 cut-off events. [2022-12-13 01:46:02,759 INFO L131 PetriNetUnfolder]: For 14497/14497 co-relation queries the response was YES. [2022-12-13 01:46:02,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9133 conditions, 1797 events. 832/1797 cut-off events. For 14497/14497 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11874 event pairs, 347 based on Foata normal form. 2/1799 useless extension candidates. Maximal degree in co-relation 9070. Up to 1168 conditions per place. [2022-12-13 01:46:02,766 INFO L137 encePairwiseOnDemand]: 35/50 looper letters, 131 selfloop transitions, 12 changer transitions 39/182 dead transitions. [2022-12-13 01:46:02,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 182 transitions, 2055 flow [2022-12-13 01:46:02,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:46:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:46:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2022-12-13 01:46:02,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3377777777777778 [2022-12-13 01:46:02,767 INFO L175 Difference]: Start difference. First operand has 111 places, 87 transitions, 997 flow. Second operand 9 states and 152 transitions. [2022-12-13 01:46:02,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 182 transitions, 2055 flow [2022-12-13 01:46:02,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 182 transitions, 2013 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 01:46:02,786 INFO L231 Difference]: Finished difference. Result has 114 places, 83 transitions, 913 flow [2022-12-13 01:46:02,786 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=913, PETRI_PLACES=114, PETRI_TRANSITIONS=83} [2022-12-13 01:46:02,786 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places. [2022-12-13 01:46:02,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:02,786 INFO L89 Accepts]: Start accepts. Operand has 114 places, 83 transitions, 913 flow [2022-12-13 01:46:02,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:02,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:02,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 83 transitions, 913 flow [2022-12-13 01:46:02,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 83 transitions, 913 flow [2022-12-13 01:46:02,813 INFO L130 PetriNetUnfolder]: 55/411 cut-off events. [2022-12-13 01:46:02,813 INFO L131 PetriNetUnfolder]: For 2243/2270 co-relation queries the response was YES. [2022-12-13 01:46:02,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 411 events. 55/411 cut-off events. For 2243/2270 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3215 event pairs, 4 based on Foata normal form. 10/402 useless extension candidates. Maximal degree in co-relation 1709. Up to 68 conditions per place. [2022-12-13 01:46:02,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 83 transitions, 913 flow [2022-12-13 01:46:02,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-13 01:46:02,820 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:02,820 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 01:46:02,820 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 83 transitions, 913 flow [2022-12-13 01:46:02,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:02,820 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:02,820 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:02,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2022-12-13 01:46:02,820 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:02,821 INFO L85 PathProgramCache]: Analyzing trace with hash 908018477, now seen corresponding path program 2 times [2022-12-13 01:46:02,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:02,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399454221] [2022-12-13 01:46:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:02,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:03,522 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-13 01:46:03,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:03,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399454221] [2022-12-13 01:46:03,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399454221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:03,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:03,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:46:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122665224] [2022-12-13 01:46:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:03,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:46:03,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:03,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:46:03,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:46:03,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:46:03,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 83 transitions, 913 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:03,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:03,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:46:03,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:03,995 INFO L130 PetriNetUnfolder]: 774/1661 cut-off events. [2022-12-13 01:46:03,995 INFO L131 PetriNetUnfolder]: For 11781/11781 co-relation queries the response was YES. [2022-12-13 01:46:04,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8413 conditions, 1661 events. 774/1661 cut-off events. For 11781/11781 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10613 event pairs, 311 based on Foata normal form. 2/1663 useless extension candidates. Maximal degree in co-relation 8350. Up to 1168 conditions per place. [2022-12-13 01:46:04,004 INFO L137 encePairwiseOnDemand]: 35/48 looper letters, 127 selfloop transitions, 11 changer transitions 31/169 dead transitions. [2022-12-13 01:46:04,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 169 transitions, 1910 flow [2022-12-13 01:46:04,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:46:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:46:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2022-12-13 01:46:04,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2022-12-13 01:46:04,005 INFO L175 Difference]: Start difference. First operand has 108 places, 83 transitions, 913 flow. Second operand 9 states and 140 transitions. [2022-12-13 01:46:04,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 169 transitions, 1910 flow [2022-12-13 01:46:04,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 169 transitions, 1830 flow, removed 28 selfloop flow, removed 9 redundant places. [2022-12-13 01:46:04,025 INFO L231 Difference]: Finished difference. Result has 110 places, 80 transitions, 846 flow [2022-12-13 01:46:04,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=846, PETRI_PLACES=110, PETRI_TRANSITIONS=80} [2022-12-13 01:46:04,026 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2022-12-13 01:46:04,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:04,026 INFO L89 Accepts]: Start accepts. Operand has 110 places, 80 transitions, 846 flow [2022-12-13 01:46:04,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:04,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:04,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 80 transitions, 846 flow [2022-12-13 01:46:04,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 80 transitions, 846 flow [2022-12-13 01:46:04,053 INFO L130 PetriNetUnfolder]: 54/408 cut-off events. [2022-12-13 01:46:04,053 INFO L131 PetriNetUnfolder]: For 2110/2135 co-relation queries the response was YES. [2022-12-13 01:46:04,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 408 events. 54/408 cut-off events. For 2110/2135 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3195 event pairs, 4 based on Foata normal form. 9/398 useless extension candidates. Maximal degree in co-relation 1662. Up to 65 conditions per place. [2022-12-13 01:46:04,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 80 transitions, 846 flow [2022-12-13 01:46:04,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 01:46:04,060 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:04,062 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 01:46:04,062 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 80 transitions, 846 flow [2022-12-13 01:46:04,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:04,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:04,062 INFO L214 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] [2022-12-13 01:46:04,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2022-12-13 01:46:04,062 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1773317180, now seen corresponding path program 1 times [2022-12-13 01:46:04,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:04,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087212044] [2022-12-13 01:46:04,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:04,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:04,776 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-13 01:46:04,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:04,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087212044] [2022-12-13 01:46:04,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087212044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:04,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:04,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:46:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469971376] [2022-12-13 01:46:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:04,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:46:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:04,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:46:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:46:04,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:46:04,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 80 transitions, 846 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:04,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:04,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:46:04,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:05,163 INFO L130 PetriNetUnfolder]: 734/1563 cut-off events. [2022-12-13 01:46:05,163 INFO L131 PetriNetUnfolder]: For 10728/10728 co-relation queries the response was YES. [2022-12-13 01:46:05,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7853 conditions, 1563 events. 734/1563 cut-off events. For 10728/10728 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9810 event pairs, 288 based on Foata normal form. 3/1566 useless extension candidates. Maximal degree in co-relation 7798. Up to 1168 conditions per place. [2022-12-13 01:46:05,171 INFO L137 encePairwiseOnDemand]: 34/47 looper letters, 104 selfloop transitions, 12 changer transitions 41/157 dead transitions. [2022-12-13 01:46:05,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 157 transitions, 1720 flow [2022-12-13 01:46:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:46:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:46:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2022-12-13 01:46:05,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30969267139479906 [2022-12-13 01:46:05,171 INFO L175 Difference]: Start difference. First operand has 105 places, 80 transitions, 846 flow. Second operand 9 states and 131 transitions. [2022-12-13 01:46:05,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 157 transitions, 1720 flow [2022-12-13 01:46:05,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 157 transitions, 1663 flow, removed 15 selfloop flow, removed 9 redundant places. [2022-12-13 01:46:05,188 INFO L231 Difference]: Finished difference. Result has 108 places, 81 transitions, 856 flow [2022-12-13 01:46:05,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=856, PETRI_PLACES=108, PETRI_TRANSITIONS=81} [2022-12-13 01:46:05,188 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:46:05,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:05,188 INFO L89 Accepts]: Start accepts. Operand has 108 places, 81 transitions, 856 flow [2022-12-13 01:46:05,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:05,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:05,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 81 transitions, 856 flow [2022-12-13 01:46:05,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 81 transitions, 856 flow [2022-12-13 01:46:05,212 INFO L130 PetriNetUnfolder]: 51/365 cut-off events. [2022-12-13 01:46:05,212 INFO L131 PetriNetUnfolder]: For 1911/1936 co-relation queries the response was YES. [2022-12-13 01:46:05,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 365 events. 51/365 cut-off events. For 1911/1936 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2706 event pairs, 4 based on Foata normal form. 9/355 useless extension candidates. Maximal degree in co-relation 1494. Up to 59 conditions per place. [2022-12-13 01:46:05,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 81 transitions, 856 flow [2022-12-13 01:46:05,214 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 01:46:05,215 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:05,215 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 01:46:05,215 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 81 transitions, 856 flow [2022-12-13 01:46:05,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:05,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:05,215 INFO L214 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] [2022-12-13 01:46:05,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2022-12-13 01:46:05,215 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:05,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:05,216 INFO L85 PathProgramCache]: Analyzing trace with hash -662926641, now seen corresponding path program 2 times [2022-12-13 01:46:05,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:05,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51185115] [2022-12-13 01:46:05,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:05,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:46:06,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:06,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51185115] [2022-12-13 01:46:06,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51185115] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:46:06,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733797396] [2022-12-13 01:46:06,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:46:06,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:46:06,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:46:06,091 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:46:06,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 01:46:06,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 01:46:06,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:46:06,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 01:46:06,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:46:06,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:46:06,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:46:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:46:06,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:46:06,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733797396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:06,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:46:06,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2022-12-13 01:46:06,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233460564] [2022-12-13 01:46:06,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:06,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:46:06,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:06,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:46:06,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:46:06,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:46:06,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 81 transitions, 856 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:06,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:06,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:46:06,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:06,725 INFO L130 PetriNetUnfolder]: 683/1457 cut-off events. [2022-12-13 01:46:06,725 INFO L131 PetriNetUnfolder]: For 10110/10110 co-relation queries the response was YES. [2022-12-13 01:46:06,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7316 conditions, 1457 events. 683/1457 cut-off events. For 10110/10110 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9022 event pairs, 206 based on Foata normal form. 2/1459 useless extension candidates. Maximal degree in co-relation 7261. Up to 1031 conditions per place. [2022-12-13 01:46:06,731 INFO L137 encePairwiseOnDemand]: 37/47 looper letters, 88 selfloop transitions, 15 changer transitions 21/124 dead transitions. [2022-12-13 01:46:06,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 124 transitions, 1406 flow [2022-12-13 01:46:06,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:46:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:46:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-13 01:46:06,732 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2022-12-13 01:46:06,732 INFO L175 Difference]: Start difference. First operand has 105 places, 81 transitions, 856 flow. Second operand 5 states and 100 transitions. [2022-12-13 01:46:06,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 124 transitions, 1406 flow [2022-12-13 01:46:06,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 124 transitions, 1368 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-13 01:46:06,747 INFO L231 Difference]: Finished difference. Result has 104 places, 80 transitions, 853 flow [2022-12-13 01:46:06,747 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=853, PETRI_PLACES=104, PETRI_TRANSITIONS=80} [2022-12-13 01:46:06,747 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places. [2022-12-13 01:46:06,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:06,747 INFO L89 Accepts]: Start accepts. Operand has 104 places, 80 transitions, 853 flow [2022-12-13 01:46:06,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:06,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:06,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 80 transitions, 853 flow [2022-12-13 01:46:06,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 80 transitions, 853 flow [2022-12-13 01:46:06,772 INFO L130 PetriNetUnfolder]: 48/368 cut-off events. [2022-12-13 01:46:06,772 INFO L131 PetriNetUnfolder]: For 1928/1953 co-relation queries the response was YES. [2022-12-13 01:46:06,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 368 events. 48/368 cut-off events. For 1928/1953 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2757 event pairs, 1 based on Foata normal form. 9/359 useless extension candidates. Maximal degree in co-relation 1444. Up to 59 conditions per place. [2022-12-13 01:46:06,774 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 80 transitions, 853 flow [2022-12-13 01:46:06,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-13 01:46:06,777 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:06,777 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 01:46:06,777 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 80 transitions, 853 flow [2022-12-13 01:46:06,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:06,777 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:06,777 INFO L214 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] [2022-12-13 01:46:06,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 01:46:06,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:46:06,983 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1872814770, now seen corresponding path program 1 times [2022-12-13 01:46:06,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:06,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785124536] [2022-12-13 01:46:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:46:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:07,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785124536] [2022-12-13 01:46:07,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785124536] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:46:07,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723529586] [2022-12-13 01:46:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:07,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:46:07,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:46:07,763 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:46:07,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 01:46:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:08,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 01:46:08,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:46:08,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:46:08,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:46:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:46:08,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:46:08,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723529586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:08,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:46:08,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2022-12-13 01:46:08,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861948297] [2022-12-13 01:46:08,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:08,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:46:08,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:08,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:46:08,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 01:46:08,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:46:08,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 80 transitions, 853 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:08,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:08,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:46:08,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:08,303 INFO L130 PetriNetUnfolder]: 672/1448 cut-off events. [2022-12-13 01:46:08,304 INFO L131 PetriNetUnfolder]: For 9954/9954 co-relation queries the response was YES. [2022-12-13 01:46:08,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7359 conditions, 1448 events. 672/1448 cut-off events. For 9954/9954 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8896 event pairs, 287 based on Foata normal form. 2/1450 useless extension candidates. Maximal degree in co-relation 6766. Up to 1250 conditions per place. [2022-12-13 01:46:08,310 INFO L137 encePairwiseOnDemand]: 39/47 looper letters, 78 selfloop transitions, 8 changer transitions 20/106 dead transitions. [2022-12-13 01:46:08,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 1230 flow [2022-12-13 01:46:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:46:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:46:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-13 01:46:08,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2765957446808511 [2022-12-13 01:46:08,310 INFO L175 Difference]: Start difference. First operand has 103 places, 80 transitions, 853 flow. Second operand 6 states and 78 transitions. [2022-12-13 01:46:08,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 1230 flow [2022-12-13 01:46:08,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 106 transitions, 1185 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 01:46:08,323 INFO L231 Difference]: Finished difference. Result has 106 places, 79 transitions, 815 flow [2022-12-13 01:46:08,324 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=815, PETRI_PLACES=106, PETRI_TRANSITIONS=79} [2022-12-13 01:46:08,324 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 01:46:08,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:08,324 INFO L89 Accepts]: Start accepts. Operand has 106 places, 79 transitions, 815 flow [2022-12-13 01:46:08,324 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:08,324 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:08,324 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 79 transitions, 815 flow [2022-12-13 01:46:08,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 79 transitions, 815 flow [2022-12-13 01:46:08,348 INFO L130 PetriNetUnfolder]: 47/371 cut-off events. [2022-12-13 01:46:08,348 INFO L131 PetriNetUnfolder]: For 1888/1908 co-relation queries the response was YES. [2022-12-13 01:46:08,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 371 events. 47/371 cut-off events. For 1888/1908 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2816 event pairs, 8 based on Foata normal form. 8/361 useless extension candidates. Maximal degree in co-relation 1501. Up to 58 conditions per place. [2022-12-13 01:46:08,350 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 79 transitions, 815 flow [2022-12-13 01:46:08,351 INFO L226 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-13 01:46:08,351 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:08,351 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 01:46:08,351 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 79 transitions, 815 flow [2022-12-13 01:46:08,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:08,352 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:08,352 INFO L214 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] [2022-12-13 01:46:08,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 01:46:08,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:46:08,553 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash 621003662, now seen corresponding path program 1 times [2022-12-13 01:46:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:08,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653336278] [2022-12-13 01:46:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:08,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:09,347 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-13 01:46:09,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:09,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653336278] [2022-12-13 01:46:09,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653336278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:09,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:09,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:46:09,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834452259] [2022-12-13 01:46:09,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:09,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:46:09,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:09,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:46:09,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:46:09,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:46:09,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 79 transitions, 815 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:09,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:09,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:46:09,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:09,797 INFO L130 PetriNetUnfolder]: 657/1395 cut-off events. [2022-12-13 01:46:09,798 INFO L131 PetriNetUnfolder]: For 9738/9738 co-relation queries the response was YES. [2022-12-13 01:46:09,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7024 conditions, 1395 events. 657/1395 cut-off events. For 9738/9738 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8429 event pairs, 311 based on Foata normal form. 2/1397 useless extension candidates. Maximal degree in co-relation 6975. Up to 1154 conditions per place. [2022-12-13 01:46:09,804 INFO L137 encePairwiseOnDemand]: 33/46 looper letters, 75 selfloop transitions, 7 changer transitions 46/128 dead transitions. [2022-12-13 01:46:09,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 128 transitions, 1416 flow [2022-12-13 01:46:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:46:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:46:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2022-12-13 01:46:09,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22608695652173913 [2022-12-13 01:46:09,805 INFO L175 Difference]: Start difference. First operand has 103 places, 79 transitions, 815 flow. Second operand 10 states and 104 transitions. [2022-12-13 01:46:09,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 128 transitions, 1416 flow [2022-12-13 01:46:09,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 128 transitions, 1392 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-12-13 01:46:09,817 INFO L231 Difference]: Finished difference. Result has 111 places, 75 transitions, 776 flow [2022-12-13 01:46:09,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=776, PETRI_PLACES=111, PETRI_TRANSITIONS=75} [2022-12-13 01:46:09,818 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 01:46:09,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:09,818 INFO L89 Accepts]: Start accepts. Operand has 111 places, 75 transitions, 776 flow [2022-12-13 01:46:09,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:09,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:09,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 75 transitions, 776 flow [2022-12-13 01:46:09,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 75 transitions, 776 flow [2022-12-13 01:46:09,841 INFO L130 PetriNetUnfolder]: 44/317 cut-off events. [2022-12-13 01:46:09,841 INFO L131 PetriNetUnfolder]: For 1655/1671 co-relation queries the response was YES. [2022-12-13 01:46:09,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 317 events. 44/317 cut-off events. For 1655/1671 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2340 event pairs, 8 based on Foata normal form. 5/306 useless extension candidates. Maximal degree in co-relation 1298. Up to 49 conditions per place. [2022-12-13 01:46:09,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 75 transitions, 776 flow [2022-12-13 01:46:09,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 434 [2022-12-13 01:46:14,294 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:46:14,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4476 [2022-12-13 01:46:14,294 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 74 transitions, 770 flow [2022-12-13 01:46:14,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:14,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:14,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:14,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2022-12-13 01:46:14,295 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:14,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash 627089985, now seen corresponding path program 1 times [2022-12-13 01:46:14,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:14,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627279656] [2022-12-13 01:46:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:14,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:14,479 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-13 01:46:14,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:14,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627279656] [2022-12-13 01:46:14,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627279656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:14,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:14,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:46:14,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347909428] [2022-12-13 01:46:14,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:14,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:46:14,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:14,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:46:14,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:46:14,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:46:14,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 74 transitions, 770 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:14,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:14,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:46:14,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:14,735 INFO L130 PetriNetUnfolder]: 619/1303 cut-off events. [2022-12-13 01:46:14,735 INFO L131 PetriNetUnfolder]: For 9274/9274 co-relation queries the response was YES. [2022-12-13 01:46:14,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6522 conditions, 1303 events. 619/1303 cut-off events. For 9274/9274 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7903 event pairs, 203 based on Foata normal form. 2/1305 useless extension candidates. Maximal degree in co-relation 6472. Up to 696 conditions per place. [2022-12-13 01:46:14,742 INFO L137 encePairwiseOnDemand]: 36/46 looper letters, 92 selfloop transitions, 12 changer transitions 18/122 dead transitions. [2022-12-13 01:46:14,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 122 transitions, 1327 flow [2022-12-13 01:46:14,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:46:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:46:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-12-13 01:46:14,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32298136645962733 [2022-12-13 01:46:14,743 INFO L175 Difference]: Start difference. First operand has 101 places, 74 transitions, 770 flow. Second operand 7 states and 104 transitions. [2022-12-13 01:46:14,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 122 transitions, 1327 flow [2022-12-13 01:46:14,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 1278 flow, removed 17 selfloop flow, removed 9 redundant places. [2022-12-13 01:46:14,755 INFO L231 Difference]: Finished difference. Result has 101 places, 75 transitions, 783 flow [2022-12-13 01:46:14,755 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=783, PETRI_PLACES=101, PETRI_TRANSITIONS=75} [2022-12-13 01:46:14,756 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2022-12-13 01:46:14,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:14,756 INFO L89 Accepts]: Start accepts. Operand has 101 places, 75 transitions, 783 flow [2022-12-13 01:46:14,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:14,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:14,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 75 transitions, 783 flow [2022-12-13 01:46:14,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 75 transitions, 783 flow [2022-12-13 01:46:14,776 INFO L130 PetriNetUnfolder]: 42/310 cut-off events. [2022-12-13 01:46:14,776 INFO L131 PetriNetUnfolder]: For 1594/1610 co-relation queries the response was YES. [2022-12-13 01:46:14,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 310 events. 42/310 cut-off events. For 1594/1610 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2269 event pairs, 4 based on Foata normal form. 5/297 useless extension candidates. Maximal degree in co-relation 1283. Up to 47 conditions per place. [2022-12-13 01:46:14,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 75 transitions, 783 flow [2022-12-13 01:46:14,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 434 [2022-12-13 01:46:14,787 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:46:14,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:46:14,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:46:15,098 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:46:15,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:46:15,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:46:15,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] and [683] L171-6-->L153-3: Formula: (and (= v_~f~0.offset_77 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| (ite (and (<= 0 v_~i~0_122) (< v_~i~0_122 v_~n~0_92)) 1 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54| |v_ULTIMATE.start_create_fresh_int_array_~size#1_66|)) (= v_~n2~0_99 0) (= (store |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45| (store (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#t1~0#1.base_45|) |v_ULTIMATE.start_main_~#t1~0#1.offset_45| |v_ULTIMATE.start_main_#t~pre13#1_47|)) |v_#memory_int_130|) (= v_~e1~0_77 0) (= |v_ULTIMATE.start_main_#t~pre13#1_47| |v_#pthreadsForks_59|) (= v_~n1~0_105 0) (not (= (ite (= v_~j~0_100 v_~i~0_122) 1 0) 0)) (= v_~e2~0_87 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_137| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34| v_~f~0.base_77)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ~j~0=v_~j~0_100, #pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, #memory_int=|v_#memory_int_131|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ~n~0=v_~n~0_92, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_43|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_47|, ~j~0=v_~j~0_100, ~n2~0=v_~n2~0_99, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_43|, ~i~0=v_~i~0_122, ~n1~0=v_~n1~0_105, ~f~0.base=v_~f~0.base_77, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_54|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_45|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_34|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_45|, ~e2~0=v_~e2~0_87, ~f~0.offset=v_~f~0.offset_77, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_66|, ~e1~0=v_~e1~0_77, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_34|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_137|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_45|, #memory_int=|v_#memory_int_130|, ~n~0=v_~n~0_92, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_105|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~e2~0, ~f~0.offset, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:46:15,615 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [741] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| (ite (or (= v_~n2~0_287 0) (<= v_~n1~0_315 v_~n2~0_287)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142|) (not (= (ite (= 0 (mod v_~e2~0_231 256)) 1 0) 0)) (= v_~i1~0_229 v_~i~0_496) (= (select (select |v_#memory_int_369| v_~f~0.base_292) (+ v_~f~0.offset_299 (* v_~i1~0_229 4))) v_~i~0_495)) InVars {~n2~0=v_~n2~0_287, ~i~0=v_~i~0_496, ~f~0.base=v_~f~0.base_292, ~n1~0=v_~n1~0_315, #memory_int=|v_#memory_int_369|, ~f~0.offset=v_~f~0.offset_299, ~e2~0=v_~e2~0_231} OutVars{~n2~0=v_~n2~0_287, ~i~0=v_~i~0_495, ~f~0.base=v_~f~0.base_292, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_142|, ~n1~0=v_~n1~0_315, #memory_int=|v_#memory_int_369|, ~i1~0=v_~i1~0_229, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_146|, ~f~0.offset=v_~f~0.offset_299, ~e2~0=v_~e2~0_231, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_142|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [908] L154-4-->L153-3: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_185| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_80| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_245|) (= v_~e1~0_749 0) (not (= (ite (= v_~j~0_608 v_~i~0_1899) 1 0) 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_151| (ite (and (< v_~i~0_1899 v_~n~0_642) (<= 0 v_~i~0_1899)) 1 0)) (= |v_ULTIMATE.start_main_#t~pre17#1_122| |v_#pthreadsForks_274|) (= v_~n1~0_1056 0) (= v_~e2~0_960 0) (= |v_#memory_int_1151| (let ((.cse0 (store |v_#memory_int_1153| |v_ULTIMATE.start_main_~#t3~0#1.base_230| (store (select |v_#memory_int_1153| |v_ULTIMATE.start_main_~#t3~0#1.base_230|) |v_ULTIMATE.start_main_~#t3~0#1.offset_118| |v_ULTIMATE.start_main_#t~pre17#1_122|)))) (store .cse0 |v_ULTIMATE.start_main_~#t1~0#1.base_101| (store (select .cse0 |v_ULTIMATE.start_main_~#t1~0#1.base_101|) |v_ULTIMATE.start_main_~#t1~0#1.offset_89| |v_ULTIMATE.start_main_#t~pre13#1_121|)))) (= (+ |v_#pthreadsForks_274| 1) |v_ULTIMATE.start_main_#t~pre13#1_121|) (= v_~f~0.base_1019 |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_80|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~1#1_262| |v_ULTIMATE.start_create_fresh_int_array_~size#1_266|)) (= (+ 2 |v_#pthreadsForks_274|) |v_#pthreadsForks_272|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_151| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_185|) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_80| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_201|) (= v_~n2~0_1170 0) (= v_~f~0.offset_1027 |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_80|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_245|, ~j~0=v_~j~0_608, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_201|, ~i~0=v_~i~0_1899, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_118|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_230|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_262|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_101|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_89|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_266|, #pthreadsForks=|v_#pthreadsForks_274|, #memory_int=|v_#memory_int_1153|, ~n~0=v_~n~0_642} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_245|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_121|, ~j~0=v_~j~0_608, ~n1~0=v_~n1~0_1056, ~f~0.base=v_~f~0.base_1019, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_118|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_230|, ULTIMATE.start_create_fresh_int_array_~i~1#1=|v_ULTIMATE.start_create_fresh_int_array_~i~1#1_262|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_80|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_89|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_122|, ~f~0.offset=v_~f~0.offset_1027, ~e1~0=v_~e1~0_749, #pthreadsForks=|v_#pthreadsForks_272|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_185|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_91|, ~n2~0=v_~n2~0_1170, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_201|, ~i~0=v_~i~0_1899, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_148|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_101|, ~e2~0=v_~e2~0_960, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_266|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_80|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_112|, #memory_int=|v_#memory_int_1151|, ~n~0=v_~n~0_642, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_151|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_91|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~n2~0, ~n1~0, ~f~0.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_#t~pre17#1, ~f~0.offset, ~e2~0, ~e1~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ret12#1.offset, #memory_int, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret12#1.base] [2022-12-13 01:46:15,827 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:46:15,828 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1072 [2022-12-13 01:46:15,828 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 925 flow [2022-12-13 01:46:15,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:15,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:15,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:15,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2022-12-13 01:46:15,828 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:15,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash 724993343, now seen corresponding path program 2 times [2022-12-13 01:46:15,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:15,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993823248] [2022-12-13 01:46:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:15,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:16,469 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-13 01:46:16,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:16,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993823248] [2022-12-13 01:46:16,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993823248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:16,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:16,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:46:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707881377] [2022-12-13 01:46:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:16,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:46:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:16,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:46:16,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:46:16,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:46:16,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 925 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:16,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:16,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:46:16,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:16,919 INFO L130 PetriNetUnfolder]: 1181/2487 cut-off events. [2022-12-13 01:46:16,919 INFO L131 PetriNetUnfolder]: For 17969/17969 co-relation queries the response was YES. [2022-12-13 01:46:16,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12686 conditions, 2487 events. 1181/2487 cut-off events. For 17969/17969 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 17429 event pairs, 447 based on Foata normal form. 2/2489 useless extension candidates. Maximal degree in co-relation 12627. Up to 1148 conditions per place. [2022-12-13 01:46:16,931 INFO L137 encePairwiseOnDemand]: 37/53 looper letters, 165 selfloop transitions, 23 changer transitions 21/209 dead transitions. [2022-12-13 01:46:16,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 209 transitions, 2379 flow [2022-12-13 01:46:16,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:46:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:46:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2022-12-13 01:46:16,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34591194968553457 [2022-12-13 01:46:16,932 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 925 flow. Second operand 9 states and 165 transitions. [2022-12-13 01:46:16,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 209 transitions, 2379 flow [2022-12-13 01:46:16,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 209 transitions, 2309 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-13 01:46:16,956 INFO L231 Difference]: Finished difference. Result has 107 places, 92 transitions, 1070 flow [2022-12-13 01:46:16,956 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1070, PETRI_PLACES=107, PETRI_TRANSITIONS=92} [2022-12-13 01:46:16,957 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:46:16,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:16,957 INFO L89 Accepts]: Start accepts. Operand has 107 places, 92 transitions, 1070 flow [2022-12-13 01:46:16,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:16,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:16,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 92 transitions, 1070 flow [2022-12-13 01:46:16,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 92 transitions, 1070 flow [2022-12-13 01:46:16,998 INFO L130 PetriNetUnfolder]: 79/605 cut-off events. [2022-12-13 01:46:16,998 INFO L131 PetriNetUnfolder]: For 3513/3565 co-relation queries the response was YES. [2022-12-13 01:46:17,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2656 conditions, 605 events. 79/605 cut-off events. For 3513/3565 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5491 event pairs, 6 based on Foata normal form. 11/583 useless extension candidates. Maximal degree in co-relation 2604. Up to 77 conditions per place. [2022-12-13 01:46:17,003 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 92 transitions, 1070 flow [2022-12-13 01:46:17,003 INFO L226 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-13 01:46:17,006 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:17,006 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-13 01:46:17,006 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 92 transitions, 1070 flow [2022-12-13 01:46:17,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:17,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:17,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:17,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2022-12-13 01:46:17,006 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:17,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2055893973, now seen corresponding path program 3 times [2022-12-13 01:46:17,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:17,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615532887] [2022-12-13 01:46:17,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:17,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:17,851 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-13 01:46:17,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:17,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615532887] [2022-12-13 01:46:17,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615532887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:17,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:17,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:46:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235894118] [2022-12-13 01:46:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:17,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:46:17,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:46:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:46:17,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:46:17,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 92 transitions, 1070 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:17,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:17,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:46:17,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:18,362 INFO L130 PetriNetUnfolder]: 1159/2453 cut-off events. [2022-12-13 01:46:18,362 INFO L131 PetriNetUnfolder]: For 18895/18895 co-relation queries the response was YES. [2022-12-13 01:46:18,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12783 conditions, 2453 events. 1159/2453 cut-off events. For 18895/18895 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17286 event pairs, 414 based on Foata normal form. 2/2455 useless extension candidates. Maximal degree in co-relation 12722. Up to 1148 conditions per place. [2022-12-13 01:46:18,371 INFO L137 encePairwiseOnDemand]: 27/46 looper letters, 160 selfloop transitions, 22 changer transitions 31/213 dead transitions. [2022-12-13 01:46:18,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 213 transitions, 2431 flow [2022-12-13 01:46:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:46:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:46:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2022-12-13 01:46:18,372 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3717391304347826 [2022-12-13 01:46:18,372 INFO L175 Difference]: Start difference. First operand has 105 places, 92 transitions, 1070 flow. Second operand 10 states and 171 transitions. [2022-12-13 01:46:18,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 213 transitions, 2431 flow [2022-12-13 01:46:18,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 213 transitions, 2395 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-13 01:46:18,393 INFO L231 Difference]: Finished difference. Result has 116 places, 91 transitions, 1085 flow [2022-12-13 01:46:18,393 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1085, PETRI_PLACES=116, PETRI_TRANSITIONS=91} [2022-12-13 01:46:18,393 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2022-12-13 01:46:18,393 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:18,393 INFO L89 Accepts]: Start accepts. Operand has 116 places, 91 transitions, 1085 flow [2022-12-13 01:46:18,394 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:18,394 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:18,394 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 91 transitions, 1085 flow [2022-12-13 01:46:18,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 91 transitions, 1085 flow [2022-12-13 01:46:18,430 INFO L130 PetriNetUnfolder]: 74/569 cut-off events. [2022-12-13 01:46:18,430 INFO L131 PetriNetUnfolder]: For 3504/3557 co-relation queries the response was YES. [2022-12-13 01:46:18,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 569 events. 74/569 cut-off events. For 3504/3557 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5003 event pairs, 4 based on Foata normal form. 9/552 useless extension candidates. Maximal degree in co-relation 2467. Up to 77 conditions per place. [2022-12-13 01:46:18,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 91 transitions, 1085 flow [2022-12-13 01:46:18,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 518 [2022-12-13 01:46:18,500 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (not (= (ite (= (mod v_~e2~0_229 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (or (<= v_~n1~0_313 v_~n2~0_285) (= v_~n2~0_285 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= v_~i~0_491 (select (select |v_#memory_int_367| v_~f~0.base_290) (+ v_~f~0.offset_297 (* v_~i1~0_227 4)))) (= v_~i1~0_227 v_~i~0_492)) InVars {~n2~0=v_~n2~0_285, ~i~0=v_~i~0_492, ~f~0.base=v_~f~0.base_290, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229} OutVars{~n2~0=v_~n2~0_285, ~i~0=v_~i~0_491, ~f~0.base=v_~f~0.base_290, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~i1~0=v_~i1~0_227, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_144|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 01:46:18,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [722] $Ultimate##0-->L88: Formula: (and (= v_~e1~0_158 1) (= v_~e2~0_189 1) (= v_~n2~0_240 v_~tmp1~0_143) (= v_~tmp2~0_144 v_~n1~0_262)) InVars {~n2~0=v_~n2~0_240, ~n1~0=v_~n1~0_262} OutVars{~n2~0=v_~n2~0_240, ~n1~0=v_~n1~0_262, ~tmp2~0=v_~tmp2~0_144, ~e2~0=v_~e2~0_189, ~tmp1~0=v_~tmp1~0_143, ~e1~0=v_~e1~0_158} AuxVars[] AssignedVars[~tmp2~0, ~e2~0, ~tmp1~0, ~e1~0] and [710] L53-->L97: Formula: (and (= v_~e2~0_167 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|) (= (+ v_~tmp1~0_123 1) v_~n1~0_225) (= v_~e1~0_133 0) (= (+ v_~tmp2~0_121 1) v_~n2~0_206) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| (ite (= (mod v_~e1~0_133 256) 0) 1 0))) InVars {~tmp2~0=v_~tmp2~0_121, ~tmp1~0=v_~tmp1~0_123} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|, ~n2~0=v_~n2~0_206, ~n1~0=v_~n1~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77|, ~tmp2~0=v_~tmp2~0_121, ~e2~0=v_~e2~0_167, ~tmp1~0=v_~tmp1~0_123, ~e1~0=v_~e1~0_133} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0, ~e1~0] [2022-12-13 01:46:18,593 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:46:18,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-13 01:46:18,594 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 91 transitions, 1123 flow [2022-12-13 01:46:18,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:18,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:18,594 INFO L214 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] [2022-12-13 01:46:18,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2022-12-13 01:46:18,594 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:18,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:18,594 INFO L85 PathProgramCache]: Analyzing trace with hash 485948952, now seen corresponding path program 1 times [2022-12-13 01:46:18,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:18,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717626347] [2022-12-13 01:46:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:18,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:46:19,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:19,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717626347] [2022-12-13 01:46:19,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717626347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:46:19,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172713267] [2022-12-13 01:46:19,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:19,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:46:19,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:46:19,268 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:46:19,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 01:46:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:19,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 01:46:19,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:46:19,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:46:19,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 01:46:19,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:46:19,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:46:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:46:19,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:46:19,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172713267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:19,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:46:19,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-13 01:46:19,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904672082] [2022-12-13 01:46:19,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:19,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:46:19,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:19,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:46:19,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-13 01:46:19,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:46:19,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 91 transitions, 1123 flow. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:19,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:19,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:46:19,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:20,077 INFO L130 PetriNetUnfolder]: 1075/2279 cut-off events. [2022-12-13 01:46:20,077 INFO L131 PetriNetUnfolder]: For 20585/20585 co-relation queries the response was YES. [2022-12-13 01:46:20,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12214 conditions, 2279 events. 1075/2279 cut-off events. For 20585/20585 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15568 event pairs, 425 based on Foata normal form. 2/2281 useless extension candidates. Maximal degree in co-relation 12150. Up to 1350 conditions per place. [2022-12-13 01:46:20,088 INFO L137 encePairwiseOnDemand]: 38/49 looper letters, 96 selfloop transitions, 20 changer transitions 19/135 dead transitions. [2022-12-13 01:46:20,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 135 transitions, 1717 flow [2022-12-13 01:46:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:46:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:46:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-12-13 01:46:20,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30029154518950435 [2022-12-13 01:46:20,089 INFO L175 Difference]: Start difference. First operand has 114 places, 91 transitions, 1123 flow. Second operand 7 states and 103 transitions. [2022-12-13 01:46:20,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 135 transitions, 1717 flow [2022-12-13 01:46:20,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 135 transitions, 1653 flow, removed 13 selfloop flow, removed 8 redundant places. [2022-12-13 01:46:20,112 INFO L231 Difference]: Finished difference. Result has 114 places, 89 transitions, 1082 flow [2022-12-13 01:46:20,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1082, PETRI_PLACES=114, PETRI_TRANSITIONS=89} [2022-12-13 01:46:20,113 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places. [2022-12-13 01:46:20,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:20,113 INFO L89 Accepts]: Start accepts. Operand has 114 places, 89 transitions, 1082 flow [2022-12-13 01:46:20,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:20,114 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:20,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 89 transitions, 1082 flow [2022-12-13 01:46:20,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 89 transitions, 1082 flow [2022-12-13 01:46:20,150 INFO L130 PetriNetUnfolder]: 70/566 cut-off events. [2022-12-13 01:46:20,150 INFO L131 PetriNetUnfolder]: For 4022/4077 co-relation queries the response was YES. [2022-12-13 01:46:20,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 566 events. 70/566 cut-off events. For 4022/4077 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4933 event pairs, 6 based on Foata normal form. 13/555 useless extension candidates. Maximal degree in co-relation 2524. Up to 84 conditions per place. [2022-12-13 01:46:20,154 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 89 transitions, 1082 flow [2022-12-13 01:46:20,154 INFO L226 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-13 01:46:20,157 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:20,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 01:46:20,157 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 89 transitions, 1082 flow [2022-12-13 01:46:20,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:20,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:20,158 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:20,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 01:46:20,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2022-12-13 01:46:20,359 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:20,359 INFO L85 PathProgramCache]: Analyzing trace with hash 551259040, now seen corresponding path program 1 times [2022-12-13 01:46:20,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:20,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374897205] [2022-12-13 01:46:20,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:20,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:21,057 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-13 01:46:21,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:21,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374897205] [2022-12-13 01:46:21,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374897205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:21,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:21,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:46:21,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494537117] [2022-12-13 01:46:21,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:21,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:46:21,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:21,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:46:21,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:46:21,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:46:21,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 89 transitions, 1082 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:21,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:21,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:46:21,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:21,575 INFO L130 PetriNetUnfolder]: 1065/2274 cut-off events. [2022-12-13 01:46:21,575 INFO L131 PetriNetUnfolder]: For 20201/20201 co-relation queries the response was YES. [2022-12-13 01:46:21,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12116 conditions, 2274 events. 1065/2274 cut-off events. For 20201/20201 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15643 event pairs, 430 based on Foata normal form. 3/2277 useless extension candidates. Maximal degree in co-relation 12052. Up to 1100 conditions per place. [2022-12-13 01:46:21,592 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 132 selfloop transitions, 14 changer transitions 48/194 dead transitions. [2022-12-13 01:46:21,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 194 transitions, 2279 flow [2022-12-13 01:46:21,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:46:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:46:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2022-12-13 01:46:21,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36054421768707484 [2022-12-13 01:46:21,593 INFO L175 Difference]: Start difference. First operand has 112 places, 89 transitions, 1082 flow. Second operand 9 states and 159 transitions. [2022-12-13 01:46:21,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 194 transitions, 2279 flow [2022-12-13 01:46:21,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 194 transitions, 2181 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-12-13 01:46:21,630 INFO L231 Difference]: Finished difference. Result has 115 places, 84 transitions, 966 flow [2022-12-13 01:46:21,630 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=966, PETRI_PLACES=115, PETRI_TRANSITIONS=84} [2022-12-13 01:46:21,630 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2022-12-13 01:46:21,630 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:21,631 INFO L89 Accepts]: Start accepts. Operand has 115 places, 84 transitions, 966 flow [2022-12-13 01:46:21,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:21,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:21,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 84 transitions, 966 flow [2022-12-13 01:46:21,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 84 transitions, 966 flow [2022-12-13 01:46:21,674 INFO L130 PetriNetUnfolder]: 55/481 cut-off events. [2022-12-13 01:46:21,674 INFO L131 PetriNetUnfolder]: For 2901/2944 co-relation queries the response was YES. [2022-12-13 01:46:21,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 481 events. 55/481 cut-off events. For 2901/2944 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4023 event pairs, 8 based on Foata normal form. 9/468 useless extension candidates. Maximal degree in co-relation 1969. Up to 76 conditions per place. [2022-12-13 01:46:21,679 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 84 transitions, 966 flow [2022-12-13 01:46:21,679 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 01:46:21,684 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:21,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 01:46:21,685 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 84 transitions, 966 flow [2022-12-13 01:46:21,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:21,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:21,685 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:21,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2022-12-13 01:46:21,685 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:21,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:21,686 INFO L85 PathProgramCache]: Analyzing trace with hash -945446073, now seen corresponding path program 1 times [2022-12-13 01:46:21,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:21,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642177828] [2022-12-13 01:46:21,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:21,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:23,082 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-13 01:46:23,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:23,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642177828] [2022-12-13 01:46:23,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642177828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:23,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:23,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:46:23,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284422247] [2022-12-13 01:46:23,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:23,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:46:23,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:23,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:46:23,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:46:23,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:46:23,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 84 transitions, 966 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:23,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:23,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:46:23,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:23,635 INFO L130 PetriNetUnfolder]: 885/1933 cut-off events. [2022-12-13 01:46:23,635 INFO L131 PetriNetUnfolder]: For 15820/15820 co-relation queries the response was YES. [2022-12-13 01:46:23,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9869 conditions, 1933 events. 885/1933 cut-off events. For 15820/15820 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13067 event pairs, 309 based on Foata normal form. 2/1935 useless extension candidates. Maximal degree in co-relation 9799. Up to 1368 conditions per place. [2022-12-13 01:46:23,644 INFO L137 encePairwiseOnDemand]: 33/49 looper letters, 136 selfloop transitions, 24 changer transitions 12/172 dead transitions. [2022-12-13 01:46:23,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 172 transitions, 1889 flow [2022-12-13 01:46:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:46:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:46:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-12-13 01:46:23,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-13 01:46:23,645 INFO L175 Difference]: Start difference. First operand has 111 places, 84 transitions, 966 flow. Second operand 11 states and 147 transitions. [2022-12-13 01:46:23,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 172 transitions, 1889 flow [2022-12-13 01:46:23,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 172 transitions, 1837 flow, removed 11 selfloop flow, removed 9 redundant places. [2022-12-13 01:46:23,665 INFO L231 Difference]: Finished difference. Result has 119 places, 95 transitions, 1152 flow [2022-12-13 01:46:23,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1152, PETRI_PLACES=119, PETRI_TRANSITIONS=95} [2022-12-13 01:46:23,665 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 01:46:23,665 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:23,666 INFO L89 Accepts]: Start accepts. Operand has 119 places, 95 transitions, 1152 flow [2022-12-13 01:46:23,666 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:23,666 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:23,666 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 95 transitions, 1152 flow [2022-12-13 01:46:23,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 95 transitions, 1152 flow [2022-12-13 01:46:23,699 INFO L130 PetriNetUnfolder]: 51/484 cut-off events. [2022-12-13 01:46:23,699 INFO L131 PetriNetUnfolder]: For 3105/3150 co-relation queries the response was YES. [2022-12-13 01:46:23,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 484 events. 51/484 cut-off events. For 3105/3150 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4110 event pairs, 3 based on Foata normal form. 9/472 useless extension candidates. Maximal degree in co-relation 2027. Up to 76 conditions per place. [2022-12-13 01:46:23,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 95 transitions, 1152 flow [2022-12-13 01:46:23,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 546 [2022-12-13 01:46:23,827 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [913] L59-->L154-3: Formula: (and (= (+ |v_#pthreadsForks_291| 1) |v_#pthreadsForks_290|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_629| (ite (or (= v_~n2~0_1186 0) (<= v_~n1~0_1071 v_~n2~0_1186)) 1 0)) (= v_~i1~0_688 v_~i~0_1921) (= |v_#memory_int_1174| (store |v_#memory_int_1175| |v_ULTIMATE.start_main_~#t2~0#1.base_159| (store (select |v_#memory_int_1175| |v_ULTIMATE.start_main_~#t2~0#1.base_159|) |v_ULTIMATE.start_main_~#t2~0#1.offset_89| |v_ULTIMATE.start_main_#t~pre15#1_152|))) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_629| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_629|) (not (= (ite (= (mod v_~e2~0_976 256) 0) 1 0) 0)) (= |v_#pthreadsForks_291| |v_ULTIMATE.start_main_#t~pre15#1_152|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_629| 0)) (= (select (select |v_#memory_int_1175| v_~f~0.base_1039) (+ (* v_~i1~0_688 4) v_~f~0.offset_1047)) v_~i~0_1920)) InVars {#pthreadsForks=|v_#pthreadsForks_291|, ~n2~0=v_~n2~0_1186, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_89|, ~i~0=v_~i~0_1921, ~f~0.base=v_~f~0.base_1039, ~n1~0=v_~n1~0_1071, #memory_int=|v_#memory_int_1175|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_159|, ~f~0.offset=v_~f~0.offset_1047, ~e2~0=v_~e2~0_976} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_129|, ~n2~0=v_~n2~0_1186, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_89|, ~i~0=v_~i~0_1920, ~f~0.base=v_~f~0.base_1039, ~n1~0=v_~n1~0_1071, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_152|, ~i1~0=v_~i1~0_688, ~f~0.offset=v_~f~0.offset_1047, ~e2~0=v_~e2~0_976, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_81|, #pthreadsForks=|v_#pthreadsForks_290|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_629|, #memory_int=|v_#memory_int_1174|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_589|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_159|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_629|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre15#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, ULTIMATE.start_main_#t~nondet14#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [506] L71-->L74: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= (ite (and (<= 0 v_~i~0_32) (< v_~i~0_32 v_~n~0_22)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~n~0=v_~n~0_22, ~i~0=v_~i~0_32} OutVars{~n~0=v_~n~0_22, ~i~0=v_~i~0_32, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:46:23,925 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:46:23,926 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-13 01:46:23,926 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 94 transitions, 1188 flow [2022-12-13 01:46:23,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:23,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:23,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:23,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2022-12-13 01:46:23,926 INFO L420 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash -748992126, now seen corresponding path program 1 times [2022-12-13 01:46:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:23,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107114707] [2022-12-13 01:46:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:24,758 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-13 01:46:24,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:24,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107114707] [2022-12-13 01:46:24,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107114707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:24,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:24,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:46:24,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512926087] [2022-12-13 01:46:24,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:24,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:46:24,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:24,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:46:24,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:46:24,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:46:24,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 94 transitions, 1188 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:46:24,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:24,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:46:24,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:25,162 INFO L130 PetriNetUnfolder]: 849/1853 cut-off events. [2022-12-13 01:46:25,162 INFO L131 PetriNetUnfolder]: For 17341/17341 co-relation queries the response was YES. [2022-12-13 01:46:25,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9819 conditions, 1853 events. 849/1853 cut-off events. For 17341/17341 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12477 event pairs, 341 based on Foata normal form. 2/1855 useless extension candidates. Maximal degree in co-relation 9752. Up to 1100 conditions per place. [2022-12-13 01:46:25,171 INFO L137 encePairwiseOnDemand]: 39/53 looper letters, 146 selfloop transitions, 19 changer transitions 17/182 dead transitions. [2022-12-13 01:46:25,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 182 transitions, 2174 flow [2022-12-13 01:46:25,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:46:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:46:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2022-12-13 01:46:25,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35377358490566035 [2022-12-13 01:46:25,172 INFO L175 Difference]: Start difference. First operand has 117 places, 94 transitions, 1188 flow. Second operand 8 states and 150 transitions. [2022-12-13 01:46:25,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 182 transitions, 2174 flow [2022-12-13 01:46:25,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 182 transitions, 2084 flow, removed 34 selfloop flow, removed 6 redundant places. [2022-12-13 01:46:25,200 INFO L231 Difference]: Finished difference. Result has 119 places, 93 transitions, 1136 flow [2022-12-13 01:46:25,200 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1136, PETRI_PLACES=119, PETRI_TRANSITIONS=93} [2022-12-13 01:46:25,200 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 01:46:25,201 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:25,201 INFO L89 Accepts]: Start accepts. Operand has 119 places, 93 transitions, 1136 flow [2022-12-13 01:46:25,201 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:25,201 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:25,201 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 93 transitions, 1136 flow [2022-12-13 01:46:25,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 93 transitions, 1136 flow [2022-12-13 01:46:25,232 INFO L130 PetriNetUnfolder]: 52/473 cut-off events. [2022-12-13 01:46:25,232 INFO L131 PetriNetUnfolder]: For 3185/3232 co-relation queries the response was YES. [2022-12-13 01:46:25,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2086 conditions, 473 events. 52/473 cut-off events. For 3185/3232 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3976 event pairs, 3 based on Foata normal form. 9/460 useless extension candidates. Maximal degree in co-relation 2029. Up to 72 conditions per place. [2022-12-13 01:46:25,235 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 93 transitions, 1136 flow [2022-12-13 01:46:25,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-13 01:46:25,238 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:25,239 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 01:46:25,239 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 93 transitions, 1136 flow [2022-12-13 01:46:25,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:46:25,239 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:25,239 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:25,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2022-12-13 01:46:25,239 INFO L420 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash -636157034, now seen corresponding path program 2 times [2022-12-13 01:46:25,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:25,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534259487] [2022-12-13 01:46:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:25,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:25,910 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-13 01:46:25,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:25,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534259487] [2022-12-13 01:46:25,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534259487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:25,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:25,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:46:25,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897917995] [2022-12-13 01:46:25,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:25,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:46:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:25,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:46:25,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:46:25,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:46:25,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 93 transitions, 1136 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:46:25,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:25,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:46:25,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:26,401 INFO L130 PetriNetUnfolder]: 829/1833 cut-off events. [2022-12-13 01:46:26,401 INFO L131 PetriNetUnfolder]: For 16081/16081 co-relation queries the response was YES. [2022-12-13 01:46:26,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9566 conditions, 1833 events. 829/1833 cut-off events. For 16081/16081 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12464 event pairs, 335 based on Foata normal form. 2/1835 useless extension candidates. Maximal degree in co-relation 9500. Up to 1100 conditions per place. [2022-12-13 01:46:26,411 INFO L137 encePairwiseOnDemand]: 40/53 looper letters, 137 selfloop transitions, 16 changer transitions 25/178 dead transitions. [2022-12-13 01:46:26,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 178 transitions, 2094 flow [2022-12-13 01:46:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:46:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:46:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2022-12-13 01:46:26,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3443396226415094 [2022-12-13 01:46:26,412 INFO L175 Difference]: Start difference. First operand has 117 places, 93 transitions, 1136 flow. Second operand 8 states and 146 transitions. [2022-12-13 01:46:26,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 178 transitions, 2094 flow [2022-12-13 01:46:26,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 178 transitions, 2052 flow, removed 2 selfloop flow, removed 7 redundant places. [2022-12-13 01:46:26,441 INFO L231 Difference]: Finished difference. Result has 119 places, 89 transitions, 1051 flow [2022-12-13 01:46:26,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1051, PETRI_PLACES=119, PETRI_TRANSITIONS=89} [2022-12-13 01:46:26,442 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 01:46:26,442 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:26,442 INFO L89 Accepts]: Start accepts. Operand has 119 places, 89 transitions, 1051 flow [2022-12-13 01:46:26,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:26,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:26,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 89 transitions, 1051 flow [2022-12-13 01:46:26,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 89 transitions, 1051 flow [2022-12-13 01:46:26,473 INFO L130 PetriNetUnfolder]: 48/444 cut-off events. [2022-12-13 01:46:26,473 INFO L131 PetriNetUnfolder]: For 2832/2866 co-relation queries the response was YES. [2022-12-13 01:46:26,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 444 events. 48/444 cut-off events. For 2832/2866 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3662 event pairs, 3 based on Foata normal form. 8/433 useless extension candidates. Maximal degree in co-relation 1893. Up to 64 conditions per place. [2022-12-13 01:46:26,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 89 transitions, 1051 flow [2022-12-13 01:46:26,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 01:46:26,480 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:26,481 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39 [2022-12-13 01:46:26,481 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 89 transitions, 1051 flow [2022-12-13 01:46:26,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:46:26,481 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:26,481 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:26,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2022-12-13 01:46:26,481 INFO L420 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:26,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:26,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1347892812, now seen corresponding path program 1 times [2022-12-13 01:46:26,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:26,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901518951] [2022-12-13 01:46:26,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:26,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:27,300 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-13 01:46:27,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:27,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901518951] [2022-12-13 01:46:27,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901518951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:27,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:27,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:46:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018538834] [2022-12-13 01:46:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:27,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:46:27,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:27,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:46:27,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:46:27,302 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:46:27,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 89 transitions, 1051 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:27,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:27,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:46:27,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:27,780 INFO L130 PetriNetUnfolder]: 805/1789 cut-off events. [2022-12-13 01:46:27,780 INFO L131 PetriNetUnfolder]: For 14695/14695 co-relation queries the response was YES. [2022-12-13 01:46:27,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9206 conditions, 1789 events. 805/1789 cut-off events. For 14695/14695 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11953 event pairs, 333 based on Foata normal form. 2/1791 useless extension candidates. Maximal degree in co-relation 9139. Up to 1100 conditions per place. [2022-12-13 01:46:27,790 INFO L137 encePairwiseOnDemand]: 36/50 looper letters, 127 selfloop transitions, 11 changer transitions 43/181 dead transitions. [2022-12-13 01:46:27,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 181 transitions, 2086 flow [2022-12-13 01:46:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:46:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:46:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2022-12-13 01:46:27,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3288888888888889 [2022-12-13 01:46:27,791 INFO L175 Difference]: Start difference. First operand has 116 places, 89 transitions, 1051 flow. Second operand 9 states and 148 transitions. [2022-12-13 01:46:27,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 181 transitions, 2086 flow [2022-12-13 01:46:27,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 181 transitions, 2042 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 01:46:27,817 INFO L231 Difference]: Finished difference. Result has 119 places, 83 transitions, 929 flow [2022-12-13 01:46:27,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=929, PETRI_PLACES=119, PETRI_TRANSITIONS=83} [2022-12-13 01:46:27,817 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 01:46:27,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:27,817 INFO L89 Accepts]: Start accepts. Operand has 119 places, 83 transitions, 929 flow [2022-12-13 01:46:27,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:27,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:27,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 83 transitions, 929 flow [2022-12-13 01:46:27,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 83 transitions, 929 flow [2022-12-13 01:46:27,845 INFO L130 PetriNetUnfolder]: 45/397 cut-off events. [2022-12-13 01:46:27,845 INFO L131 PetriNetUnfolder]: For 2316/2348 co-relation queries the response was YES. [2022-12-13 01:46:27,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 397 events. 45/397 cut-off events. For 2316/2348 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3153 event pairs, 3 based on Foata normal form. 8/392 useless extension candidates. Maximal degree in co-relation 1683. Up to 51 conditions per place. [2022-12-13 01:46:27,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 83 transitions, 929 flow [2022-12-13 01:46:27,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-13 01:46:27,849 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:27,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 01:46:27,849 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 83 transitions, 929 flow [2022-12-13 01:46:27,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:27,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:27,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:27,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2022-12-13 01:46:27,850 INFO L420 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:27,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:27,850 INFO L85 PathProgramCache]: Analyzing trace with hash -673577013, now seen corresponding path program 1 times [2022-12-13 01:46:27,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:27,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153363887] [2022-12-13 01:46:27,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:28,560 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-13 01:46:28,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:28,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153363887] [2022-12-13 01:46:28,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153363887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:28,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:28,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:46:28,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632973349] [2022-12-13 01:46:28,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:28,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:46:28,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:28,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:46:28,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:46:28,561 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:46:28,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 83 transitions, 929 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:28,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:28,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:46:28,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:28,954 INFO L130 PetriNetUnfolder]: 683/1492 cut-off events. [2022-12-13 01:46:28,954 INFO L131 PetriNetUnfolder]: For 11359/11359 co-relation queries the response was YES. [2022-12-13 01:46:28,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7746 conditions, 1492 events. 683/1492 cut-off events. For 11359/11359 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9432 event pairs, 278 based on Foata normal form. 3/1495 useless extension candidates. Maximal degree in co-relation 7685. Up to 1100 conditions per place. [2022-12-13 01:46:28,961 INFO L137 encePairwiseOnDemand]: 32/47 looper letters, 102 selfloop transitions, 11 changer transitions 45/158 dead transitions. [2022-12-13 01:46:28,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 158 transitions, 1769 flow [2022-12-13 01:46:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:46:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:46:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-12-13 01:46:28,962 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28297872340425534 [2022-12-13 01:46:28,962 INFO L175 Difference]: Start difference. First operand has 112 places, 83 transitions, 929 flow. Second operand 10 states and 133 transitions. [2022-12-13 01:46:28,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 158 transitions, 1769 flow [2022-12-13 01:46:28,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 158 transitions, 1689 flow, removed 29 selfloop flow, removed 10 redundant places. [2022-12-13 01:46:28,984 INFO L231 Difference]: Finished difference. Result has 115 places, 78 transitions, 840 flow [2022-12-13 01:46:28,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=840, PETRI_PLACES=115, PETRI_TRANSITIONS=78} [2022-12-13 01:46:28,984 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2022-12-13 01:46:28,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:28,984 INFO L89 Accepts]: Start accepts. Operand has 115 places, 78 transitions, 840 flow [2022-12-13 01:46:28,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:28,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:28,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 78 transitions, 840 flow [2022-12-13 01:46:28,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 78 transitions, 840 flow [2022-12-13 01:46:29,008 INFO L130 PetriNetUnfolder]: 41/340 cut-off events. [2022-12-13 01:46:29,008 INFO L131 PetriNetUnfolder]: For 1763/1786 co-relation queries the response was YES. [2022-12-13 01:46:29,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 340 events. 41/340 cut-off events. For 1763/1786 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2494 event pairs, 3 based on Foata normal form. 7/335 useless extension candidates. Maximal degree in co-relation 1425. Up to 45 conditions per place. [2022-12-13 01:46:29,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 78 transitions, 840 flow [2022-12-13 01:46:29,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-13 01:46:29,014 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:29,015 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 01:46:29,015 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 78 transitions, 840 flow [2022-12-13 01:46:29,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:29,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:29,015 INFO L214 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] [2022-12-13 01:46:29,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2022-12-13 01:46:29,015 INFO L420 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:29,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:29,016 INFO L85 PathProgramCache]: Analyzing trace with hash 346190776, now seen corresponding path program 2 times [2022-12-13 01:46:29,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:29,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996759382] [2022-12-13 01:46:29,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:29,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:46:29,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:29,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996759382] [2022-12-13 01:46:29,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996759382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:46:29,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744075229] [2022-12-13 01:46:29,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:46:29,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:46:29,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:46:29,693 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:46:29,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 01:46:29,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 01:46:29,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:46:29,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 01:46:29,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:46:30,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:46:30,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-12-13 01:46:30,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:46:30,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:46:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:46:30,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:46:30,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744075229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:30,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:46:30,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-13 01:46:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406930668] [2022-12-13 01:46:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:30,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:46:30,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:30,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:46:30,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-12-13 01:46:30,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:46:30,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 78 transitions, 840 flow. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:30,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:30,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:46:30,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:30,404 INFO L130 PetriNetUnfolder]: 599/1313 cut-off events. [2022-12-13 01:46:30,404 INFO L131 PetriNetUnfolder]: For 9267/9267 co-relation queries the response was YES. [2022-12-13 01:46:30,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6752 conditions, 1313 events. 599/1313 cut-off events. For 9267/9267 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8043 event pairs, 205 based on Foata normal form. 2/1315 useless extension candidates. Maximal degree in co-relation 6693. Up to 703 conditions per place. [2022-12-13 01:46:30,411 INFO L137 encePairwiseOnDemand]: 37/46 looper letters, 84 selfloop transitions, 11 changer transitions 27/122 dead transitions. [2022-12-13 01:46:30,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 122 transitions, 1363 flow [2022-12-13 01:46:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:46:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:46:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-13 01:46:30,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3695652173913043 [2022-12-13 01:46:30,411 INFO L175 Difference]: Start difference. First operand has 110 places, 78 transitions, 840 flow. Second operand 6 states and 102 transitions. [2022-12-13 01:46:30,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 122 transitions, 1363 flow [2022-12-13 01:46:30,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 122 transitions, 1308 flow, removed 16 selfloop flow, removed 9 redundant places. [2022-12-13 01:46:30,426 INFO L231 Difference]: Finished difference. Result has 107 places, 74 transitions, 790 flow [2022-12-13 01:46:30,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=790, PETRI_PLACES=107, PETRI_TRANSITIONS=74} [2022-12-13 01:46:30,427 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:46:30,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:30,427 INFO L89 Accepts]: Start accepts. Operand has 107 places, 74 transitions, 790 flow [2022-12-13 01:46:30,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:30,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:30,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 74 transitions, 790 flow [2022-12-13 01:46:30,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 74 transitions, 790 flow [2022-12-13 01:46:30,448 INFO L130 PetriNetUnfolder]: 35/294 cut-off events. [2022-12-13 01:46:30,448 INFO L131 PetriNetUnfolder]: For 1529/1550 co-relation queries the response was YES. [2022-12-13 01:46:30,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 294 events. 35/294 cut-off events. For 1529/1550 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2038 event pairs, 1 based on Foata normal form. 7/291 useless extension candidates. Maximal degree in co-relation 1067. Up to 42 conditions per place. [2022-12-13 01:46:30,450 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 74 transitions, 790 flow [2022-12-13 01:46:30,450 INFO L226 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-13 01:46:30,451 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:30,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 01:46:30,451 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 74 transitions, 790 flow [2022-12-13 01:46:30,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:30,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:30,451 INFO L214 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] [2022-12-13 01:46:30,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 01:46:30,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:46:30,658 INFO L420 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:30,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash 114930399, now seen corresponding path program 1 times [2022-12-13 01:46:30,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:30,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614289759] [2022-12-13 01:46:30,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:30,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:31,458 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-13 01:46:31,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:31,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614289759] [2022-12-13 01:46:31,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614289759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:31,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:31,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:46:31,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402449037] [2022-12-13 01:46:31,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:31,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:46:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:31,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:46:31,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:46:31,460 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:46:31,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 74 transitions, 790 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:31,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:31,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:46:31,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:31,853 INFO L130 PetriNetUnfolder]: 537/1145 cut-off events. [2022-12-13 01:46:31,853 INFO L131 PetriNetUnfolder]: For 8190/8190 co-relation queries the response was YES. [2022-12-13 01:46:31,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5934 conditions, 1145 events. 537/1145 cut-off events. For 8190/8190 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6558 event pairs, 234 based on Foata normal form. 2/1147 useless extension candidates. Maximal degree in co-relation 5311. Up to 958 conditions per place. [2022-12-13 01:46:31,858 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 71 selfloop transitions, 6 changer transitions 39/116 dead transitions. [2022-12-13 01:46:31,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 116 transitions, 1288 flow [2022-12-13 01:46:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:46:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:46:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-12-13 01:46:31,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.21333333333333335 [2022-12-13 01:46:31,859 INFO L175 Difference]: Start difference. First operand has 103 places, 74 transitions, 790 flow. Second operand 10 states and 96 transitions. [2022-12-13 01:46:31,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 116 transitions, 1288 flow [2022-12-13 01:46:31,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 116 transitions, 1236 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-12-13 01:46:31,870 INFO L231 Difference]: Finished difference. Result has 108 places, 70 transitions, 713 flow [2022-12-13 01:46:31,870 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=713, PETRI_PLACES=108, PETRI_TRANSITIONS=70} [2022-12-13 01:46:31,870 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:46:31,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:31,871 INFO L89 Accepts]: Start accepts. Operand has 108 places, 70 transitions, 713 flow [2022-12-13 01:46:31,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:31,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:31,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 70 transitions, 713 flow [2022-12-13 01:46:31,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 70 transitions, 713 flow [2022-12-13 01:46:31,888 INFO L130 PetriNetUnfolder]: 32/256 cut-off events. [2022-12-13 01:46:31,888 INFO L131 PetriNetUnfolder]: For 1229/1247 co-relation queries the response was YES. [2022-12-13 01:46:31,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 256 events. 32/256 cut-off events. For 1229/1247 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1735 event pairs, 1 based on Foata normal form. 5/252 useless extension candidates. Maximal degree in co-relation 1030. Up to 38 conditions per place. [2022-12-13 01:46:31,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 70 transitions, 713 flow [2022-12-13 01:46:31,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-13 01:46:37,930 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:46:37,931 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6061 [2022-12-13 01:46:37,931 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 69 transitions, 705 flow [2022-12-13 01:46:37,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:37,931 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:37,931 INFO L214 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] [2022-12-13 01:46:37,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2022-12-13 01:46:37,931 INFO L420 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1017228954, now seen corresponding path program 1 times [2022-12-13 01:46:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:37,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248922273] [2022-12-13 01:46:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:38,893 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-13 01:46:38,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:38,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248922273] [2022-12-13 01:46:38,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248922273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:38,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:38,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:46:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784365067] [2022-12-13 01:46:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:38,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:46:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:46:38,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:46:38,894 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:46:38,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 69 transitions, 705 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:38,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:38,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:46:38,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:39,517 INFO L130 PetriNetUnfolder]: 995/2100 cut-off events. [2022-12-13 01:46:39,517 INFO L131 PetriNetUnfolder]: For 13911/13911 co-relation queries the response was YES. [2022-12-13 01:46:39,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10394 conditions, 2100 events. 995/2100 cut-off events. For 13911/13911 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14145 event pairs, 324 based on Foata normal form. 3/2103 useless extension candidates. Maximal degree in co-relation 10334. Up to 958 conditions per place. [2022-12-13 01:46:39,528 INFO L137 encePairwiseOnDemand]: 30/45 looper letters, 141 selfloop transitions, 20 changer transitions 33/194 dead transitions. [2022-12-13 01:46:39,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 194 transitions, 2082 flow [2022-12-13 01:46:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:46:39,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:46:39,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2022-12-13 01:46:39,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36444444444444446 [2022-12-13 01:46:39,528 INFO L175 Difference]: Start difference. First operand has 97 places, 69 transitions, 705 flow. Second operand 10 states and 164 transitions. [2022-12-13 01:46:39,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 194 transitions, 2082 flow [2022-12-13 01:46:39,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 194 transitions, 2002 flow, removed 24 selfloop flow, removed 11 redundant places. [2022-12-13 01:46:39,546 INFO L231 Difference]: Finished difference. Result has 101 places, 84 transitions, 937 flow [2022-12-13 01:46:39,547 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=937, PETRI_PLACES=101, PETRI_TRANSITIONS=84} [2022-12-13 01:46:39,547 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2022-12-13 01:46:39,547 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:39,547 INFO L89 Accepts]: Start accepts. Operand has 101 places, 84 transitions, 937 flow [2022-12-13 01:46:39,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:39,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:39,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 84 transitions, 937 flow [2022-12-13 01:46:39,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 84 transitions, 937 flow [2022-12-13 01:46:39,580 INFO L130 PetriNetUnfolder]: 55/497 cut-off events. [2022-12-13 01:46:39,580 INFO L131 PetriNetUnfolder]: For 2469/2502 co-relation queries the response was YES. [2022-12-13 01:46:39,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2055 conditions, 497 events. 55/497 cut-off events. For 2469/2502 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4249 event pairs, 1 based on Foata normal form. 11/485 useless extension candidates. Maximal degree in co-relation 2006. Up to 74 conditions per place. [2022-12-13 01:46:39,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 84 transitions, 937 flow [2022-12-13 01:46:39,583 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 01:46:39,702 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (not (= (ite (= (mod v_~e2~0_229 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (or (<= v_~n1~0_313 v_~n2~0_285) (= v_~n2~0_285 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= v_~i~0_491 (select (select |v_#memory_int_367| v_~f~0.base_290) (+ v_~f~0.offset_297 (* v_~i1~0_227 4)))) (= v_~i1~0_227 v_~i~0_492)) InVars {~n2~0=v_~n2~0_285, ~i~0=v_~i~0_492, ~f~0.base=v_~f~0.base_290, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229} OutVars{~n2~0=v_~n2~0_285, ~i~0=v_~i~0_491, ~f~0.base=v_~f~0.base_290, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~i1~0=v_~i1~0_227, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_144|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 01:46:39,828 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:46:39,829 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 282 [2022-12-13 01:46:39,829 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 979 flow [2022-12-13 01:46:39,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:39,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:39,829 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:39,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2022-12-13 01:46:39,830 INFO L420 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:39,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash 63877404, now seen corresponding path program 1 times [2022-12-13 01:46:39,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:39,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258709275] [2022-12-13 01:46:39,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:39,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:40,566 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-13 01:46:40,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:40,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258709275] [2022-12-13 01:46:40,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258709275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:40,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:40,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:46:40,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241160797] [2022-12-13 01:46:40,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:40,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:46:40,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:40,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:46:40,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:46:40,567 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:46:40,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 979 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:40,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:40,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:46:40,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:41,003 INFO L130 PetriNetUnfolder]: 918/1967 cut-off events. [2022-12-13 01:46:41,003 INFO L131 PetriNetUnfolder]: For 16742/16742 co-relation queries the response was YES. [2022-12-13 01:46:41,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10186 conditions, 1967 events. 918/1967 cut-off events. For 16742/16742 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13159 event pairs, 397 based on Foata normal form. 2/1969 useless extension candidates. Maximal degree in co-relation 10128. Up to 958 conditions per place. [2022-12-13 01:46:41,012 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 133 selfloop transitions, 13 changer transitions 33/179 dead transitions. [2022-12-13 01:46:41,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 179 transitions, 2050 flow [2022-12-13 01:46:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:46:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:46:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2022-12-13 01:46:41,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3725 [2022-12-13 01:46:41,013 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 979 flow. Second operand 8 states and 149 transitions. [2022-12-13 01:46:41,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 179 transitions, 2050 flow [2022-12-13 01:46:41,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 179 transitions, 2010 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-13 01:46:41,035 INFO L231 Difference]: Finished difference. Result has 107 places, 81 transitions, 909 flow [2022-12-13 01:46:41,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=909, PETRI_PLACES=107, PETRI_TRANSITIONS=81} [2022-12-13 01:46:41,035 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:46:41,035 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:41,035 INFO L89 Accepts]: Start accepts. Operand has 107 places, 81 transitions, 909 flow [2022-12-13 01:46:41,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:41,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:41,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 81 transitions, 909 flow [2022-12-13 01:46:41,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 81 transitions, 909 flow [2022-12-13 01:46:41,066 INFO L130 PetriNetUnfolder]: 51/472 cut-off events. [2022-12-13 01:46:41,066 INFO L131 PetriNetUnfolder]: For 2922/2957 co-relation queries the response was YES. [2022-12-13 01:46:41,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 472 events. 51/472 cut-off events. For 2922/2957 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3958 event pairs, 5 based on Foata normal form. 11/459 useless extension candidates. Maximal degree in co-relation 1930. Up to 83 conditions per place. [2022-12-13 01:46:41,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 81 transitions, 909 flow [2022-12-13 01:46:41,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 428 [2022-12-13 01:46:41,072 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:41,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 01:46:41,072 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 81 transitions, 909 flow [2022-12-13 01:46:41,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:41,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:41,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:41,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2022-12-13 01:46:41,073 INFO L420 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:41,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash -271918874, now seen corresponding path program 1 times [2022-12-13 01:46:41,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:41,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587225829] [2022-12-13 01:46:41,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:41,867 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-13 01:46:41,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:41,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587225829] [2022-12-13 01:46:41,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587225829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:41,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:41,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:46:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308282472] [2022-12-13 01:46:41,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:41,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:46:41,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:41,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:46:41,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:46:41,868 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:46:41,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 81 transitions, 909 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:41,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:41,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:46:41,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:42,451 INFO L130 PetriNetUnfolder]: 967/2066 cut-off events. [2022-12-13 01:46:42,451 INFO L131 PetriNetUnfolder]: For 17546/17546 co-relation queries the response was YES. [2022-12-13 01:46:42,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10476 conditions, 2066 events. 967/2066 cut-off events. For 17546/17546 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13978 event pairs, 353 based on Foata normal form. 2/2068 useless extension candidates. Maximal degree in co-relation 10410. Up to 958 conditions per place. [2022-12-13 01:46:42,461 INFO L137 encePairwiseOnDemand]: 34/48 looper letters, 171 selfloop transitions, 27 changer transitions 19/217 dead transitions. [2022-12-13 01:46:42,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 217 transitions, 2357 flow [2022-12-13 01:46:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 01:46:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 01:46:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2022-12-13 01:46:42,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3211805555555556 [2022-12-13 01:46:42,461 INFO L175 Difference]: Start difference. First operand has 105 places, 81 transitions, 909 flow. Second operand 12 states and 185 transitions. [2022-12-13 01:46:42,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 217 transitions, 2357 flow [2022-12-13 01:46:42,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 217 transitions, 2321 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-13 01:46:42,483 INFO L231 Difference]: Finished difference. Result has 117 places, 94 transitions, 1167 flow [2022-12-13 01:46:42,483 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1167, PETRI_PLACES=117, PETRI_TRANSITIONS=94} [2022-12-13 01:46:42,485 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2022-12-13 01:46:42,485 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:42,485 INFO L89 Accepts]: Start accepts. Operand has 117 places, 94 transitions, 1167 flow [2022-12-13 01:46:42,485 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:42,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:42,485 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 94 transitions, 1167 flow [2022-12-13 01:46:42,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 94 transitions, 1167 flow [2022-12-13 01:46:42,519 INFO L130 PetriNetUnfolder]: 60/503 cut-off events. [2022-12-13 01:46:42,519 INFO L131 PetriNetUnfolder]: For 3874/3897 co-relation queries the response was YES. [2022-12-13 01:46:42,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2300 conditions, 503 events. 60/503 cut-off events. For 3874/3897 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4275 event pairs, 6 based on Foata normal form. 13/488 useless extension candidates. Maximal degree in co-relation 2240. Up to 94 conditions per place. [2022-12-13 01:46:42,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 94 transitions, 1167 flow [2022-12-13 01:46:42,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-13 01:46:42,801 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [710] L53-->L97: Formula: (and (= v_~e2~0_167 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|) (= (+ v_~tmp1~0_123 1) v_~n1~0_225) (= v_~e1~0_133 0) (= (+ v_~tmp2~0_121 1) v_~n2~0_206) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| (ite (= (mod v_~e1~0_133 256) 0) 1 0))) InVars {~tmp2~0=v_~tmp2~0_121, ~tmp1~0=v_~tmp1~0_123} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|, ~n2~0=v_~n2~0_206, ~n1~0=v_~n1~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77|, ~tmp2~0=v_~tmp2~0_121, ~e2~0=v_~e2~0_167, ~tmp1~0=v_~tmp1~0_123, ~e1~0=v_~e1~0_133} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0, ~e1~0] and [928] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_686| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_686|) (not (= (ite (or (<= v_~n1~0_1150 v_~n2~0_1280) (= v_~n2~0_1280 0)) 1 0) 0)) (not (= (ite (= (mod v_~e2~0_1062 256) 0) 1 0) 0)) (= v_~i~0_2082 (select (select |v_#memory_int_1259| v_~f~0.base_1121) (+ v_~f~0.offset_1127 (* v_~i1~0_743 4)))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_72| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_686| 0)) (= v_~i1~0_743 v_~i~0_2083) (= |v_thread1Thread1of1ForFork1_#res#1.base_72| 0) (= v_~n1~0_1149 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_686| (ite (and (< v_~i~0_2082 v_~n~0_693) (<= 0 v_~i~0_2082)) 1 0))) InVars {~n2~0=v_~n2~0_1280, ~i~0=v_~i~0_2083, ~f~0.base=v_~f~0.base_1121, ~n1~0=v_~n1~0_1150, #memory_int=|v_#memory_int_1259|, ~n~0=v_~n~0_693, ~f~0.offset=v_~f~0.offset_1127, ~e2~0=v_~e2~0_1062} OutVars{~n2~0=v_~n2~0_1280, ~i~0=v_~i~0_2082, ~n1~0=v_~n1~0_1149, ~f~0.base=v_~f~0.base_1121, ~i1~0=v_~i1~0_743, ~f~0.offset=v_~f~0.offset_1127, ~e2~0=v_~e2~0_1062, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_686|, #memory_int=|v_#memory_int_1259|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_72|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_72|, ~n~0=v_~n~0_693, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_642|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_686|} AuxVars[] AssignedVars[~i~0, ~n1~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:46:42,960 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:46:42,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 476 [2022-12-13 01:46:42,961 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 93 transitions, 1225 flow [2022-12-13 01:46:42,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:42,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:42,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:42,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2022-12-13 01:46:42,961 INFO L420 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:42,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1718896035, now seen corresponding path program 1 times [2022-12-13 01:46:42,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:42,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676948470] [2022-12-13 01:46:42,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:42,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:44,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-13 01:46:44,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:44,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676948470] [2022-12-13 01:46:44,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676948470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:44,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:44,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:46:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647657528] [2022-12-13 01:46:44,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:44,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:46:44,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:44,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:46:44,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:46:44,015 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:46:44,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 93 transitions, 1225 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:44,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:44,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:46:44,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:44,591 INFO L130 PetriNetUnfolder]: 959/2069 cut-off events. [2022-12-13 01:46:44,591 INFO L131 PetriNetUnfolder]: For 23012/23012 co-relation queries the response was YES. [2022-12-13 01:46:44,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11225 conditions, 2069 events. 959/2069 cut-off events. For 23012/23012 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14056 event pairs, 341 based on Foata normal form. 2/2071 useless extension candidates. Maximal degree in co-relation 11148. Up to 958 conditions per place. [2022-12-13 01:46:44,603 INFO L137 encePairwiseOnDemand]: 34/53 looper letters, 162 selfloop transitions, 31 changer transitions 12/205 dead transitions. [2022-12-13 01:46:44,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 205 transitions, 2489 flow [2022-12-13 01:46:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:46:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:46:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2022-12-13 01:46:44,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32452830188679244 [2022-12-13 01:46:44,604 INFO L175 Difference]: Start difference. First operand has 115 places, 93 transitions, 1225 flow. Second operand 10 states and 172 transitions. [2022-12-13 01:46:44,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 205 transitions, 2489 flow [2022-12-13 01:46:44,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 205 transitions, 2380 flow, removed 40 selfloop flow, removed 8 redundant places. [2022-12-13 01:46:44,641 INFO L231 Difference]: Finished difference. Result has 121 places, 98 transitions, 1330 flow [2022-12-13 01:46:44,642 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1330, PETRI_PLACES=121, PETRI_TRANSITIONS=98} [2022-12-13 01:46:44,642 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places. [2022-12-13 01:46:44,642 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:44,642 INFO L89 Accepts]: Start accepts. Operand has 121 places, 98 transitions, 1330 flow [2022-12-13 01:46:44,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:44,642 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:44,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 98 transitions, 1330 flow [2022-12-13 01:46:44,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 98 transitions, 1330 flow [2022-12-13 01:46:44,678 INFO L130 PetriNetUnfolder]: 57/508 cut-off events. [2022-12-13 01:46:44,679 INFO L131 PetriNetUnfolder]: For 4329/4372 co-relation queries the response was YES. [2022-12-13 01:46:44,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2357 conditions, 508 events. 57/508 cut-off events. For 4329/4372 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4340 event pairs, 3 based on Foata normal form. 19/501 useless extension candidates. Maximal degree in co-relation 2292. Up to 84 conditions per place. [2022-12-13 01:46:44,682 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 98 transitions, 1330 flow [2022-12-13 01:46:44,682 INFO L226 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-13 01:46:44,709 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:44,709 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 01:46:44,709 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 98 transitions, 1330 flow [2022-12-13 01:46:44,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:44,709 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:44,710 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:44,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2022-12-13 01:46:44,710 INFO L420 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:44,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash 688875901, now seen corresponding path program 1 times [2022-12-13 01:46:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:44,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205972837] [2022-12-13 01:46:44,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:44,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:45,309 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-13 01:46:45,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:45,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205972837] [2022-12-13 01:46:45,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205972837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:45,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:45,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:46:45,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664335391] [2022-12-13 01:46:45,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:45,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:46:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:45,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:46:45,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:46:45,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 01:46:45,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 98 transitions, 1330 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:46:45,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:45,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 01:46:45,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:45,741 INFO L130 PetriNetUnfolder]: 924/1993 cut-off events. [2022-12-13 01:46:45,741 INFO L131 PetriNetUnfolder]: For 22888/22888 co-relation queries the response was YES. [2022-12-13 01:46:45,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10964 conditions, 1993 events. 924/1993 cut-off events. For 22888/22888 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13435 event pairs, 473 based on Foata normal form. 1/1994 useless extension candidates. Maximal degree in co-relation 10886. Up to 958 conditions per place. [2022-12-13 01:46:45,752 INFO L137 encePairwiseOnDemand]: 41/53 looper letters, 145 selfloop transitions, 12 changer transitions 30/187 dead transitions. [2022-12-13 01:46:45,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 187 transitions, 2363 flow [2022-12-13 01:46:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:46:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:46:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2022-12-13 01:46:45,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3490566037735849 [2022-12-13 01:46:45,753 INFO L175 Difference]: Start difference. First operand has 119 places, 98 transitions, 1330 flow. Second operand 8 states and 148 transitions. [2022-12-13 01:46:45,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 187 transitions, 2363 flow [2022-12-13 01:46:45,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 187 transitions, 2270 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-12-13 01:46:45,786 INFO L231 Difference]: Finished difference. Result has 120 places, 94 transitions, 1175 flow [2022-12-13 01:46:45,786 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1175, PETRI_PLACES=120, PETRI_TRANSITIONS=94} [2022-12-13 01:46:45,786 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 79 predicate places. [2022-12-13 01:46:45,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:45,786 INFO L89 Accepts]: Start accepts. Operand has 120 places, 94 transitions, 1175 flow [2022-12-13 01:46:45,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:45,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:45,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 94 transitions, 1175 flow [2022-12-13 01:46:45,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 94 transitions, 1175 flow [2022-12-13 01:46:45,820 INFO L130 PetriNetUnfolder]: 54/489 cut-off events. [2022-12-13 01:46:45,821 INFO L131 PetriNetUnfolder]: For 3364/3389 co-relation queries the response was YES. [2022-12-13 01:46:45,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2094 conditions, 489 events. 54/489 cut-off events. For 3364/3389 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4152 event pairs, 4 based on Foata normal form. 13/477 useless extension candidates. Maximal degree in co-relation 2031. Up to 75 conditions per place. [2022-12-13 01:46:45,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 94 transitions, 1175 flow [2022-12-13 01:46:45,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 512 [2022-12-13 01:46:45,827 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:45,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 01:46:45,827 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 94 transitions, 1175 flow [2022-12-13 01:46:45,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:46:45,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:45,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:45,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2022-12-13 01:46:45,828 INFO L420 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:45,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:45,828 INFO L85 PathProgramCache]: Analyzing trace with hash 441274866, now seen corresponding path program 1 times [2022-12-13 01:46:45,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:45,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899338436] [2022-12-13 01:46:45,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:45,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:46,688 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-13 01:46:46,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:46,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899338436] [2022-12-13 01:46:46,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899338436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:46,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:46,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:46:46,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352213605] [2022-12-13 01:46:46,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:46,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:46:46,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:46,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:46:46,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:46:46,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:46:46,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 94 transitions, 1175 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:46,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:46,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:46:46,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:47,112 INFO L130 PetriNetUnfolder]: 887/1909 cut-off events. [2022-12-13 01:46:47,112 INFO L131 PetriNetUnfolder]: For 18555/18555 co-relation queries the response was YES. [2022-12-13 01:46:47,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10007 conditions, 1909 events. 887/1909 cut-off events. For 18555/18555 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12659 event pairs, 415 based on Foata normal form. 2/1911 useless extension candidates. Maximal degree in co-relation 9937. Up to 958 conditions per place. [2022-12-13 01:46:47,123 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 152 selfloop transitions, 16 changer transitions 17/185 dead transitions. [2022-12-13 01:46:47,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 185 transitions, 2198 flow [2022-12-13 01:46:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:46:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:46:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2022-12-13 01:46:47,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37 [2022-12-13 01:46:47,124 INFO L175 Difference]: Start difference. First operand has 117 places, 94 transitions, 1175 flow. Second operand 8 states and 148 transitions. [2022-12-13 01:46:47,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 185 transitions, 2198 flow [2022-12-13 01:46:47,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 185 transitions, 2128 flow, removed 22 selfloop flow, removed 9 redundant places. [2022-12-13 01:46:47,152 INFO L231 Difference]: Finished difference. Result has 117 places, 94 transitions, 1151 flow [2022-12-13 01:46:47,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1151, PETRI_PLACES=117, PETRI_TRANSITIONS=94} [2022-12-13 01:46:47,152 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2022-12-13 01:46:47,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:47,153 INFO L89 Accepts]: Start accepts. Operand has 117 places, 94 transitions, 1151 flow [2022-12-13 01:46:47,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:47,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:47,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 94 transitions, 1151 flow [2022-12-13 01:46:47,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 94 transitions, 1151 flow [2022-12-13 01:46:47,187 INFO L130 PetriNetUnfolder]: 54/491 cut-off events. [2022-12-13 01:46:47,187 INFO L131 PetriNetUnfolder]: For 3428/3453 co-relation queries the response was YES. [2022-12-13 01:46:47,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 491 events. 54/491 cut-off events. For 3428/3453 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4139 event pairs, 4 based on Foata normal form. 13/479 useless extension candidates. Maximal degree in co-relation 2023. Up to 75 conditions per place. [2022-12-13 01:46:47,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 94 transitions, 1151 flow [2022-12-13 01:46:47,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 01:46:47,190 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:47,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 01:46:47,191 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 94 transitions, 1151 flow [2022-12-13 01:46:47,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:47,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:47,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:47,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2022-12-13 01:46:47,191 INFO L420 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:47,191 INFO L85 PathProgramCache]: Analyzing trace with hash 644660290, now seen corresponding path program 2 times [2022-12-13 01:46:47,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:47,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410408691] [2022-12-13 01:46:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:47,884 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-13 01:46:47,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:47,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410408691] [2022-12-13 01:46:47,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410408691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:47,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:47,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:46:47,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488393770] [2022-12-13 01:46:47,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:47,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:46:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:47,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:46:47,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:46:47,885 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:46:47,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 94 transitions, 1151 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:47,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:47,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:46:47,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:48,337 INFO L130 PetriNetUnfolder]: 893/1939 cut-off events. [2022-12-13 01:46:48,337 INFO L131 PetriNetUnfolder]: For 19088/19088 co-relation queries the response was YES. [2022-12-13 01:46:48,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10011 conditions, 1939 events. 893/1939 cut-off events. For 19088/19088 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13075 event pairs, 431 based on Foata normal form. 2/1941 useless extension candidates. Maximal degree in co-relation 9942. Up to 958 conditions per place. [2022-12-13 01:46:48,348 INFO L137 encePairwiseOnDemand]: 39/50 looper letters, 148 selfloop transitions, 12 changer transitions 25/185 dead transitions. [2022-12-13 01:46:48,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 185 transitions, 2180 flow [2022-12-13 01:46:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:46:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:46:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2022-12-13 01:46:48,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37 [2022-12-13 01:46:48,349 INFO L175 Difference]: Start difference. First operand has 115 places, 94 transitions, 1151 flow. Second operand 8 states and 148 transitions. [2022-12-13 01:46:48,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 185 transitions, 2180 flow [2022-12-13 01:46:48,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 185 transitions, 2153 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 01:46:48,380 INFO L231 Difference]: Finished difference. Result has 119 places, 90 transitions, 1048 flow [2022-12-13 01:46:48,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1048, PETRI_PLACES=119, PETRI_TRANSITIONS=90} [2022-12-13 01:46:48,380 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 01:46:48,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:48,380 INFO L89 Accepts]: Start accepts. Operand has 119 places, 90 transitions, 1048 flow [2022-12-13 01:46:48,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:48,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:48,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 90 transitions, 1048 flow [2022-12-13 01:46:48,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 90 transitions, 1048 flow [2022-12-13 01:46:48,413 INFO L130 PetriNetUnfolder]: 50/472 cut-off events. [2022-12-13 01:46:48,413 INFO L131 PetriNetUnfolder]: For 2951/2966 co-relation queries the response was YES. [2022-12-13 01:46:48,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 472 events. 50/472 cut-off events. For 2951/2966 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3987 event pairs, 4 based on Foata normal form. 12/461 useless extension candidates. Maximal degree in co-relation 1894. Up to 69 conditions per place. [2022-12-13 01:46:48,417 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 90 transitions, 1048 flow [2022-12-13 01:46:48,417 INFO L226 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-13 01:46:48,421 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:46:48,443 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:46:48,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-13 01:46:48,444 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 89 transitions, 1044 flow [2022-12-13 01:46:48,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:48,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:48,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:48,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2022-12-13 01:46:48,444 INFO L420 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash 500960367, now seen corresponding path program 2 times [2022-12-13 01:46:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:48,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848891333] [2022-12-13 01:46:48,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:48,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:46:49,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:49,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848891333] [2022-12-13 01:46:49,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848891333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:49,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:49,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:46:49,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373991191] [2022-12-13 01:46:49,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:49,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:46:49,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:49,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:46:49,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:46:49,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:46:49,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 89 transitions, 1044 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:49,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:49,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:46:49,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:49,551 INFO L130 PetriNetUnfolder]: 867/1889 cut-off events. [2022-12-13 01:46:49,551 INFO L131 PetriNetUnfolder]: For 17083/17083 co-relation queries the response was YES. [2022-12-13 01:46:49,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9588 conditions, 1889 events. 867/1889 cut-off events. For 17083/17083 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12589 event pairs, 377 based on Foata normal form. 2/1891 useless extension candidates. Maximal degree in co-relation 9518. Up to 958 conditions per place. [2022-12-13 01:46:49,558 INFO L137 encePairwiseOnDemand]: 35/48 looper letters, 144 selfloop transitions, 12 changer transitions 31/187 dead transitions. [2022-12-13 01:46:49,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 187 transitions, 2149 flow [2022-12-13 01:46:49,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:46:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:46:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2022-12-13 01:46:49,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35648148148148145 [2022-12-13 01:46:49,559 INFO L175 Difference]: Start difference. First operand has 115 places, 89 transitions, 1044 flow. Second operand 9 states and 154 transitions. [2022-12-13 01:46:49,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 187 transitions, 2149 flow [2022-12-13 01:46:49,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 187 transitions, 2099 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-12-13 01:46:49,583 INFO L231 Difference]: Finished difference. Result has 116 places, 85 transitions, 959 flow [2022-12-13 01:46:49,583 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1002, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=959, PETRI_PLACES=116, PETRI_TRANSITIONS=85} [2022-12-13 01:46:49,584 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2022-12-13 01:46:49,584 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:49,584 INFO L89 Accepts]: Start accepts. Operand has 116 places, 85 transitions, 959 flow [2022-12-13 01:46:49,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:49,584 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:49,584 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 85 transitions, 959 flow [2022-12-13 01:46:49,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 85 transitions, 959 flow [2022-12-13 01:46:49,611 INFO L130 PetriNetUnfolder]: 47/418 cut-off events. [2022-12-13 01:46:49,611 INFO L131 PetriNetUnfolder]: For 2266/2280 co-relation queries the response was YES. [2022-12-13 01:46:49,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 418 events. 47/418 cut-off events. For 2266/2280 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3338 event pairs, 3 based on Foata normal form. 11/413 useless extension candidates. Maximal degree in co-relation 1673. Up to 58 conditions per place. [2022-12-13 01:46:49,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 85 transitions, 959 flow [2022-12-13 01:46:49,614 INFO L226 LiptonReduction]: Number of co-enabled transitions 434 [2022-12-13 01:46:49,614 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:49,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 01:46:49,615 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 959 flow [2022-12-13 01:46:49,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:46:49,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:49,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:46:49,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2022-12-13 01:46:49,615 INFO L420 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:49,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1819410627, now seen corresponding path program 1 times [2022-12-13 01:46:49,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:49,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73905322] [2022-12-13 01:46:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:50,368 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-13 01:46:50,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:50,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73905322] [2022-12-13 01:46:50,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73905322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:50,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:50,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:46:50,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359255575] [2022-12-13 01:46:50,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:50,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:46:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:50,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:46:50,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:46:50,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:46:50,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 959 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:50,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:50,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:46:50,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:50,886 INFO L130 PetriNetUnfolder]: 742/1613 cut-off events. [2022-12-13 01:46:50,886 INFO L131 PetriNetUnfolder]: For 12132/12132 co-relation queries the response was YES. [2022-12-13 01:46:50,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8033 conditions, 1613 events. 742/1613 cut-off events. For 12132/12132 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10392 event pairs, 282 based on Foata normal form. 4/1617 useless extension candidates. Maximal degree in co-relation 7970. Up to 958 conditions per place. [2022-12-13 01:46:50,895 INFO L137 encePairwiseOnDemand]: 34/47 looper letters, 122 selfloop transitions, 9 changer transitions 49/180 dead transitions. [2022-12-13 01:46:50,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 180 transitions, 1965 flow [2022-12-13 01:46:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:46:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:46:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2022-12-13 01:46:50,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32340425531914896 [2022-12-13 01:46:50,896 INFO L175 Difference]: Start difference. First operand has 111 places, 85 transitions, 959 flow. Second operand 10 states and 152 transitions. [2022-12-13 01:46:50,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 180 transitions, 1965 flow [2022-12-13 01:46:50,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 180 transitions, 1885 flow, removed 28 selfloop flow, removed 10 redundant places. [2022-12-13 01:46:50,919 INFO L231 Difference]: Finished difference. Result has 113 places, 73 transitions, 763 flow [2022-12-13 01:46:50,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=763, PETRI_PLACES=113, PETRI_TRANSITIONS=73} [2022-12-13 01:46:50,920 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2022-12-13 01:46:50,920 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:50,920 INFO L89 Accepts]: Start accepts. Operand has 113 places, 73 transitions, 763 flow [2022-12-13 01:46:50,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:50,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:50,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 73 transitions, 763 flow [2022-12-13 01:46:50,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 73 transitions, 763 flow [2022-12-13 01:46:50,949 INFO L130 PetriNetUnfolder]: 41/362 cut-off events. [2022-12-13 01:46:50,950 INFO L131 PetriNetUnfolder]: For 1814/1827 co-relation queries the response was YES. [2022-12-13 01:46:50,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 362 events. 41/362 cut-off events. For 1814/1827 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2750 event pairs, 3 based on Foata normal form. 10/358 useless extension candidates. Maximal degree in co-relation 1460. Up to 55 conditions per place. [2022-12-13 01:46:50,952 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 73 transitions, 763 flow [2022-12-13 01:46:50,952 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 01:46:50,953 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:50,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 01:46:50,953 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 73 transitions, 763 flow [2022-12-13 01:46:50,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:46:50,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:50,954 INFO L214 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] [2022-12-13 01:46:50,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2022-12-13 01:46:50,954 INFO L420 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:50,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1276885635, now seen corresponding path program 1 times [2022-12-13 01:46:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:50,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859013045] [2022-12-13 01:46:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:52,015 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-13 01:46:52,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:52,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859013045] [2022-12-13 01:46:52,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859013045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:52,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:52,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:46:52,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375685679] [2022-12-13 01:46:52,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:52,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:46:52,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:52,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:46:52,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:46:52,017 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:46:52,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 73 transitions, 763 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:52,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:52,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:46:52,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:52,592 INFO L130 PetriNetUnfolder]: 624/1353 cut-off events. [2022-12-13 01:46:52,592 INFO L131 PetriNetUnfolder]: For 9787/9787 co-relation queries the response was YES. [2022-12-13 01:46:52,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6815 conditions, 1353 events. 624/1353 cut-off events. For 9787/9787 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8242 event pairs, 251 based on Foata normal form. 3/1356 useless extension candidates. Maximal degree in co-relation 6760. Up to 958 conditions per place. [2022-12-13 01:46:52,599 INFO L137 encePairwiseOnDemand]: 31/45 looper letters, 99 selfloop transitions, 10 changer transitions 44/153 dead transitions. [2022-12-13 01:46:52,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 153 transitions, 1622 flow [2022-12-13 01:46:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:46:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:46:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-12-13 01:46:52,600 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29333333333333333 [2022-12-13 01:46:52,600 INFO L175 Difference]: Start difference. First operand has 102 places, 73 transitions, 763 flow. Second operand 10 states and 132 transitions. [2022-12-13 01:46:52,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 153 transitions, 1622 flow [2022-12-13 01:46:52,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 153 transitions, 1574 flow, removed 15 selfloop flow, removed 10 redundant places. [2022-12-13 01:46:52,615 INFO L231 Difference]: Finished difference. Result has 106 places, 74 transitions, 776 flow [2022-12-13 01:46:52,615 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=776, PETRI_PLACES=106, PETRI_TRANSITIONS=74} [2022-12-13 01:46:52,615 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 01:46:52,616 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:52,616 INFO L89 Accepts]: Start accepts. Operand has 106 places, 74 transitions, 776 flow [2022-12-13 01:46:52,616 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:52,616 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:52,616 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 74 transitions, 776 flow [2022-12-13 01:46:52,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 74 transitions, 776 flow [2022-12-13 01:46:52,638 INFO L130 PetriNetUnfolder]: 38/319 cut-off events. [2022-12-13 01:46:52,638 INFO L131 PetriNetUnfolder]: For 1635/1647 co-relation queries the response was YES. [2022-12-13 01:46:52,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 319 events. 38/319 cut-off events. For 1635/1647 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2262 event pairs, 3 based on Foata normal form. 10/314 useless extension candidates. Maximal degree in co-relation 1321. Up to 49 conditions per place. [2022-12-13 01:46:52,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 74 transitions, 776 flow [2022-12-13 01:46:52,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-13 01:46:52,641 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:46:52,641 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 01:46:52,641 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 74 transitions, 776 flow [2022-12-13 01:46:52,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:52,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:46:52,642 INFO L214 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] [2022-12-13 01:46:52,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2022-12-13 01:46:52,642 INFO L420 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:46:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:46:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1865768143, now seen corresponding path program 1 times [2022-12-13 01:46:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:46:52,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030397765] [2022-12-13 01:46:52,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:46:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:46:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:46:53,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-13 01:46:53,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:46:53,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030397765] [2022-12-13 01:46:53,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030397765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:46:53,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:46:53,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:46:53,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606627132] [2022-12-13 01:46:53,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:46:53,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:46:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:46:53,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:46:53,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:46:53,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:46:53,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 74 transitions, 776 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:46:53,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:46:53,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:46:53,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:46:53,954 INFO L130 PetriNetUnfolder]: 561/1199 cut-off events. [2022-12-13 01:46:53,955 INFO L131 PetriNetUnfolder]: For 8734/8734 co-relation queries the response was YES. [2022-12-13 01:46:53,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6153 conditions, 1199 events. 561/1199 cut-off events. For 8734/8734 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6917 event pairs, 249 based on Foata normal form. 2/1201 useless extension candidates. Maximal degree in co-relation 6105. Up to 958 conditions per place. [2022-12-13 01:46:53,960 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 71 selfloop transitions, 6 changer transitions 46/123 dead transitions. [2022-12-13 01:46:53,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 123 transitions, 1361 flow [2022-12-13 01:46:53,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:46:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:46:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2022-12-13 01:46:53,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2288888888888889 [2022-12-13 01:46:53,961 INFO L175 Difference]: Start difference. First operand has 102 places, 74 transitions, 776 flow. Second operand 10 states and 103 transitions. [2022-12-13 01:46:53,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 123 transitions, 1361 flow [2022-12-13 01:46:53,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 123 transitions, 1317 flow, removed 13 selfloop flow, removed 8 redundant places. [2022-12-13 01:46:53,972 INFO L231 Difference]: Finished difference. Result has 107 places, 70 transitions, 715 flow [2022-12-13 01:46:53,972 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=715, PETRI_PLACES=107, PETRI_TRANSITIONS=70} [2022-12-13 01:46:53,973 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 01:46:53,973 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:46:53,973 INFO L89 Accepts]: Start accepts. Operand has 107 places, 70 transitions, 715 flow [2022-12-13 01:46:53,973 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:46:53,973 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:46:53,973 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 70 transitions, 715 flow [2022-12-13 01:46:53,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 70 transitions, 715 flow [2022-12-13 01:46:53,992 INFO L130 PetriNetUnfolder]: 35/269 cut-off events. [2022-12-13 01:46:53,992 INFO L131 PetriNetUnfolder]: For 1303/1310 co-relation queries the response was YES. [2022-12-13 01:46:53,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1139 conditions, 269 events. 35/269 cut-off events. For 1303/1310 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1873 event pairs, 3 based on Foata normal form. 6/262 useless extension candidates. Maximal degree in co-relation 1096. Up to 39 conditions per place. [2022-12-13 01:46:53,994 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 70 transitions, 715 flow [2022-12-13 01:46:53,994 INFO L226 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-13 01:47:07,129 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification. DAG size of input: 224 DAG size of output: 222 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:47:09,686 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:47:09,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15713 [2022-12-13 01:47:09,687 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 69 transitions, 709 flow [2022-12-13 01:47:09,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:09,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:09,687 INFO L214 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] [2022-12-13 01:47:09,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2022-12-13 01:47:09,687 INFO L420 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:09,687 INFO L85 PathProgramCache]: Analyzing trace with hash 292300973, now seen corresponding path program 1 times [2022-12-13 01:47:09,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:09,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972578644] [2022-12-13 01:47:09,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:10,696 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-13 01:47:10,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:10,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972578644] [2022-12-13 01:47:10,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972578644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:10,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:10,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:47:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297557460] [2022-12-13 01:47:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:10,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:47:10,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:10,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:47:10,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:47:10,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:47:10,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 69 transitions, 709 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:10,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:10,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:47:10,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:11,299 INFO L130 PetriNetUnfolder]: 1021/2150 cut-off events. [2022-12-13 01:47:11,299 INFO L131 PetriNetUnfolder]: For 15044/15044 co-relation queries the response was YES. [2022-12-13 01:47:11,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10744 conditions, 2150 events. 1021/2150 cut-off events. For 15044/15044 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14466 event pairs, 368 based on Foata normal form. 3/2153 useless extension candidates. Maximal degree in co-relation 10684. Up to 958 conditions per place. [2022-12-13 01:47:11,312 INFO L137 encePairwiseOnDemand]: 34/45 looper letters, 130 selfloop transitions, 11 changer transitions 47/188 dead transitions. [2022-12-13 01:47:11,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 188 transitions, 2057 flow [2022-12-13 01:47:11,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:47:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:47:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2022-12-13 01:47:11,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38765432098765434 [2022-12-13 01:47:11,312 INFO L175 Difference]: Start difference. First operand has 97 places, 69 transitions, 709 flow. Second operand 9 states and 157 transitions. [2022-12-13 01:47:11,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 188 transitions, 2057 flow [2022-12-13 01:47:11,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 188 transitions, 1983 flow, removed 21 selfloop flow, removed 10 redundant places. [2022-12-13 01:47:11,348 INFO L231 Difference]: Finished difference. Result has 100 places, 75 transitions, 785 flow [2022-12-13 01:47:11,348 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=785, PETRI_PLACES=100, PETRI_TRANSITIONS=75} [2022-12-13 01:47:11,349 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2022-12-13 01:47:11,349 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:11,349 INFO L89 Accepts]: Start accepts. Operand has 100 places, 75 transitions, 785 flow [2022-12-13 01:47:11,349 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:11,350 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:11,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 75 transitions, 785 flow [2022-12-13 01:47:11,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 75 transitions, 785 flow [2022-12-13 01:47:11,388 INFO L130 PetriNetUnfolder]: 54/464 cut-off events. [2022-12-13 01:47:11,388 INFO L131 PetriNetUnfolder]: For 2260/2272 co-relation queries the response was YES. [2022-12-13 01:47:11,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 464 events. 54/464 cut-off events. For 2260/2272 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3864 event pairs, 8 based on Foata normal form. 10/448 useless extension candidates. Maximal degree in co-relation 1814. Up to 76 conditions per place. [2022-12-13 01:47:11,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 75 transitions, 785 flow [2022-12-13 01:47:11,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 01:47:11,391 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:47:11,392 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 01:47:11,392 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 785 flow [2022-12-13 01:47:11,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:11,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:11,392 INFO L214 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] [2022-12-13 01:47:11,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2022-12-13 01:47:11,392 INFO L420 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:11,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2082794654, now seen corresponding path program 1 times [2022-12-13 01:47:11,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:11,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77370868] [2022-12-13 01:47:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:11,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:12,077 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-13 01:47:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:12,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77370868] [2022-12-13 01:47:12,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77370868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:12,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:12,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:47:12,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768986989] [2022-12-13 01:47:12,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:12,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:47:12,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:12,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:47:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:47:12,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:47:12,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 75 transitions, 785 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:12,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:12,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:47:12,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:12,515 INFO L130 PetriNetUnfolder]: 886/1888 cut-off events. [2022-12-13 01:47:12,516 INFO L131 PetriNetUnfolder]: For 13343/13343 co-relation queries the response was YES. [2022-12-13 01:47:12,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9235 conditions, 1888 events. 886/1888 cut-off events. For 13343/13343 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12412 event pairs, 401 based on Foata normal form. 3/1891 useless extension candidates. Maximal degree in co-relation 9180. Up to 958 conditions per place. [2022-12-13 01:47:12,524 INFO L137 encePairwiseOnDemand]: 34/45 looper letters, 119 selfloop transitions, 11 changer transitions 43/173 dead transitions. [2022-12-13 01:47:12,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 173 transitions, 1879 flow [2022-12-13 01:47:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:47:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:47:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2022-12-13 01:47:12,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3654320987654321 [2022-12-13 01:47:12,525 INFO L175 Difference]: Start difference. First operand has 97 places, 75 transitions, 785 flow. Second operand 9 states and 148 transitions. [2022-12-13 01:47:12,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 173 transitions, 1879 flow [2022-12-13 01:47:12,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 173 transitions, 1865 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 01:47:12,542 INFO L231 Difference]: Finished difference. Result has 106 places, 76 transitions, 822 flow [2022-12-13 01:47:12,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=822, PETRI_PLACES=106, PETRI_TRANSITIONS=76} [2022-12-13 01:47:12,543 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 01:47:12,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:12,543 INFO L89 Accepts]: Start accepts. Operand has 106 places, 76 transitions, 822 flow [2022-12-13 01:47:12,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:12,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:12,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 76 transitions, 822 flow [2022-12-13 01:47:12,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 76 transitions, 822 flow [2022-12-13 01:47:12,572 INFO L130 PetriNetUnfolder]: 52/453 cut-off events. [2022-12-13 01:47:12,572 INFO L131 PetriNetUnfolder]: For 2517/2531 co-relation queries the response was YES. [2022-12-13 01:47:12,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 453 events. 52/453 cut-off events. For 2517/2531 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3760 event pairs, 11 based on Foata normal form. 12/440 useless extension candidates. Maximal degree in co-relation 1839. Up to 73 conditions per place. [2022-12-13 01:47:12,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 76 transitions, 822 flow [2022-12-13 01:47:12,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-13 01:47:12,575 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:47:12,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 01:47:12,576 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 76 transitions, 822 flow [2022-12-13 01:47:12,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:12,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:12,576 INFO L214 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] [2022-12-13 01:47:12,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2022-12-13 01:47:12,576 INFO L420 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash -826965213, now seen corresponding path program 2 times [2022-12-13 01:47:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:12,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803279695] [2022-12-13 01:47:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:12,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:13,692 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-13 01:47:13,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:13,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803279695] [2022-12-13 01:47:13,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803279695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:13,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:13,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:47:13,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388027254] [2022-12-13 01:47:13,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:13,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:47:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:13,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:47:13,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:47:13,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:47:13,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 76 transitions, 822 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:13,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:13,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:47:13,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:14,311 INFO L130 PetriNetUnfolder]: 863/1854 cut-off events. [2022-12-13 01:47:14,311 INFO L131 PetriNetUnfolder]: For 14089/14089 co-relation queries the response was YES. [2022-12-13 01:47:14,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9229 conditions, 1854 events. 863/1854 cut-off events. For 14089/14089 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12283 event pairs, 280 based on Foata normal form. 2/1856 useless extension candidates. Maximal degree in co-relation 9166. Up to 958 conditions per place. [2022-12-13 01:47:14,319 INFO L137 encePairwiseOnDemand]: 31/45 looper letters, 153 selfloop transitions, 19 changer transitions 25/197 dead transitions. [2022-12-13 01:47:14,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 197 transitions, 2119 flow [2022-12-13 01:47:14,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:47:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:47:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2022-12-13 01:47:14,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2022-12-13 01:47:14,319 INFO L175 Difference]: Start difference. First operand has 103 places, 76 transitions, 822 flow. Second operand 11 states and 170 transitions. [2022-12-13 01:47:14,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 197 transitions, 2119 flow [2022-12-13 01:47:14,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 197 transitions, 2069 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-12-13 01:47:14,336 INFO L231 Difference]: Finished difference. Result has 113 places, 85 transitions, 997 flow [2022-12-13 01:47:14,336 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=997, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2022-12-13 01:47:14,337 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2022-12-13 01:47:14,337 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:14,337 INFO L89 Accepts]: Start accepts. Operand has 113 places, 85 transitions, 997 flow [2022-12-13 01:47:14,337 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:14,337 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:14,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 85 transitions, 997 flow [2022-12-13 01:47:14,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 85 transitions, 997 flow [2022-12-13 01:47:14,367 INFO L130 PetriNetUnfolder]: 48/450 cut-off events. [2022-12-13 01:47:14,367 INFO L131 PetriNetUnfolder]: For 2789/2808 co-relation queries the response was YES. [2022-12-13 01:47:14,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 450 events. 48/450 cut-off events. For 2789/2808 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3711 event pairs, 6 based on Foata normal form. 13/439 useless extension candidates. Maximal degree in co-relation 1895. Up to 72 conditions per place. [2022-12-13 01:47:14,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 85 transitions, 997 flow [2022-12-13 01:47:14,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-13 01:47:14,406 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:47:14,407 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 01:47:14,407 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 85 transitions, 1007 flow [2022-12-13 01:47:14,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:14,407 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:14,407 INFO L214 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] [2022-12-13 01:47:14,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2022-12-13 01:47:14,407 INFO L420 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1112472783, now seen corresponding path program 3 times [2022-12-13 01:47:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:14,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796298429] [2022-12-13 01:47:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:15,613 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-13 01:47:15,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:15,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796298429] [2022-12-13 01:47:15,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796298429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:15,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:15,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 01:47:15,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564758825] [2022-12-13 01:47:15,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:15,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 01:47:15,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:15,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 01:47:15,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 01:47:15,614 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:47:15,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 85 transitions, 1007 flow. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:15,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:15,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:47:15,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:16,212 INFO L130 PetriNetUnfolder]: 821/1780 cut-off events. [2022-12-13 01:47:16,212 INFO L131 PetriNetUnfolder]: For 16019/16019 co-relation queries the response was YES. [2022-12-13 01:47:16,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9323 conditions, 1780 events. 821/1780 cut-off events. For 16019/16019 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11835 event pairs, 290 based on Foata normal form. 4/1784 useless extension candidates. Maximal degree in co-relation 9263. Up to 958 conditions per place. [2022-12-13 01:47:16,221 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 127 selfloop transitions, 13 changer transitions 43/183 dead transitions. [2022-12-13 01:47:16,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 183 transitions, 2058 flow [2022-12-13 01:47:16,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:47:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:47:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2022-12-13 01:47:16,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33695652173913043 [2022-12-13 01:47:16,222 INFO L175 Difference]: Start difference. First operand has 112 places, 85 transitions, 1007 flow. Second operand 10 states and 155 transitions. [2022-12-13 01:47:16,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 183 transitions, 2058 flow [2022-12-13 01:47:16,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 183 transitions, 1986 flow, removed 25 selfloop flow, removed 6 redundant places. [2022-12-13 01:47:16,247 INFO L231 Difference]: Finished difference. Result has 117 places, 79 transitions, 881 flow [2022-12-13 01:47:16,247 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=881, PETRI_PLACES=117, PETRI_TRANSITIONS=79} [2022-12-13 01:47:16,247 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2022-12-13 01:47:16,247 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:16,247 INFO L89 Accepts]: Start accepts. Operand has 117 places, 79 transitions, 881 flow [2022-12-13 01:47:16,248 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:16,248 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:16,248 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 79 transitions, 881 flow [2022-12-13 01:47:16,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 79 transitions, 881 flow [2022-12-13 01:47:16,274 INFO L130 PetriNetUnfolder]: 42/397 cut-off events. [2022-12-13 01:47:16,275 INFO L131 PetriNetUnfolder]: For 2382/2397 co-relation queries the response was YES. [2022-12-13 01:47:16,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 397 events. 42/397 cut-off events. For 2382/2397 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3192 event pairs, 4 based on Foata normal form. 11/387 useless extension candidates. Maximal degree in co-relation 1679. Up to 60 conditions per place. [2022-12-13 01:47:16,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 79 transitions, 881 flow [2022-12-13 01:47:16,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 420 [2022-12-13 01:47:16,280 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:47:16,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 01:47:16,281 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 79 transitions, 881 flow [2022-12-13 01:47:16,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:16,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:16,281 INFO L214 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] [2022-12-13 01:47:16,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2022-12-13 01:47:16,281 INFO L420 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1188446129, now seen corresponding path program 4 times [2022-12-13 01:47:16,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:16,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912333932] [2022-12-13 01:47:16,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:16,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:17,065 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-13 01:47:17,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:17,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912333932] [2022-12-13 01:47:17,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912333932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:17,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:17,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:47:17,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400413601] [2022-12-13 01:47:17,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:17,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:47:17,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:17,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:47:17,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:47:17,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:47:17,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 79 transitions, 881 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:17,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:17,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:47:17,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:17,537 INFO L130 PetriNetUnfolder]: 730/1587 cut-off events. [2022-12-13 01:47:17,537 INFO L131 PetriNetUnfolder]: For 13139/13139 co-relation queries the response was YES. [2022-12-13 01:47:17,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8172 conditions, 1587 events. 730/1587 cut-off events. For 13139/13139 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10164 event pairs, 250 based on Foata normal form. 2/1589 useless extension candidates. Maximal degree in co-relation 8115. Up to 777 conditions per place. [2022-12-13 01:47:17,544 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 105 selfloop transitions, 13 changer transitions 58/176 dead transitions. [2022-12-13 01:47:17,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 176 transitions, 1899 flow [2022-12-13 01:47:17,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:47:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:47:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2022-12-13 01:47:17,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2022-12-13 01:47:17,545 INFO L175 Difference]: Start difference. First operand has 111 places, 79 transitions, 881 flow. Second operand 10 states and 155 transitions. [2022-12-13 01:47:17,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 176 transitions, 1899 flow [2022-12-13 01:47:17,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 176 transitions, 1859 flow, removed 7 selfloop flow, removed 10 redundant places. [2022-12-13 01:47:17,565 INFO L231 Difference]: Finished difference. Result has 113 places, 74 transitions, 805 flow [2022-12-13 01:47:17,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=805, PETRI_PLACES=113, PETRI_TRANSITIONS=74} [2022-12-13 01:47:17,565 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2022-12-13 01:47:17,565 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:17,565 INFO L89 Accepts]: Start accepts. Operand has 113 places, 74 transitions, 805 flow [2022-12-13 01:47:17,566 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:17,566 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:17,566 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 74 transitions, 805 flow [2022-12-13 01:47:17,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 74 transitions, 805 flow [2022-12-13 01:47:17,588 INFO L130 PetriNetUnfolder]: 38/323 cut-off events. [2022-12-13 01:47:17,588 INFO L131 PetriNetUnfolder]: For 1851/1863 co-relation queries the response was YES. [2022-12-13 01:47:17,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 323 events. 38/323 cut-off events. For 1851/1863 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2311 event pairs, 3 based on Foata normal form. 10/318 useless extension candidates. Maximal degree in co-relation 1388. Up to 48 conditions per place. [2022-12-13 01:47:17,590 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 74 transitions, 805 flow [2022-12-13 01:47:17,590 INFO L226 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-13 01:47:17,591 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:47:17,591 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 01:47:17,591 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 74 transitions, 805 flow [2022-12-13 01:47:17,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:17,591 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:17,592 INFO L214 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] [2022-12-13 01:47:17,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2022-12-13 01:47:17,592 INFO L420 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:17,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1140840162, now seen corresponding path program 1 times [2022-12-13 01:47:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:17,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624440992] [2022-12-13 01:47:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:18,437 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-13 01:47:18,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:18,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624440992] [2022-12-13 01:47:18,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624440992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:18,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:18,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:47:18,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322738509] [2022-12-13 01:47:18,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:18,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:47:18,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:18,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:47:18,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:47:18,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:47:18,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 74 transitions, 805 flow. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:18,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:18,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:47:18,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:18,900 INFO L130 PetriNetUnfolder]: 561/1199 cut-off events. [2022-12-13 01:47:18,900 INFO L131 PetriNetUnfolder]: For 9567/9567 co-relation queries the response was YES. [2022-12-13 01:47:18,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6319 conditions, 1199 events. 561/1199 cut-off events. For 9567/9567 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6973 event pairs, 249 based on Foata normal form. 2/1201 useless extension candidates. Maximal degree in co-relation 6269. Up to 958 conditions per place. [2022-12-13 01:47:18,908 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 71 selfloop transitions, 6 changer transitions 46/123 dead transitions. [2022-12-13 01:47:18,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 123 transitions, 1392 flow [2022-12-13 01:47:18,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:47:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:47:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2022-12-13 01:47:18,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2288888888888889 [2022-12-13 01:47:18,909 INFO L175 Difference]: Start difference. First operand has 106 places, 74 transitions, 805 flow. Second operand 10 states and 103 transitions. [2022-12-13 01:47:18,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 123 transitions, 1392 flow [2022-12-13 01:47:18,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 123 transitions, 1326 flow, removed 22 selfloop flow, removed 11 redundant places. [2022-12-13 01:47:18,924 INFO L231 Difference]: Finished difference. Result has 108 places, 70 transitions, 724 flow [2022-12-13 01:47:18,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=724, PETRI_PLACES=108, PETRI_TRANSITIONS=70} [2022-12-13 01:47:18,925 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 01:47:18,925 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:18,925 INFO L89 Accepts]: Start accepts. Operand has 108 places, 70 transitions, 724 flow [2022-12-13 01:47:18,925 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:18,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:18,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 70 transitions, 724 flow [2022-12-13 01:47:18,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 70 transitions, 724 flow [2022-12-13 01:47:18,944 INFO L130 PetriNetUnfolder]: 35/269 cut-off events. [2022-12-13 01:47:18,944 INFO L131 PetriNetUnfolder]: For 1289/1297 co-relation queries the response was YES. [2022-12-13 01:47:18,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 269 events. 35/269 cut-off events. For 1289/1297 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1851 event pairs, 3 based on Foata normal form. 7/264 useless extension candidates. Maximal degree in co-relation 1112. Up to 40 conditions per place. [2022-12-13 01:47:18,946 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 70 transitions, 724 flow [2022-12-13 01:47:18,947 INFO L226 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-13 01:47:26,003 WARN L233 SmtUtils]: Spent 7.05s on a formula simplification. DAG size of input: 225 DAG size of output: 223 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:47:36,388 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 231 DAG size of output: 229 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:47:39,073 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:47:39,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20148 [2022-12-13 01:47:39,073 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 69 transitions, 718 flow [2022-12-13 01:47:39,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:39,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:39,073 INFO L214 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] [2022-12-13 01:47:39,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2022-12-13 01:47:39,074 INFO L420 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:39,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash 511155691, now seen corresponding path program 1 times [2022-12-13 01:47:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:39,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496534602] [2022-12-13 01:47:39,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:39,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:44,089 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-13 01:47:44,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:44,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496534602] [2022-12-13 01:47:44,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496534602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:44,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:44,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:47:44,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887821185] [2022-12-13 01:47:44,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:44,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:47:44,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:44,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:47:44,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:47:44,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:47:44,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 69 transitions, 718 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:44,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:44,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:47:44,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:44,570 INFO L130 PetriNetUnfolder]: 995/2100 cut-off events. [2022-12-13 01:47:44,571 INFO L131 PetriNetUnfolder]: For 14461/14461 co-relation queries the response was YES. [2022-12-13 01:47:44,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10607 conditions, 2100 events. 995/2100 cut-off events. For 14461/14461 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14119 event pairs, 345 based on Foata normal form. 3/2103 useless extension candidates. Maximal degree in co-relation 10546. Up to 958 conditions per place. [2022-12-13 01:47:44,581 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 141 selfloop transitions, 16 changer transitions 30/187 dead transitions. [2022-12-13 01:47:44,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 187 transitions, 2056 flow [2022-12-13 01:47:44,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:47:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:47:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2022-12-13 01:47:44,582 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38765432098765434 [2022-12-13 01:47:44,582 INFO L175 Difference]: Start difference. First operand has 98 places, 69 transitions, 718 flow. Second operand 9 states and 157 transitions. [2022-12-13 01:47:44,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 187 transitions, 2056 flow [2022-12-13 01:47:44,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 187 transitions, 1966 flow, removed 22 selfloop flow, removed 11 redundant places. [2022-12-13 01:47:44,603 INFO L231 Difference]: Finished difference. Result has 100 places, 80 transitions, 879 flow [2022-12-13 01:47:44,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=879, PETRI_PLACES=100, PETRI_TRANSITIONS=80} [2022-12-13 01:47:44,603 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2022-12-13 01:47:44,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:44,603 INFO L89 Accepts]: Start accepts. Operand has 100 places, 80 transitions, 879 flow [2022-12-13 01:47:44,604 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:44,604 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:44,604 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 80 transitions, 879 flow [2022-12-13 01:47:44,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 80 transitions, 879 flow [2022-12-13 01:47:44,636 INFO L130 PetriNetUnfolder]: 61/519 cut-off events. [2022-12-13 01:47:44,636 INFO L131 PetriNetUnfolder]: For 2502/2515 co-relation queries the response was YES. [2022-12-13 01:47:44,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 519 events. 61/519 cut-off events. For 2502/2515 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4510 event pairs, 6 based on Foata normal form. 11/504 useless extension candidates. Maximal degree in co-relation 2072. Up to 77 conditions per place. [2022-12-13 01:47:44,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 80 transitions, 879 flow [2022-12-13 01:47:44,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-13 01:47:44,782 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:47:44,782 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-13 01:47:44,783 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 79 transitions, 895 flow [2022-12-13 01:47:44,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:47:44,783 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:44,783 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:47:44,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2022-12-13 01:47:44,783 INFO L420 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:44,783 INFO L85 PathProgramCache]: Analyzing trace with hash 253633319, now seen corresponding path program 1 times [2022-12-13 01:47:44,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:44,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704670749] [2022-12-13 01:47:44,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:44,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:45,692 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-13 01:47:45,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:45,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704670749] [2022-12-13 01:47:45,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704670749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:45,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:45,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:47:45,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906040298] [2022-12-13 01:47:45,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:45,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:47:45,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:45,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:47:45,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:47:45,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 01:47:45,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 79 transitions, 895 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:47:45,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:45,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 01:47:45,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:46,241 INFO L130 PetriNetUnfolder]: 937/2000 cut-off events. [2022-12-13 01:47:46,241 INFO L131 PetriNetUnfolder]: For 15152/15152 co-relation queries the response was YES. [2022-12-13 01:47:46,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10071 conditions, 2000 events. 937/2000 cut-off events. For 15152/15152 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13449 event pairs, 373 based on Foata normal form. 2/2002 useless extension candidates. Maximal degree in co-relation 10013. Up to 958 conditions per place. [2022-12-13 01:47:46,251 INFO L137 encePairwiseOnDemand]: 35/48 looper letters, 137 selfloop transitions, 17 changer transitions 27/181 dead transitions. [2022-12-13 01:47:46,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 181 transitions, 2003 flow [2022-12-13 01:47:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:47:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:47:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2022-12-13 01:47:46,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35648148148148145 [2022-12-13 01:47:46,252 INFO L175 Difference]: Start difference. First operand has 98 places, 79 transitions, 895 flow. Second operand 9 states and 154 transitions. [2022-12-13 01:47:46,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 181 transitions, 2003 flow [2022-12-13 01:47:46,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 181 transitions, 1987 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 01:47:46,271 INFO L231 Difference]: Finished difference. Result has 109 places, 82 transitions, 938 flow [2022-12-13 01:47:46,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=938, PETRI_PLACES=109, PETRI_TRANSITIONS=82} [2022-12-13 01:47:46,272 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2022-12-13 01:47:46,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:46,272 INFO L89 Accepts]: Start accepts. Operand has 109 places, 82 transitions, 938 flow [2022-12-13 01:47:46,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:46,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:46,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 82 transitions, 938 flow [2022-12-13 01:47:46,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 82 transitions, 938 flow [2022-12-13 01:47:46,304 INFO L130 PetriNetUnfolder]: 59/494 cut-off events. [2022-12-13 01:47:46,305 INFO L131 PetriNetUnfolder]: For 2820/2843 co-relation queries the response was YES. [2022-12-13 01:47:46,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2091 conditions, 494 events. 59/494 cut-off events. For 2820/2843 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4156 event pairs, 7 based on Foata normal form. 11/482 useless extension candidates. Maximal degree in co-relation 2038. Up to 78 conditions per place. [2022-12-13 01:47:46,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 82 transitions, 938 flow [2022-12-13 01:47:46,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 420 [2022-12-13 01:47:46,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [722] $Ultimate##0-->L88: Formula: (and (= v_~e1~0_158 1) (= v_~e2~0_189 1) (= v_~n2~0_240 v_~tmp1~0_143) (= v_~tmp2~0_144 v_~n1~0_262)) InVars {~n2~0=v_~n2~0_240, ~n1~0=v_~n1~0_262} OutVars{~n2~0=v_~n2~0_240, ~n1~0=v_~n1~0_262, ~tmp2~0=v_~tmp2~0_144, ~e2~0=v_~e2~0_189, ~tmp1~0=v_~tmp1~0_143, ~e1~0=v_~e1~0_158} AuxVars[] AssignedVars[~tmp2~0, ~e2~0, ~tmp1~0, ~e1~0] and [710] L53-->L97: Formula: (and (= v_~e2~0_167 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|) (= (+ v_~tmp1~0_123 1) v_~n1~0_225) (= v_~e1~0_133 0) (= (+ v_~tmp2~0_121 1) v_~n2~0_206) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77| (ite (= (mod v_~e1~0_133 256) 0) 1 0))) InVars {~tmp2~0=v_~tmp2~0_121, ~tmp1~0=v_~tmp1~0_123} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_77|, ~n2~0=v_~n2~0_206, ~n1~0=v_~n1~0_225, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_77|, ~tmp2~0=v_~tmp2~0_121, ~e2~0=v_~e2~0_167, ~tmp1~0=v_~tmp1~0_123, ~e1~0=v_~e1~0_133} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0, ~e1~0] [2022-12-13 01:47:46,364 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:47:46,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 01:47:46,365 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 82 transitions, 944 flow [2022-12-13 01:47:46,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:47:46,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:46,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:47:46,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2022-12-13 01:47:46,365 INFO L420 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:46,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:46,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1647184531, now seen corresponding path program 1 times [2022-12-13 01:47:46,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:46,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979357494] [2022-12-13 01:47:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:47,180 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-13 01:47:47,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:47,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979357494] [2022-12-13 01:47:47,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979357494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:47,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:47,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:47:47,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724401581] [2022-12-13 01:47:47,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:47,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:47:47,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:47,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:47:47,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:47:47,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:47:47,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 82 transitions, 944 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:47:47,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:47,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:47:47,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:47,691 INFO L130 PetriNetUnfolder]: 903/1924 cut-off events. [2022-12-13 01:47:47,691 INFO L131 PetriNetUnfolder]: For 15432/15432 co-relation queries the response was YES. [2022-12-13 01:47:47,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9714 conditions, 1924 events. 903/1924 cut-off events. For 15432/15432 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12874 event pairs, 342 based on Foata normal form. 2/1926 useless extension candidates. Maximal degree in co-relation 9652. Up to 958 conditions per place. [2022-12-13 01:47:47,701 INFO L137 encePairwiseOnDemand]: 36/47 looper letters, 129 selfloop transitions, 14 changer transitions 38/181 dead transitions. [2022-12-13 01:47:47,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 181 transitions, 2009 flow [2022-12-13 01:47:47,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:47:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:47:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2022-12-13 01:47:47,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3640661938534279 [2022-12-13 01:47:47,702 INFO L175 Difference]: Start difference. First operand has 107 places, 82 transitions, 944 flow. Second operand 9 states and 154 transitions. [2022-12-13 01:47:47,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 181 transitions, 2009 flow [2022-12-13 01:47:47,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 181 transitions, 1976 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 01:47:47,723 INFO L231 Difference]: Finished difference. Result has 113 places, 82 transitions, 946 flow [2022-12-13 01:47:47,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=946, PETRI_PLACES=113, PETRI_TRANSITIONS=82} [2022-12-13 01:47:47,723 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2022-12-13 01:47:47,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:47,723 INFO L89 Accepts]: Start accepts. Operand has 113 places, 82 transitions, 946 flow [2022-12-13 01:47:47,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:47,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:47,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 82 transitions, 946 flow [2022-12-13 01:47:47,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 82 transitions, 946 flow [2022-12-13 01:47:47,754 INFO L130 PetriNetUnfolder]: 55/457 cut-off events. [2022-12-13 01:47:47,754 INFO L131 PetriNetUnfolder]: For 2665/2688 co-relation queries the response was YES. [2022-12-13 01:47:47,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 457 events. 55/457 cut-off events. For 2665/2688 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3786 event pairs, 7 based on Foata normal form. 11/447 useless extension candidates. Maximal degree in co-relation 1898. Up to 77 conditions per place. [2022-12-13 01:47:47,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 82 transitions, 946 flow [2022-12-13 01:47:47,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 420 [2022-12-13 01:47:47,762 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [740] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|) (not (= (ite (= (mod v_~e2~0_229 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (or (<= v_~n1~0_313 v_~n2~0_285) (= v_~n2~0_285 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140| 0)) (= v_~i~0_491 (select (select |v_#memory_int_367| v_~f~0.base_290) (+ v_~f~0.offset_297 (* v_~i1~0_227 4)))) (= v_~i1~0_227 v_~i~0_492)) InVars {~n2~0=v_~n2~0_285, ~i~0=v_~i~0_492, ~f~0.base=v_~f~0.base_290, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229} OutVars{~n2~0=v_~n2~0_285, ~i~0=v_~i~0_491, ~f~0.base=v_~f~0.base_290, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, ~n1~0=v_~n1~0_313, #memory_int=|v_#memory_int_367|, ~i1~0=v_~i1~0_227, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_144|, ~f~0.offset=v_~f~0.offset_297, ~e2~0=v_~e2~0_229, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_140|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 01:47:47,829 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [579] L53-->L59: Formula: (and (= v_~e1~0_17 0) (= v_~n1~0_41 (+ v_~tmp1~0_7 1))) InVars {~tmp1~0=v_~tmp1~0_7} OutVars{~n1~0=v_~n1~0_41, ~tmp1~0=v_~tmp1~0_7, ~e1~0=v_~e1~0_17} AuxVars[] AssignedVars[~n1~0, ~e1~0] and [734] L71-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_129| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_32| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_32| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129| (ite (and (< v_~i~0_473 v_~n~0_185) (<= 0 v_~i~0_473)) 1 0)) (= v_~n1~0_301 0)) InVars {~i~0=v_~i~0_473, ~n~0=v_~n~0_185} OutVars{~i~0=v_~i~0_473, ~n1~0=v_~n1~0_301, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_129|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_32|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_32|, ~n~0=v_~n~0_185, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_129|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:47:47,964 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:47:47,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-13 01:47:47,965 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 82 transitions, 990 flow [2022-12-13 01:47:47,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:47:47,965 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:47,965 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:47:47,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2022-12-13 01:47:47,965 INFO L420 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:47,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1690132830, now seen corresponding path program 1 times [2022-12-13 01:47:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:47,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709115028] [2022-12-13 01:47:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:47,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:48,724 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-13 01:47:48,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:48,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709115028] [2022-12-13 01:47:48,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709115028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:48,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:48,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:47:48,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741924492] [2022-12-13 01:47:48,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:48,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:47:48,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:48,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:47:48,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:47:48,726 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:47:48,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 82 transitions, 990 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:47:48,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:48,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:47:48,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:49,222 INFO L130 PetriNetUnfolder]: 874/1917 cut-off events. [2022-12-13 01:47:49,222 INFO L131 PetriNetUnfolder]: For 17126/17126 co-relation queries the response was YES. [2022-12-13 01:47:49,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9831 conditions, 1917 events. 874/1917 cut-off events. For 17126/17126 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12869 event pairs, 412 based on Foata normal form. 6/1923 useless extension candidates. Maximal degree in co-relation 9771. Up to 860 conditions per place. [2022-12-13 01:47:49,232 INFO L137 encePairwiseOnDemand]: 33/49 looper letters, 119 selfloop transitions, 13 changer transitions 81/213 dead transitions. [2022-12-13 01:47:49,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 213 transitions, 2336 flow [2022-12-13 01:47:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 01:47:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 01:47:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 189 transitions. [2022-12-13 01:47:49,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2571428571428571 [2022-12-13 01:47:49,233 INFO L175 Difference]: Start difference. First operand has 110 places, 82 transitions, 990 flow. Second operand 15 states and 189 transitions. [2022-12-13 01:47:49,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 213 transitions, 2336 flow [2022-12-13 01:47:49,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 213 transitions, 2268 flow, removed 14 selfloop flow, removed 10 redundant places. [2022-12-13 01:47:49,256 INFO L231 Difference]: Finished difference. Result has 124 places, 78 transitions, 906 flow [2022-12-13 01:47:49,256 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=906, PETRI_PLACES=124, PETRI_TRANSITIONS=78} [2022-12-13 01:47:49,256 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places. [2022-12-13 01:47:49,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:49,257 INFO L89 Accepts]: Start accepts. Operand has 124 places, 78 transitions, 906 flow [2022-12-13 01:47:49,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:49,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:49,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 78 transitions, 906 flow [2022-12-13 01:47:49,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 78 transitions, 906 flow [2022-12-13 01:47:49,285 INFO L130 PetriNetUnfolder]: 49/392 cut-off events. [2022-12-13 01:47:49,285 INFO L131 PetriNetUnfolder]: For 2687/2705 co-relation queries the response was YES. [2022-12-13 01:47:49,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 392 events. 49/392 cut-off events. For 2687/2705 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3058 event pairs, 13 based on Foata normal form. 12/386 useless extension candidates. Maximal degree in co-relation 1699. Up to 63 conditions per place. [2022-12-13 01:47:49,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 78 transitions, 906 flow [2022-12-13 01:47:49,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-13 01:47:49,291 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:47:49,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 01:47:49,291 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 78 transitions, 906 flow [2022-12-13 01:47:49,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:47:49,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:49,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:47:49,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2022-12-13 01:47:49,292 INFO L420 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 440858084, now seen corresponding path program 1 times [2022-12-13 01:47:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:49,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715895944] [2022-12-13 01:47:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:50,319 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-13 01:47:50,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:50,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715895944] [2022-12-13 01:47:50,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715895944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:50,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:50,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:47:50,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975126547] [2022-12-13 01:47:50,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:50,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:47:50,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:50,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:47:50,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:47:50,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 01:47:50,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 78 transitions, 906 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:47:50,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:50,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 01:47:50,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:50,853 INFO L130 PetriNetUnfolder]: 729/1586 cut-off events. [2022-12-13 01:47:50,853 INFO L131 PetriNetUnfolder]: For 14894/14894 co-relation queries the response was YES. [2022-12-13 01:47:50,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8458 conditions, 1586 events. 729/1586 cut-off events. For 14894/14894 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10142 event pairs, 328 based on Foata normal form. 2/1588 useless extension candidates. Maximal degree in co-relation 8376. Up to 905 conditions per place. [2022-12-13 01:47:50,861 INFO L137 encePairwiseOnDemand]: 33/47 looper letters, 151 selfloop transitions, 20 changer transitions 15/186 dead transitions. [2022-12-13 01:47:50,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 186 transitions, 2095 flow [2022-12-13 01:47:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:47:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:47:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2022-12-13 01:47:50,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30947775628626695 [2022-12-13 01:47:50,862 INFO L175 Difference]: Start difference. First operand has 114 places, 78 transitions, 906 flow. Second operand 11 states and 160 transitions. [2022-12-13 01:47:50,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 186 transitions, 2095 flow [2022-12-13 01:47:50,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 186 transitions, 1966 flow, removed 56 selfloop flow, removed 14 redundant places. [2022-12-13 01:47:50,885 INFO L231 Difference]: Finished difference. Result has 116 places, 87 transitions, 1037 flow [2022-12-13 01:47:50,886 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1037, PETRI_PLACES=116, PETRI_TRANSITIONS=87} [2022-12-13 01:47:50,886 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2022-12-13 01:47:50,886 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:50,886 INFO L89 Accepts]: Start accepts. Operand has 116 places, 87 transitions, 1037 flow [2022-12-13 01:47:50,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:50,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:50,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 87 transitions, 1037 flow [2022-12-13 01:47:50,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 87 transitions, 1037 flow [2022-12-13 01:47:50,917 INFO L130 PetriNetUnfolder]: 45/405 cut-off events. [2022-12-13 01:47:50,917 INFO L131 PetriNetUnfolder]: For 2540/2561 co-relation queries the response was YES. [2022-12-13 01:47:50,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 405 events. 45/405 cut-off events. For 2540/2561 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3189 event pairs, 8 based on Foata normal form. 13/401 useless extension candidates. Maximal degree in co-relation 1686. Up to 62 conditions per place. [2022-12-13 01:47:50,920 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 87 transitions, 1037 flow [2022-12-13 01:47:50,920 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 01:47:50,932 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [939] L59-->L154-3: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_738| (ite (or (<= v_~n1~0_1220 v_~n2~0_1360) (= v_~n2~0_1360 0)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_738| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_738|) (= v_~i1~0_795 v_~i~0_2214) (= (store |v_#memory_int_1332| |v_ULTIMATE.start_main_~#t2~0#1.base_187| (store (select |v_#memory_int_1332| |v_ULTIMATE.start_main_~#t2~0#1.base_187|) |v_ULTIMATE.start_main_~#t2~0#1.offset_101| |v_ULTIMATE.start_main_#t~pre15#1_166|)) |v_#memory_int_1331|) (= (select (select |v_#memory_int_1332| v_~f~0.base_1191) (+ v_~f~0.offset_1197 (* v_~i1~0_795 4))) v_~i~0_2213) (not (= (ite (= (mod v_~e2~0_1136 256) 0) 1 0) 0)) (= |v_#pthreadsForks_307| |v_ULTIMATE.start_main_#t~pre15#1_166|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_738| 0)) (= (+ |v_#pthreadsForks_307| 1) |v_#pthreadsForks_306|)) InVars {#pthreadsForks=|v_#pthreadsForks_307|, ~n2~0=v_~n2~0_1360, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_101|, ~i~0=v_~i~0_2214, ~f~0.base=v_~f~0.base_1191, ~n1~0=v_~n1~0_1220, #memory_int=|v_#memory_int_1332|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_187|, ~f~0.offset=v_~f~0.offset_1197, ~e2~0=v_~e2~0_1136} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_141|, ~n2~0=v_~n2~0_1360, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_101|, ~i~0=v_~i~0_2213, ~f~0.base=v_~f~0.base_1191, ~n1~0=v_~n1~0_1220, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_166|, ~i1~0=v_~i1~0_795, ~f~0.offset=v_~f~0.offset_1197, ~e2~0=v_~e2~0_1136, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_93|, #pthreadsForks=|v_#pthreadsForks_306|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_738|, #memory_int=|v_#memory_int_1331|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_690|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_187|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_738|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, ~i~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre15#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, ULTIMATE.start_main_#t~nondet14#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [506] L71-->L74: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= (ite (and (<= 0 v_~i~0_32) (< v_~i~0_32 v_~n~0_22)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~n~0=v_~n~0_22, ~i~0=v_~i~0_32} OutVars{~n~0=v_~n~0_22, ~i~0=v_~i~0_32, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:47:51,065 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:47:51,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 180 [2022-12-13 01:47:51,066 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 87 transitions, 1068 flow [2022-12-13 01:47:51,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:47:51,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:51,066 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:47:51,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2022-12-13 01:47:51,066 INFO L420 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash 590551560, now seen corresponding path program 1 times [2022-12-13 01:47:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:51,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712638720] [2022-12-13 01:47:51,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:51,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:52,008 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-13 01:47:52,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:52,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712638720] [2022-12-13 01:47:52,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712638720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:52,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:52,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:47:52,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551104735] [2022-12-13 01:47:52,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:52,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:47:52,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:52,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:47:52,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:47:52,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:47:52,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 87 transitions, 1068 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:47:52,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:52,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:47:52,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:52,460 INFO L130 PetriNetUnfolder]: 703/1528 cut-off events. [2022-12-13 01:47:52,460 INFO L131 PetriNetUnfolder]: For 14584/14584 co-relation queries the response was YES. [2022-12-13 01:47:52,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8145 conditions, 1528 events. 703/1528 cut-off events. For 14584/14584 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9741 event pairs, 333 based on Foata normal form. 2/1530 useless extension candidates. Maximal degree in co-relation 8083. Up to 905 conditions per place. [2022-12-13 01:47:52,468 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 129 selfloop transitions, 18 changer transitions 25/172 dead transitions. [2022-12-13 01:47:52,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 172 transitions, 1990 flow [2022-12-13 01:47:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:47:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:47:52,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-12-13 01:47:52,468 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3287981859410431 [2022-12-13 01:47:52,468 INFO L175 Difference]: Start difference. First operand has 115 places, 87 transitions, 1068 flow. Second operand 9 states and 145 transitions. [2022-12-13 01:47:52,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 172 transitions, 1990 flow [2022-12-13 01:47:52,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 172 transitions, 1907 flow, removed 32 selfloop flow, removed 5 redundant places. [2022-12-13 01:47:52,488 INFO L231 Difference]: Finished difference. Result has 119 places, 86 transitions, 1021 flow [2022-12-13 01:47:52,488 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1021, PETRI_PLACES=119, PETRI_TRANSITIONS=86} [2022-12-13 01:47:52,489 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 01:47:52,489 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:52,489 INFO L89 Accepts]: Start accepts. Operand has 119 places, 86 transitions, 1021 flow [2022-12-13 01:47:52,489 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:52,489 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:52,489 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 86 transitions, 1021 flow [2022-12-13 01:47:52,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 86 transitions, 1021 flow [2022-12-13 01:47:52,519 INFO L130 PetriNetUnfolder]: 45/398 cut-off events. [2022-12-13 01:47:52,519 INFO L131 PetriNetUnfolder]: For 2501/2527 co-relation queries the response was YES. [2022-12-13 01:47:52,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 398 events. 45/398 cut-off events. For 2501/2527 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3138 event pairs, 8 based on Foata normal form. 12/393 useless extension candidates. Maximal degree in co-relation 1681. Up to 61 conditions per place. [2022-12-13 01:47:52,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 86 transitions, 1021 flow [2022-12-13 01:47:52,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 434 [2022-12-13 01:47:52,525 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:47:52,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 01:47:52,526 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 86 transitions, 1021 flow [2022-12-13 01:47:52,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:47:52,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:52,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:47:52,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2022-12-13 01:47:52,526 INFO L420 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1881428077, now seen corresponding path program 1 times [2022-12-13 01:47:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:52,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942211192] [2022-12-13 01:47:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:52,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:52,752 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-13 01:47:52,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:52,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942211192] [2022-12-13 01:47:52,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942211192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:52,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:52,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:47:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446678770] [2022-12-13 01:47:52,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:52,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:47:52,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:52,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:47:52,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:47:52,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 01:47:52,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 86 transitions, 1021 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:47:52,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:52,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 01:47:52,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:53,157 INFO L130 PetriNetUnfolder]: 687/1533 cut-off events. [2022-12-13 01:47:53,157 INFO L131 PetriNetUnfolder]: For 12744/12744 co-relation queries the response was YES. [2022-12-13 01:47:53,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7981 conditions, 1533 events. 687/1533 cut-off events. For 12744/12744 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10023 event pairs, 179 based on Foata normal form. 5/1538 useless extension candidates. Maximal degree in co-relation 7922. Up to 499 conditions per place. [2022-12-13 01:47:53,163 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 62 selfloop transitions, 20 changer transitions 51/133 dead transitions. [2022-12-13 01:47:53,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 133 transitions, 1600 flow [2022-12-13 01:47:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:47:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:47:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-12-13 01:47:53,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27040816326530615 [2022-12-13 01:47:53,164 INFO L175 Difference]: Start difference. First operand has 117 places, 86 transitions, 1021 flow. Second operand 8 states and 106 transitions. [2022-12-13 01:47:53,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 133 transitions, 1600 flow [2022-12-13 01:47:53,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 133 transitions, 1562 flow, removed 1 selfloop flow, removed 8 redundant places. [2022-12-13 01:47:53,185 INFO L231 Difference]: Finished difference. Result has 118 places, 63 transitions, 752 flow [2022-12-13 01:47:53,185 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=752, PETRI_PLACES=118, PETRI_TRANSITIONS=63} [2022-12-13 01:47:53,185 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 77 predicate places. [2022-12-13 01:47:53,185 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:53,185 INFO L89 Accepts]: Start accepts. Operand has 118 places, 63 transitions, 752 flow [2022-12-13 01:47:53,186 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:53,186 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:53,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 63 transitions, 752 flow [2022-12-13 01:47:53,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 63 transitions, 752 flow [2022-12-13 01:47:53,202 INFO L130 PetriNetUnfolder]: 21/221 cut-off events. [2022-12-13 01:47:53,202 INFO L131 PetriNetUnfolder]: For 1760/1775 co-relation queries the response was YES. [2022-12-13 01:47:53,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 221 events. 21/221 cut-off events. For 1760/1775 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1367 event pairs, 4 based on Foata normal form. 9/223 useless extension candidates. Maximal degree in co-relation 944. Up to 35 conditions per place. [2022-12-13 01:47:53,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 63 transitions, 752 flow [2022-12-13 01:47:53,203 INFO L226 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-13 01:47:53,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [753] L97-->L103: Formula: (and (= v_~i2~0_219 v_~i~0_537) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_158| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_158| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_158|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_158| (ite (or (= v_~n1~0_349 0) (< v_~n2~0_333 v_~n1~0_349)) 1 0))) InVars {~n2~0=v_~n2~0_333, ~i~0=v_~i~0_537, ~n1~0=v_~n1~0_349} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_158|, ~n2~0=v_~n2~0_333, ~i~0=v_~i~0_537, ~n1~0=v_~n1~0_349, ~i2~0=v_~i2~0_219, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_158|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:47:53,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] $Ultimate##0-->L88: Formula: (and (= v_~e2~0_17 1) (= v_~tmp2~0_5 v_~n1~0_22)) InVars {~n1~0=v_~n1~0_22} OutVars{~n1~0=v_~n1~0_22, ~tmp2~0=v_~tmp2~0_5, ~e2~0=v_~e2~0_17} AuxVars[] AssignedVars[~tmp2~0, ~e2~0] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:47:53,378 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [538] $Ultimate##0-->L88: Formula: (and (= v_~e2~0_17 1) (= v_~tmp2~0_5 v_~n1~0_22)) InVars {~n1~0=v_~n1~0_22} OutVars{~n1~0=v_~n1~0_22, ~tmp2~0=v_~tmp2~0_5, ~e2~0=v_~e2~0_17} AuxVars[] AssignedVars[~tmp2~0, ~e2~0] and [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] [2022-12-13 01:47:53,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [945] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (select |v_#memory_int_1372| v_~f~0.base_1232))) (let ((.cse1 (select .cse0 (+ (* v_~j~0_703 4) v_~f~0.offset_1237)))) (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_104| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|) (= v_~j~0_702 (select .cse0 (+ (* .cse1 4) v_~f~0.offset_1237))) (= v_~e2~0_1178 1) (= (ite (and (<= 0 .cse1) (< .cse1 v_~n~0_770)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|) (= |v_thread3Thread1of1ForFork0_#res#1.offset_100| 0) (= 0 |v_thread3Thread1of1ForFork0_#res#1.base_100|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_104| 0)) (= v_~tmp2~0_808 v_~n1~0_1262)))) InVars {~j~0=v_~j~0_703, ~f~0.base=v_~f~0.base_1232, ~n1~0=v_~n1~0_1262, #memory_int=|v_#memory_int_1372|, ~n~0=v_~n~0_770, ~f~0.offset=v_~f~0.offset_1237} OutVars{~j~0=v_~j~0_702, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_104|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_104|, ~f~0.base=v_~f~0.base_1232, ~n1~0=v_~n1~0_1262, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_100|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_104|, ~f~0.offset=v_~f~0.offset_1237, ~e2~0=v_~e2~0_1178, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_100|, #memory_int=|v_#memory_int_1372|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_102|, ~n~0=v_~n~0_770, ~tmp2~0=v_~tmp2~0_808} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem3#1, thread3Thread1of1ForFork0_#t~mem4#1, ~tmp2~0, ~e2~0] and [758] L88-->L97: Formula: (and (= v_~e2~0_257 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_167| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_167| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_167|) (= (+ v_~tmp2~0_173 1) v_~n2~0_349) (= (ite (= (mod v_~e1~0_201 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_167|)) InVars {~tmp2~0=v_~tmp2~0_173, ~e1~0=v_~e1~0_201} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_167|, ~n2~0=v_~n2~0_349, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_167|, ~tmp2~0=v_~tmp2~0_173, ~e2~0=v_~e2~0_257, ~e1~0=v_~e1~0_201} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] [2022-12-13 01:47:53,521 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [947] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (select |v_#memory_int_1374| v_~f~0.base_1234))) (let ((.cse1 (select .cse0 (+ (* v_~j~0_707 4) v_~f~0.offset_1239)))) (and (= v_~e2~0_1184 1) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|) (= 0 |v_thread3Thread1of1ForFork0_#res#1.base_102|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_106| 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_102| 0) (= v_~j~0_706 (select .cse0 (+ (* .cse1 4) v_~f~0.offset_1239))) (= v_~tmp2~0_812 v_~n1~0_1266) (= (ite (and (<= 0 .cse1) (< .cse1 v_~n~0_772)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|)))) InVars {~j~0=v_~j~0_707, ~f~0.base=v_~f~0.base_1234, ~n1~0=v_~n1~0_1266, #memory_int=|v_#memory_int_1374|, ~n~0=v_~n~0_772, ~f~0.offset=v_~f~0.offset_1239} OutVars{~j~0=v_~j~0_706, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_106|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_106|, ~f~0.base=v_~f~0.base_1234, ~n1~0=v_~n1~0_1266, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_102|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_106|, ~f~0.offset=v_~f~0.offset_1239, ~e2~0=v_~e2~0_1184, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_102|, #memory_int=|v_#memory_int_1374|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_104|, ~n~0=v_~n~0_772, ~tmp2~0=v_~tmp2~0_812} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem3#1, thread3Thread1of1ForFork0_#t~mem4#1, ~tmp2~0, ~e2~0] and [758] L88-->L97: Formula: (and (= v_~e2~0_257 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_167| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_167| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_167|) (= (+ v_~tmp2~0_173 1) v_~n2~0_349) (= (ite (= (mod v_~e1~0_201 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_167|)) InVars {~tmp2~0=v_~tmp2~0_173, ~e1~0=v_~e1~0_201} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_167|, ~n2~0=v_~n2~0_349, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_167|, ~tmp2~0=v_~tmp2~0_173, ~e2~0=v_~e2~0_257, ~e1~0=v_~e1~0_201} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] [2022-12-13 01:47:53,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [949] $Ultimate##0-->L97: Formula: (let ((.cse0 (select |v_#memory_int_1376| v_~f~0.base_1236))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_1241 (* v_~j~0_711 4))))) (and (= v_~j~0_710 (select .cse0 (+ v_~f~0.offset_1241 (* .cse1 4)))) (= (+ v_~tmp2~0_816 1) v_~n2~0_1412) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_104| 0) (= 0 |v_thread3Thread1of1ForFork0_#res#1.base_104|) (= v_~tmp2~0_816 v_~n1~0_1270) (= (ite (= (mod v_~e1~0_914 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_916|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_108| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_108|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_916| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_916|) (= v_~e2~0_1190 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_916| 0)) (= (ite (and (< .cse1 v_~n~0_774) (<= 0 .cse1)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_108|)))) InVars {~j~0=v_~j~0_711, ~f~0.base=v_~f~0.base_1236, ~n1~0=v_~n1~0_1270, #memory_int=|v_#memory_int_1376|, ~n~0=v_~n~0_774, ~f~0.offset=v_~f~0.offset_1241, ~e1~0=v_~e1~0_914} OutVars{~j~0=v_~j~0_710, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_108|, ~n2~0=v_~n2~0_1412, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_108|, ~f~0.base=v_~f~0.base_1236, ~n1~0=v_~n1~0_1270, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_104|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_108|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_916|, ~e2~0=v_~e2~0_1190, ~f~0.offset=v_~f~0.offset_1241, ~e1~0=v_~e1~0_914, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_916|, #memory_int=|v_#memory_int_1376|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_106|, ~tmp2~0=v_~tmp2~0_816, ~n~0=v_~n~0_774} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem3#1, thread3Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~tmp2~0, ~e2~0] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:47:53,670 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [950] $Ultimate##0-->L97: Formula: (let ((.cse0 (select |v_#memory_int_1378| v_~f~0.base_1238))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_1243 (* v_~j~0_715 4))))) (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_918| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_918|) (= v_~e2~0_1194 0) (= v_~tmp2~0_818 v_~n1~0_1272) (= |v_thread3Thread1of1ForFork0_#res#1.offset_106| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|) (= 0 |v_thread3Thread1of1ForFork0_#res#1.base_106|) (= v_~j~0_714 (select .cse0 (+ v_~f~0.offset_1243 (* .cse1 4)))) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_110| 0)) (= (ite (= (mod v_~e1~0_916 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_918|) (= (+ v_~tmp2~0_818 1) v_~n2~0_1414) (= (ite (and (< .cse1 v_~n~0_776) (<= 0 .cse1)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_918| 0))))) InVars {~j~0=v_~j~0_715, ~f~0.base=v_~f~0.base_1238, ~n1~0=v_~n1~0_1272, #memory_int=|v_#memory_int_1378|, ~n~0=v_~n~0_776, ~f~0.offset=v_~f~0.offset_1243, ~e1~0=v_~e1~0_916} OutVars{~j~0=v_~j~0_714, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_110|, ~n2~0=v_~n2~0_1414, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_110|, ~f~0.base=v_~f~0.base_1238, ~n1~0=v_~n1~0_1272, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_106|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_110|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_918|, ~e2~0=v_~e2~0_1194, ~f~0.offset=v_~f~0.offset_1243, ~e1~0=v_~e1~0_916, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_106|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_918|, #memory_int=|v_#memory_int_1378|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_108|, ~tmp2~0=v_~tmp2~0_818, ~n~0=v_~n~0_776} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem3#1, thread3Thread1of1ForFork0_#t~mem4#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~tmp2~0, ~e2~0] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:47:53,747 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 01:47:53,748 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 563 [2022-12-13 01:47:53,748 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 63 transitions, 819 flow [2022-12-13 01:47:53,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:47:53,748 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:53,748 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:47:53,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2022-12-13 01:47:53,748 INFO L420 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:53,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2103641931, now seen corresponding path program 2 times [2022-12-13 01:47:53,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:53,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299927881] [2022-12-13 01:47:53,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:53,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:54,747 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-13 01:47:54,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:54,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299927881] [2022-12-13 01:47:54,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299927881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:54,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:54,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:47:54,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675051863] [2022-12-13 01:47:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:54,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:47:54,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:54,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:47:54,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:47:54,748 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 01:47:54,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 63 transitions, 819 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:47:54,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:54,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 01:47:54,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:55,072 INFO L130 PetriNetUnfolder]: 330/800 cut-off events. [2022-12-13 01:47:55,072 INFO L131 PetriNetUnfolder]: For 8381/8381 co-relation queries the response was YES. [2022-12-13 01:47:55,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4272 conditions, 800 events. 330/800 cut-off events. For 8381/8381 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4610 event pairs, 143 based on Foata normal form. 2/802 useless extension candidates. Maximal degree in co-relation 4214. Up to 279 conditions per place. [2022-12-13 01:47:55,076 INFO L137 encePairwiseOnDemand]: 31/46 looper letters, 91 selfloop transitions, 10 changer transitions 53/154 dead transitions. [2022-12-13 01:47:55,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 154 transitions, 1713 flow [2022-12-13 01:47:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:47:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:47:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2022-12-13 01:47:55,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2022-12-13 01:47:55,077 INFO L175 Difference]: Start difference. First operand has 103 places, 63 transitions, 819 flow. Second operand 11 states and 143 transitions. [2022-12-13 01:47:55,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 154 transitions, 1713 flow [2022-12-13 01:47:55,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 154 transitions, 1476 flow, removed 76 selfloop flow, removed 16 redundant places. [2022-12-13 01:47:55,089 INFO L231 Difference]: Finished difference. Result has 101 places, 56 transitions, 544 flow [2022-12-13 01:47:55,089 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=544, PETRI_PLACES=101, PETRI_TRANSITIONS=56} [2022-12-13 01:47:55,089 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2022-12-13 01:47:55,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:55,089 INFO L89 Accepts]: Start accepts. Operand has 101 places, 56 transitions, 544 flow [2022-12-13 01:47:55,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:55,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:55,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 56 transitions, 544 flow [2022-12-13 01:47:55,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 56 transitions, 544 flow [2022-12-13 01:47:55,103 INFO L130 PetriNetUnfolder]: 16/184 cut-off events. [2022-12-13 01:47:55,103 INFO L131 PetriNetUnfolder]: For 926/938 co-relation queries the response was YES. [2022-12-13 01:47:55,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 184 events. 16/184 cut-off events. For 926/938 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1046 event pairs, 4 based on Foata normal form. 7/186 useless extension candidates. Maximal degree in co-relation 674. Up to 28 conditions per place. [2022-12-13 01:47:55,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 56 transitions, 544 flow [2022-12-13 01:47:55,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-13 01:47:55,107 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:47:55,107 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 01:47:55,107 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 56 transitions, 544 flow [2022-12-13 01:47:55,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:47:55,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:55,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:47:55,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2022-12-13 01:47:55,108 INFO L420 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:55,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:55,108 INFO L85 PathProgramCache]: Analyzing trace with hash 2021276778, now seen corresponding path program 2 times [2022-12-13 01:47:55,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:55,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809563037] [2022-12-13 01:47:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:55,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:56,176 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-13 01:47:56,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:56,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809563037] [2022-12-13 01:47:56,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809563037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:56,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:56,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:47:56,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854259242] [2022-12-13 01:47:56,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:56,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:47:56,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:56,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:47:56,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:47:56,177 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 01:47:56,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 56 transitions, 544 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:47:56,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:56,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 01:47:56,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:56,488 INFO L130 PetriNetUnfolder]: 243/591 cut-off events. [2022-12-13 01:47:56,488 INFO L131 PetriNetUnfolder]: For 3559/3559 co-relation queries the response was YES. [2022-12-13 01:47:56,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 591 events. 243/591 cut-off events. For 3559/3559 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3015 event pairs, 111 based on Foata normal form. 2/593 useless extension candidates. Maximal degree in co-relation 2749. Up to 354 conditions per place. [2022-12-13 01:47:56,490 INFO L137 encePairwiseOnDemand]: 30/41 looper letters, 74 selfloop transitions, 7 changer transitions 38/119 dead transitions. [2022-12-13 01:47:56,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 119 transitions, 1162 flow [2022-12-13 01:47:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:47:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:47:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-12-13 01:47:56,491 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3035230352303523 [2022-12-13 01:47:56,491 INFO L175 Difference]: Start difference. First operand has 93 places, 56 transitions, 544 flow. Second operand 9 states and 112 transitions. [2022-12-13 01:47:56,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 119 transitions, 1162 flow [2022-12-13 01:47:56,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 119 transitions, 1105 flow, removed 22 selfloop flow, removed 10 redundant places. [2022-12-13 01:47:56,498 INFO L231 Difference]: Finished difference. Result has 94 places, 53 transitions, 486 flow [2022-12-13 01:47:56,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=486, PETRI_PLACES=94, PETRI_TRANSITIONS=53} [2022-12-13 01:47:56,498 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2022-12-13 01:47:56,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:56,498 INFO L89 Accepts]: Start accepts. Operand has 94 places, 53 transitions, 486 flow [2022-12-13 01:47:56,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:56,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:56,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 53 transitions, 486 flow [2022-12-13 01:47:56,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 53 transitions, 486 flow [2022-12-13 01:47:56,510 INFO L130 PetriNetUnfolder]: 14/159 cut-off events. [2022-12-13 01:47:56,510 INFO L131 PetriNetUnfolder]: For 661/670 co-relation queries the response was YES. [2022-12-13 01:47:56,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 159 events. 14/159 cut-off events. For 661/670 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 814 event pairs, 4 based on Foata normal form. 6/158 useless extension candidates. Maximal degree in co-relation 563. Up to 23 conditions per place. [2022-12-13 01:47:56,511 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 53 transitions, 486 flow [2022-12-13 01:47:56,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-13 01:47:56,513 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:47:56,513 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 01:47:56,514 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 53 transitions, 486 flow [2022-12-13 01:47:56,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:47:56,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:47:56,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:47:56,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2022-12-13 01:47:56,514 INFO L420 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:47:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:47:56,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1017106938, now seen corresponding path program 1 times [2022-12-13 01:47:56,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:47:56,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590616509] [2022-12-13 01:47:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:47:56,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:47:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:47:57,432 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-13 01:47:57,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:47:57,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590616509] [2022-12-13 01:47:57,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590616509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:47:57,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:47:57,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:47:57,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577610830] [2022-12-13 01:47:57,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:47:57,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:47:57,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:47:57,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:47:57,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:47:57,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 01:47:57,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 53 transitions, 486 flow. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:47:57,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:47:57,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 01:47:57,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:47:57,662 INFO L130 PetriNetUnfolder]: 204/487 cut-off events. [2022-12-13 01:47:57,662 INFO L131 PetriNetUnfolder]: For 2810/2810 co-relation queries the response was YES. [2022-12-13 01:47:57,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 487 events. 204/487 cut-off events. For 2810/2810 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2306 event pairs, 106 based on Foata normal form. 2/489 useless extension candidates. Maximal degree in co-relation 2278. Up to 354 conditions per place. [2022-12-13 01:47:57,664 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 48 selfloop transitions, 5 changer transitions 37/90 dead transitions. [2022-12-13 01:47:57,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 882 flow [2022-12-13 01:47:57,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:47:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:47:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2022-12-13 01:47:57,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23333333333333334 [2022-12-13 01:47:57,664 INFO L175 Difference]: Start difference. First operand has 88 places, 53 transitions, 486 flow. Second operand 9 states and 84 transitions. [2022-12-13 01:47:57,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 882 flow [2022-12-13 01:47:57,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 90 transitions, 842 flow, removed 11 selfloop flow, removed 10 redundant places. [2022-12-13 01:47:57,669 INFO L231 Difference]: Finished difference. Result has 89 places, 50 transitions, 437 flow [2022-12-13 01:47:57,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=437, PETRI_PLACES=89, PETRI_TRANSITIONS=50} [2022-12-13 01:47:57,670 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places. [2022-12-13 01:47:57,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:47:57,670 INFO L89 Accepts]: Start accepts. Operand has 89 places, 50 transitions, 437 flow [2022-12-13 01:47:57,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:47:57,670 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:47:57,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 50 transitions, 437 flow [2022-12-13 01:47:57,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 50 transitions, 437 flow [2022-12-13 01:47:57,679 INFO L130 PetriNetUnfolder]: 12/122 cut-off events. [2022-12-13 01:47:57,679 INFO L131 PetriNetUnfolder]: For 510/518 co-relation queries the response was YES. [2022-12-13 01:47:57,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 122 events. 12/122 cut-off events. For 510/518 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 586 event pairs, 4 based on Foata normal form. 4/119 useless extension candidates. Maximal degree in co-relation 421. Up to 18 conditions per place. [2022-12-13 01:47:57,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 50 transitions, 437 flow [2022-12-13 01:47:57,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-13 01:48:05,468 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:48:05,469 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7799 [2022-12-13 01:48:05,469 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 49 transitions, 431 flow [2022-12-13 01:48:05,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:48:05,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:05,469 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:48:05,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2022-12-13 01:48:05,470 INFO L420 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:48:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash 737806989, now seen corresponding path program 1 times [2022-12-13 01:48:05,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:05,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650073632] [2022-12-13 01:48:05,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:05,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:06,560 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-13 01:48:06,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:06,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650073632] [2022-12-13 01:48:06,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650073632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:06,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:48:06,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 01:48:06,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342176829] [2022-12-13 01:48:06,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:06,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:48:06,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:48:06,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:48:06,561 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 01:48:06,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 49 transitions, 431 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:48:06,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:06,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 01:48:06,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:06,965 INFO L130 PetriNetUnfolder]: 334/774 cut-off events. [2022-12-13 01:48:06,965 INFO L131 PetriNetUnfolder]: For 4255/4255 co-relation queries the response was YES. [2022-12-13 01:48:06,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 774 events. 334/774 cut-off events. For 4255/4255 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4217 event pairs, 193 based on Foata normal form. 2/776 useless extension candidates. Maximal degree in co-relation 3494. Up to 354 conditions per place. [2022-12-13 01:48:06,968 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 78 selfloop transitions, 7 changer transitions 35/120 dead transitions. [2022-12-13 01:48:06,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 120 transitions, 1175 flow [2022-12-13 01:48:06,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:48:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:48:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-12-13 01:48:06,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-13 01:48:06,968 INFO L175 Difference]: Start difference. First operand has 80 places, 49 transitions, 431 flow. Second operand 10 states and 110 transitions. [2022-12-13 01:48:06,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 120 transitions, 1175 flow [2022-12-13 01:48:06,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 120 transitions, 1103 flow, removed 18 selfloop flow, removed 11 redundant places. [2022-12-13 01:48:06,974 INFO L231 Difference]: Finished difference. Result has 84 places, 52 transitions, 448 flow [2022-12-13 01:48:06,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=448, PETRI_PLACES=84, PETRI_TRANSITIONS=52} [2022-12-13 01:48:06,975 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2022-12-13 01:48:06,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:06,975 INFO L89 Accepts]: Start accepts. Operand has 84 places, 52 transitions, 448 flow [2022-12-13 01:48:06,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:06,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:06,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 52 transitions, 448 flow [2022-12-13 01:48:06,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 52 transitions, 448 flow [2022-12-13 01:48:06,989 INFO L130 PetriNetUnfolder]: 20/216 cut-off events. [2022-12-13 01:48:06,989 INFO L131 PetriNetUnfolder]: For 893/907 co-relation queries the response was YES. [2022-12-13 01:48:06,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 216 events. 20/216 cut-off events. For 893/907 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1411 event pairs, 8 based on Foata normal form. 6/209 useless extension candidates. Maximal degree in co-relation 707. Up to 31 conditions per place. [2022-12-13 01:48:06,990 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 52 transitions, 448 flow [2022-12-13 01:48:06,990 INFO L226 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-13 01:48:06,992 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:48:06,993 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-13 01:48:06,993 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 52 transitions, 448 flow [2022-12-13 01:48:06,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 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-13 01:48:06,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:06,993 INFO L214 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] [2022-12-13 01:48:06,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2022-12-13 01:48:06,993 INFO L420 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:48:06,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1956285962, now seen corresponding path program 1 times [2022-12-13 01:48:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:06,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926262089] [2022-12-13 01:48:06,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:08,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:48:08,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:08,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926262089] [2022-12-13 01:48:08,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926262089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:48:08,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092756116] [2022-12-13 01:48:08,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:08,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:48:08,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:48:08,117 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:48:08,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 01:48:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:08,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 01:48:08,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:48:08,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:48:08,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:48:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:48:08,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:48:08,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092756116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:08,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:48:08,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-12-13 01:48:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978295094] [2022-12-13 01:48:08,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:08,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:48:08,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:08,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:48:08,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-12-13 01:48:08,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 01:48:08,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 52 transitions, 448 flow. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:48:08,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:08,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 01:48:08,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:08,655 INFO L130 PetriNetUnfolder]: 308/710 cut-off events. [2022-12-13 01:48:08,655 INFO L131 PetriNetUnfolder]: For 3829/3829 co-relation queries the response was YES. [2022-12-13 01:48:08,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 710 events. 308/710 cut-off events. For 3829/3829 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3731 event pairs, 196 based on Foata normal form. 2/712 useless extension candidates. Maximal degree in co-relation 3102. Up to 578 conditions per place. [2022-12-13 01:48:08,657 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 33 selfloop transitions, 4 changer transitions 32/69 dead transitions. [2022-12-13 01:48:08,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 69 transitions, 652 flow [2022-12-13 01:48:08,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:48:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:48:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-13 01:48:08,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22142857142857142 [2022-12-13 01:48:08,658 INFO L175 Difference]: Start difference. First operand has 79 places, 52 transitions, 448 flow. Second operand 7 states and 62 transitions. [2022-12-13 01:48:08,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 69 transitions, 652 flow [2022-12-13 01:48:08,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 69 transitions, 636 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 01:48:08,680 INFO L231 Difference]: Finished difference. Result has 82 places, 37 transitions, 319 flow [2022-12-13 01:48:08,680 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=82, PETRI_TRANSITIONS=37} [2022-12-13 01:48:08,680 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2022-12-13 01:48:08,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:08,680 INFO L89 Accepts]: Start accepts. Operand has 82 places, 37 transitions, 319 flow [2022-12-13 01:48:08,681 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:08,681 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:08,681 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 37 transitions, 319 flow [2022-12-13 01:48:08,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 37 transitions, 319 flow [2022-12-13 01:48:08,691 INFO L130 PetriNetUnfolder]: 17/141 cut-off events. [2022-12-13 01:48:08,691 INFO L131 PetriNetUnfolder]: For 588/600 co-relation queries the response was YES. [2022-12-13 01:48:08,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 141 events. 17/141 cut-off events. For 588/600 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 744 event pairs, 8 based on Foata normal form. 4/135 useless extension candidates. Maximal degree in co-relation 475. Up to 23 conditions per place. [2022-12-13 01:48:08,692 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 37 transitions, 319 flow [2022-12-13 01:48:08,692 INFO L226 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-13 01:48:08,782 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] $Ultimate##0-->L97: Formula: (and (= v_~e2~0_173 0) (= v_~tmp2~0_127 v_~n1~0_229) (= (+ v_~tmp2~0_127 1) v_~n2~0_212) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83| (ite (= 0 (mod v_~e1~0_139 256)) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|)) InVars {~n1~0=v_~n1~0_229, ~e1~0=v_~e1~0_139} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, ~n2~0=v_~n2~0_212, ~n1~0=v_~n1~0_229, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_83|, ~tmp2~0=v_~tmp2~0_127, ~e2~0=v_~e2~0_173, ~e1~0=v_~e1~0_139} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~tmp2~0, ~e2~0] and [602] L74-->thread1EXIT: Formula: (and (= v_~n1~0_58 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_9| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_9| 0)) InVars {} OutVars{~n1~0=v_~n1~0_58, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_9|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_9|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] [2022-12-13 01:48:08,838 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [944] L97-->thread3EXIT: Formula: (let ((.cse0 (select |v_#memory_int_1370| v_~f~0.base_1230))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_1235 (* v_~j~0_699 4))))) (and (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|) (= v_~j~0_698 (select .cse0 (+ v_~f~0.offset_1235 (* .cse1 4)))) (= v_~i2~0_469 v_~i~0_2293) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_910| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_910|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_910| (ite (or (< v_~n2~0_1406 v_~n1~0_1260) (= v_~n1~0_1260 0)) 1 0)) (= |v_thread3Thread1of1ForFork0_#res#1.base_98| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_910| 0)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102| (ite (and (<= 0 .cse1) (< .cse1 v_~n~0_768)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_102| 0)) (= |v_thread3Thread1of1ForFork0_#res#1.offset_98| 0)))) InVars {~j~0=v_~j~0_699, ~n2~0=v_~n2~0_1406, ~i~0=v_~i~0_2293, ~f~0.base=v_~f~0.base_1230, ~n1~0=v_~n1~0_1260, #memory_int=|v_#memory_int_1370|, ~n~0=v_~n~0_768, ~f~0.offset=v_~f~0.offset_1235} OutVars{~j~0=v_~j~0_698, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_102|, ~n2~0=v_~n2~0_1406, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_102|, ~i~0=v_~i~0_2293, ~f~0.base=v_~f~0.base_1230, ~n1~0=v_~n1~0_1260, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_98|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_102|, ~i2~0=v_~i2~0_469, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_910|, ~f~0.offset=v_~f~0.offset_1235, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_98|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_910|, #memory_int=|v_#memory_int_1370|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_100|, ~n~0=v_~n~0_768} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem3#1, thread3Thread1of1ForFork0_#t~mem4#1, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:48:09,095 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 01:48:09,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 416 [2022-12-13 01:48:09,096 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 37 transitions, 383 flow [2022-12-13 01:48:09,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:48:09,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:09,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:48:09,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 01:48:09,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable193 [2022-12-13 01:48:09,296 INFO L420 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:48:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:09,297 INFO L85 PathProgramCache]: Analyzing trace with hash -224580188, now seen corresponding path program 1 times [2022-12-13 01:48:09,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:09,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451030585] [2022-12-13 01:48:09,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:10,349 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-13 01:48:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:10,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451030585] [2022-12-13 01:48:10,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451030585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:10,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:48:10,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:48:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610246850] [2022-12-13 01:48:10,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:10,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:48:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:10,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:48:10,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:48:10,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 01:48:10,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 37 transitions, 383 flow. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:48:10,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:10,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 01:48:10,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:10,531 INFO L130 PetriNetUnfolder]: 175/406 cut-off events. [2022-12-13 01:48:10,532 INFO L131 PetriNetUnfolder]: For 3167/3167 co-relation queries the response was YES. [2022-12-13 01:48:10,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 406 events. 175/406 cut-off events. For 3167/3167 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1846 event pairs, 101 based on Foata normal form. 1/399 useless extension candidates. Maximal degree in co-relation 2048. Up to 195 conditions per place. [2022-12-13 01:48:10,533 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 62 selfloop transitions, 8 changer transitions 12/82 dead transitions. [2022-12-13 01:48:10,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 82 transitions, 905 flow [2022-12-13 01:48:10,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:48:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:48:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2022-12-13 01:48:10,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3403361344537815 [2022-12-13 01:48:10,534 INFO L175 Difference]: Start difference. First operand has 75 places, 37 transitions, 383 flow. Second operand 7 states and 81 transitions. [2022-12-13 01:48:10,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 82 transitions, 905 flow [2022-12-13 01:48:10,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 574 flow, removed 78 selfloop flow, removed 26 redundant places. [2022-12-13 01:48:10,537 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 225 flow [2022-12-13 01:48:10,537 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2022-12-13 01:48:10,538 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2022-12-13 01:48:10,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:10,538 INFO L89 Accepts]: Start accepts. Operand has 57 places, 37 transitions, 225 flow [2022-12-13 01:48:10,538 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:10,538 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:10,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 37 transitions, 225 flow [2022-12-13 01:48:10,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 37 transitions, 225 flow [2022-12-13 01:48:10,546 INFO L130 PetriNetUnfolder]: 16/136 cut-off events. [2022-12-13 01:48:10,546 INFO L131 PetriNetUnfolder]: For 126/127 co-relation queries the response was YES. [2022-12-13 01:48:10,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 136 events. 16/136 cut-off events. For 126/127 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 713 event pairs, 8 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 315. Up to 20 conditions per place. [2022-12-13 01:48:10,546 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 37 transitions, 225 flow [2022-12-13 01:48:10,546 INFO L226 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-13 01:48:10,547 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:48:10,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 01:48:10,547 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 225 flow [2022-12-13 01:48:10,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:48:10,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:10,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:48:10,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2022-12-13 01:48:10,547 INFO L420 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:48:10,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:10,548 INFO L85 PathProgramCache]: Analyzing trace with hash 491781022, now seen corresponding path program 1 times [2022-12-13 01:48:10,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:10,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400647406] [2022-12-13 01:48:10,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:10,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:11,671 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-13 01:48:11,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:11,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400647406] [2022-12-13 01:48:11,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400647406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:11,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:48:11,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:48:11,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006216278] [2022-12-13 01:48:11,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:11,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:48:11,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:11,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:48:11,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:48:11,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 01:48:11,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 225 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:48:11,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:11,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 01:48:11,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:11,941 INFO L130 PetriNetUnfolder]: 181/427 cut-off events. [2022-12-13 01:48:11,942 INFO L131 PetriNetUnfolder]: For 808/808 co-relation queries the response was YES. [2022-12-13 01:48:11,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 427 events. 181/427 cut-off events. For 808/808 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2043 event pairs, 67 based on Foata normal form. 2/429 useless extension candidates. Maximal degree in co-relation 1472. Up to 185 conditions per place. [2022-12-13 01:48:11,943 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 67 selfloop transitions, 13 changer transitions 16/96 dead transitions. [2022-12-13 01:48:11,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 96 transitions, 684 flow [2022-12-13 01:48:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 01:48:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 01:48:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 95 transitions. [2022-12-13 01:48:11,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26988636363636365 [2022-12-13 01:48:11,944 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 225 flow. Second operand 11 states and 95 transitions. [2022-12-13 01:48:11,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 96 transitions, 684 flow [2022-12-13 01:48:11,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 96 transitions, 642 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-13 01:48:11,946 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 277 flow [2022-12-13 01:48:11,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=277, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2022-12-13 01:48:11,946 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2022-12-13 01:48:11,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:11,946 INFO L89 Accepts]: Start accepts. Operand has 62 places, 42 transitions, 277 flow [2022-12-13 01:48:11,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:11,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:11,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 42 transitions, 277 flow [2022-12-13 01:48:11,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 42 transitions, 277 flow [2022-12-13 01:48:11,956 INFO L130 PetriNetUnfolder]: 15/135 cut-off events. [2022-12-13 01:48:11,956 INFO L131 PetriNetUnfolder]: For 158/160 co-relation queries the response was YES. [2022-12-13 01:48:11,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 135 events. 15/135 cut-off events. For 158/160 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 719 event pairs, 6 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 331. Up to 19 conditions per place. [2022-12-13 01:48:11,956 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 42 transitions, 277 flow [2022-12-13 01:48:11,957 INFO L226 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-13 01:48:11,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] and [506] L71-->L74: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= (ite (and (<= 0 v_~i~0_32) (< v_~i~0_32 v_~n~0_22)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|)) InVars {~n~0=v_~n~0_22, ~i~0=v_~i~0_32} OutVars{~n~0=v_~n~0_22, ~i~0=v_~i~0_32, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 01:48:12,012 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:48:12,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [954] $Ultimate##0-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_789| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_789|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_789| 0)) (not (= (ite (= (mod v_~e2~0_1220 256) 0) 1 0) 0)) (= (+ v_~tmp1~0_269 1) v_~n1~0_1292) (= v_~i1~0_842 v_~i~0_2331) (= (select (select |v_#memory_int_1402| v_~f~0.base_1258) (+ v_~f~0.offset_1263 (* v_~i1~0_842 4))) v_~i~0_2330) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_789| (ite (or (= v_~n2~0_1438 0) (<= v_~n1~0_1292 v_~n2~0_1438)) 1 0)) (= v_~e1~0_936 0) (= v_~tmp1~0_269 v_~n2~0_1438)) InVars {~n2~0=v_~n2~0_1438, ~i~0=v_~i~0_2331, ~f~0.base=v_~f~0.base_1258, #memory_int=|v_#memory_int_1402|, ~f~0.offset=v_~f~0.offset_1263, ~e2~0=v_~e2~0_1220} OutVars{~n2~0=v_~n2~0_1438, ~i~0=v_~i~0_2330, ~f~0.base=v_~f~0.base_1258, ~n1~0=v_~n1~0_1292, ~i1~0=v_~i1~0_842, ~f~0.offset=v_~f~0.offset_1263, ~e2~0=v_~e2~0_1220, ~e1~0=v_~e1~0_936, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_789|, #memory_int=|v_#memory_int_1402|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_735|, ~tmp1~0=v_~tmp1~0_269, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_789|} AuxVars[] AssignedVars[~i~0, ~n1~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, ~tmp1~0, ~e1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [618] L153-4-->L154-3: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_15| |v_#pthreadsForks_33|) (= (store |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19| (store (select |v_#memory_int_79| |v_ULTIMATE.start_main_~#t2~0#1.base_19|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre15#1_15|)) |v_#memory_int_78|) (= |v_#pthreadsForks_32| (+ |v_#pthreadsForks_33| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_33|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_79|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_21|, #pthreadsForks=|v_#pthreadsForks_32|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #memory_int=|v_#memory_int_78|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_19|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 01:48:12,138 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [954] $Ultimate##0-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_789| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_789|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_789| 0)) (not (= (ite (= (mod v_~e2~0_1220 256) 0) 1 0) 0)) (= (+ v_~tmp1~0_269 1) v_~n1~0_1292) (= v_~i1~0_842 v_~i~0_2331) (= (select (select |v_#memory_int_1402| v_~f~0.base_1258) (+ v_~f~0.offset_1263 (* v_~i1~0_842 4))) v_~i~0_2330) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_789| (ite (or (= v_~n2~0_1438 0) (<= v_~n1~0_1292 v_~n2~0_1438)) 1 0)) (= v_~e1~0_936 0) (= v_~tmp1~0_269 v_~n2~0_1438)) InVars {~n2~0=v_~n2~0_1438, ~i~0=v_~i~0_2331, ~f~0.base=v_~f~0.base_1258, #memory_int=|v_#memory_int_1402|, ~f~0.offset=v_~f~0.offset_1263, ~e2~0=v_~e2~0_1220} OutVars{~n2~0=v_~n2~0_1438, ~i~0=v_~i~0_2330, ~f~0.base=v_~f~0.base_1258, ~n1~0=v_~n1~0_1292, ~i1~0=v_~i1~0_842, ~f~0.offset=v_~f~0.offset_1263, ~e2~0=v_~e2~0_1220, ~e1~0=v_~e1~0_936, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_789|, #memory_int=|v_#memory_int_1402|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_735|, ~tmp1~0=v_~tmp1~0_269, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_789|} AuxVars[] AssignedVars[~i~0, ~n1~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_#t~mem1#1, ~tmp1~0, ~e1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [962] L153-4-->L74: Formula: (and (= (store |v_#memory_int_1417| |v_ULTIMATE.start_main_~#t2~0#1.base_199| (store (select |v_#memory_int_1417| |v_ULTIMATE.start_main_~#t2~0#1.base_199|) |v_ULTIMATE.start_main_~#t2~0#1.offset_107| |v_ULTIMATE.start_main_#t~pre15#1_172|)) |v_#memory_int_1416|) (= (+ |v_#pthreadsForks_315| 1) |v_#pthreadsForks_314|) (= |v_#pthreadsForks_315| |v_ULTIMATE.start_main_#t~pre15#1_172|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_793| (ite (and (< v_~i~0_2358 v_~n~0_788) (<= 0 v_~i~0_2358)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_793| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_793|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_793| 0))) InVars {#pthreadsForks=|v_#pthreadsForks_315|, ~i~0=v_~i~0_2358, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_107|, #memory_int=|v_#memory_int_1417|, ~n~0=v_~n~0_788, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_199|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_147|, #pthreadsForks=|v_#pthreadsForks_314|, ~i~0=v_~i~0_2358, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_107|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_793|, #memory_int=|v_#memory_int_1416|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_172|, ~n~0=v_~n~0_788, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_199|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_793|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_99|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, ULTIMATE.start_main_#t~pre15#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-13 01:48:12,320 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:48:12,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 374 [2022-12-13 01:48:12,320 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 293 flow [2022-12-13 01:48:12,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:48:12,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:12,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:48:12,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2022-12-13 01:48:12,321 INFO L420 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:48:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash -454951252, now seen corresponding path program 1 times [2022-12-13 01:48:12,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:12,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266896097] [2022-12-13 01:48:12,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:12,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:48:13,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:13,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266896097] [2022-12-13 01:48:13,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266896097] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:48:13,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641795742] [2022-12-13 01:48:13,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:13,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:48:13,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:48:13,439 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:48:13,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 01:48:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:13,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 01:48:13,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:48:13,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:48:13,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 01:48:13,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:48:13,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 01:48:13,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:48:13,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:48:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:48:13,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:48:13,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641795742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:13,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:48:13,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-12-13 01:48:13,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327043731] [2022-12-13 01:48:13,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:13,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:48:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:13,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:48:13,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-13 01:48:13,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 01:48:13,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 293 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:48:13,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:13,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 01:48:13,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:13,980 INFO L130 PetriNetUnfolder]: 145/357 cut-off events. [2022-12-13 01:48:13,980 INFO L131 PetriNetUnfolder]: For 917/917 co-relation queries the response was YES. [2022-12-13 01:48:13,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 357 events. 145/357 cut-off events. For 917/917 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1569 event pairs, 58 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 1281. Up to 179 conditions per place. [2022-12-13 01:48:13,982 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 36 selfloop transitions, 11 changer transitions 8/55 dead transitions. [2022-12-13 01:48:13,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 458 flow [2022-12-13 01:48:13,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:48:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:48:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-13 01:48:13,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2914285714285714 [2022-12-13 01:48:13,991 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 293 flow. Second operand 5 states and 51 transitions. [2022-12-13 01:48:13,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 458 flow [2022-12-13 01:48:13,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 398 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-12-13 01:48:13,993 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 252 flow [2022-12-13 01:48:13,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2022-12-13 01:48:13,994 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2022-12-13 01:48:13,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:13,994 INFO L89 Accepts]: Start accepts. Operand has 56 places, 39 transitions, 252 flow [2022-12-13 01:48:13,994 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:13,994 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:13,994 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 39 transitions, 252 flow [2022-12-13 01:48:13,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 39 transitions, 252 flow [2022-12-13 01:48:14,002 INFO L130 PetriNetUnfolder]: 14/132 cut-off events. [2022-12-13 01:48:14,002 INFO L131 PetriNetUnfolder]: For 142/143 co-relation queries the response was YES. [2022-12-13 01:48:14,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 132 events. 14/132 cut-off events. For 142/143 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 644 event pairs, 6 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 249. Up to 17 conditions per place. [2022-12-13 01:48:14,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 39 transitions, 252 flow [2022-12-13 01:48:14,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-13 01:48:14,003 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:48:14,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 01:48:14,003 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 252 flow [2022-12-13 01:48:14,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:48:14,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:14,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:48:14,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 01:48:14,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:48:14,205 INFO L420 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:48:14,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:14,205 INFO L85 PathProgramCache]: Analyzing trace with hash 198995950, now seen corresponding path program 1 times [2022-12-13 01:48:14,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:14,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271626571] [2022-12-13 01:48:14,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:15,242 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-13 01:48:15,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:15,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271626571] [2022-12-13 01:48:15,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271626571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:15,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:48:15,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:48:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818248930] [2022-12-13 01:48:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:15,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:48:15,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:15,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:48:15,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:48:15,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-13 01:48:15,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 252 flow. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:48:15,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:15,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-13 01:48:15,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:15,534 INFO L130 PetriNetUnfolder]: 140/359 cut-off events. [2022-12-13 01:48:15,534 INFO L131 PetriNetUnfolder]: For 683/683 co-relation queries the response was YES. [2022-12-13 01:48:15,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 359 events. 140/359 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1634 event pairs, 99 based on Foata normal form. 2/360 useless extension candidates. Maximal degree in co-relation 935. Up to 184 conditions per place. [2022-12-13 01:48:15,535 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 48 selfloop transitions, 7 changer transitions 29/84 dead transitions. [2022-12-13 01:48:15,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 595 flow [2022-12-13 01:48:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:48:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:48:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 84 transitions. [2022-12-13 01:48:15,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27450980392156865 [2022-12-13 01:48:15,536 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 252 flow. Second operand 9 states and 84 transitions. [2022-12-13 01:48:15,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 595 flow [2022-12-13 01:48:15,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 563 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 01:48:15,538 INFO L231 Difference]: Finished difference. Result has 62 places, 36 transitions, 212 flow [2022-12-13 01:48:15,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=212, PETRI_PLACES=62, PETRI_TRANSITIONS=36} [2022-12-13 01:48:15,538 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2022-12-13 01:48:15,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:15,538 INFO L89 Accepts]: Start accepts. Operand has 62 places, 36 transitions, 212 flow [2022-12-13 01:48:15,538 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:15,538 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:15,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 36 transitions, 212 flow [2022-12-13 01:48:15,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 36 transitions, 212 flow [2022-12-13 01:48:15,544 INFO L130 PetriNetUnfolder]: 9/97 cut-off events. [2022-12-13 01:48:15,545 INFO L131 PetriNetUnfolder]: For 107/108 co-relation queries the response was YES. [2022-12-13 01:48:15,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 97 events. 9/97 cut-off events. For 107/108 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 387 event pairs, 4 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 224. Up to 14 conditions per place. [2022-12-13 01:48:15,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 36 transitions, 212 flow [2022-12-13 01:48:15,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-13 01:48:15,592 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:48:15,592 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 01:48:15,592 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 36 transitions, 218 flow [2022-12-13 01:48:15,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:48:15,592 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:15,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:48:15,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2022-12-13 01:48:15,593 INFO L420 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:48:15,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:15,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1731870001, now seen corresponding path program 1 times [2022-12-13 01:48:15,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:15,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420565643] [2022-12-13 01:48:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:15,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:16,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-13 01:48:16,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:16,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420565643] [2022-12-13 01:48:16,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420565643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:16,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:48:16,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:48:16,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064555324] [2022-12-13 01:48:16,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:16,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:48:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:16,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:48:16,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:48:16,478 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:48:16,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 36 transitions, 218 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:48:16,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:16,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:48:16,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:16,634 INFO L130 PetriNetUnfolder]: 101/252 cut-off events. [2022-12-13 01:48:16,635 INFO L131 PetriNetUnfolder]: For 484/484 co-relation queries the response was YES. [2022-12-13 01:48:16,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 252 events. 101/252 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 986 event pairs, 69 based on Foata normal form. 2/243 useless extension candidates. Maximal degree in co-relation 880. Up to 184 conditions per place. [2022-12-13 01:48:16,636 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 28 selfloop transitions, 4 changer transitions 26/58 dead transitions. [2022-12-13 01:48:16,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 421 flow [2022-12-13 01:48:16,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:48:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:48:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-12-13 01:48:16,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23387096774193547 [2022-12-13 01:48:16,636 INFO L175 Difference]: Start difference. First operand has 58 places, 36 transitions, 218 flow. Second operand 8 states and 58 transitions. [2022-12-13 01:48:16,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 421 flow [2022-12-13 01:48:16,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 397 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 01:48:16,638 INFO L231 Difference]: Finished difference. Result has 60 places, 32 transitions, 178 flow [2022-12-13 01:48:16,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=178, PETRI_PLACES=60, PETRI_TRANSITIONS=32} [2022-12-13 01:48:16,638 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2022-12-13 01:48:16,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:16,638 INFO L89 Accepts]: Start accepts. Operand has 60 places, 32 transitions, 178 flow [2022-12-13 01:48:16,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:16,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:16,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 32 transitions, 178 flow [2022-12-13 01:48:16,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 32 transitions, 178 flow [2022-12-13 01:48:16,644 INFO L130 PetriNetUnfolder]: 10/74 cut-off events. [2022-12-13 01:48:16,644 INFO L131 PetriNetUnfolder]: For 65/66 co-relation queries the response was YES. [2022-12-13 01:48:16,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 74 events. 10/74 cut-off events. For 65/66 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 247 event pairs, 6 based on Foata normal form. 1/69 useless extension candidates. Maximal degree in co-relation 186. Up to 11 conditions per place. [2022-12-13 01:48:16,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 32 transitions, 178 flow [2022-12-13 01:48:16,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 01:48:25,294 WARN L233 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 230 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:48:34,195 WARN L233 SmtUtils]: Spent 7.18s on a formula simplification that was a NOOP. DAG size: 238 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:48:34,197 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:48:34,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17559 [2022-12-13 01:48:34,197 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 172 flow [2022-12-13 01:48:34,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:48:34,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:34,197 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:48:34,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2022-12-13 01:48:34,197 INFO L420 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:48:34,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:34,198 INFO L85 PathProgramCache]: Analyzing trace with hash 465943435, now seen corresponding path program 1 times [2022-12-13 01:48:34,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:34,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70289029] [2022-12-13 01:48:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:34,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:35,216 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-13 01:48:35,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:35,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70289029] [2022-12-13 01:48:35,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70289029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:35,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:48:35,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:48:35,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940201355] [2022-12-13 01:48:35,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:35,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:48:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:48:35,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:48:35,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 01:48:35,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 31 transitions, 172 flow. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:48:35,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:35,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 01:48:35,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:35,426 INFO L130 PetriNetUnfolder]: 160/388 cut-off events. [2022-12-13 01:48:35,426 INFO L131 PetriNetUnfolder]: For 712/712 co-relation queries the response was YES. [2022-12-13 01:48:35,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 388 events. 160/388 cut-off events. For 712/712 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1758 event pairs, 98 based on Foata normal form. 2/374 useless extension candidates. Maximal degree in co-relation 1348. Up to 184 conditions per place. [2022-12-13 01:48:35,427 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 54 selfloop transitions, 8 changer transitions 17/79 dead transitions. [2022-12-13 01:48:35,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 559 flow [2022-12-13 01:48:35,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:48:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:48:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-12-13 01:48:35,428 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.325 [2022-12-13 01:48:35,428 INFO L175 Difference]: Start difference. First operand has 51 places, 31 transitions, 172 flow. Second operand 8 states and 78 transitions. [2022-12-13 01:48:35,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 559 flow [2022-12-13 01:48:35,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 497 flow, removed 23 selfloop flow, removed 10 redundant places. [2022-12-13 01:48:35,429 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 198 flow [2022-12-13 01:48:35,430 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=198, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2022-12-13 01:48:35,430 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-12-13 01:48:35,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:35,430 INFO L89 Accepts]: Start accepts. Operand has 52 places, 36 transitions, 198 flow [2022-12-13 01:48:35,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:35,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:35,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 36 transitions, 198 flow [2022-12-13 01:48:35,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 36 transitions, 198 flow [2022-12-13 01:48:35,438 INFO L130 PetriNetUnfolder]: 14/133 cut-off events. [2022-12-13 01:48:35,438 INFO L131 PetriNetUnfolder]: For 88/89 co-relation queries the response was YES. [2022-12-13 01:48:35,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 133 events. 14/133 cut-off events. For 88/89 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 642 event pairs, 10 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 304. Up to 19 conditions per place. [2022-12-13 01:48:35,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 36 transitions, 198 flow [2022-12-13 01:48:35,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-13 01:48:35,442 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:48:35,484 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:48:35,484 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 01:48:35,484 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 194 flow [2022-12-13 01:48:35,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:48:35,484 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:35,484 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:48:35,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2022-12-13 01:48:35,484 INFO L420 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:48:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1341800842, now seen corresponding path program 1 times [2022-12-13 01:48:35,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:35,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063257024] [2022-12-13 01:48:35,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:35,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:48:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:36,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063257024] [2022-12-13 01:48:36,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063257024] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:48:36,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915625002] [2022-12-13 01:48:36,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:36,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:48:36,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:48:36,629 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 01:48:36,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 01:48:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:37,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 01:48:37,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:48:37,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:48:37,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 01:48:37,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 01:48:37,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 01:48:37,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 01:48:37,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 01:48:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 01:48:37,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 01:48:37,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915625002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:37,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:48:37,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2022-12-13 01:48:37,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710002462] [2022-12-13 01:48:37,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:37,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:48:37,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:37,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:48:37,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-12-13 01:48:37,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-13 01:48:37,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 194 flow. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:48:37,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:37,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-13 01:48:37,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:37,336 INFO L130 PetriNetUnfolder]: 124/324 cut-off events. [2022-12-13 01:48:37,337 INFO L131 PetriNetUnfolder]: For 589/589 co-relation queries the response was YES. [2022-12-13 01:48:37,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 324 events. 124/324 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1390 event pairs, 62 based on Foata normal form. 2/311 useless extension candidates. Maximal degree in co-relation 1106. Up to 162 conditions per place. [2022-12-13 01:48:37,338 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 28 selfloop transitions, 8 changer transitions 17/53 dead transitions. [2022-12-13 01:48:37,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 362 flow [2022-12-13 01:48:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:48:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:48:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-12-13 01:48:37,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2304147465437788 [2022-12-13 01:48:37,338 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 194 flow. Second operand 7 states and 50 transitions. [2022-12-13 01:48:37,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 362 flow [2022-12-13 01:48:37,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 350 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 01:48:37,340 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 168 flow [2022-12-13 01:48:37,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2022-12-13 01:48:37,340 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2022-12-13 01:48:37,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:37,340 INFO L89 Accepts]: Start accepts. Operand has 55 places, 30 transitions, 168 flow [2022-12-13 01:48:37,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:37,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:37,340 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 30 transitions, 168 flow [2022-12-13 01:48:37,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 30 transitions, 168 flow [2022-12-13 01:48:37,346 INFO L130 PetriNetUnfolder]: 9/97 cut-off events. [2022-12-13 01:48:37,347 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2022-12-13 01:48:37,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 97 events. 9/97 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 379 event pairs, 8 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 230. Up to 15 conditions per place. [2022-12-13 01:48:37,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 30 transitions, 168 flow [2022-12-13 01:48:37,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 01:48:37,367 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [742] L106-->thread2EXIT: Formula: (and (= v_~n2~0_289 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_25| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_25| 0) (= (ite (and (< v_~i~0_499 v_~n~0_195) (<= 0 v_~i~0_499)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_117|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_117| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_117|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_117| 0))) InVars {~i~0=v_~i~0_499, ~n~0=v_~n~0_195} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_117|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_25|, ~n2~0=v_~n2~0_289, ~i~0=v_~i~0_499, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_117|, ~n~0=v_~n~0_195, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_25|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base] and [751] L88-->L103: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_154| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_154|) (= (+ v_~tmp2~0_166 1) v_~n2~0_329) (not (= (ite (= (mod v_~e1~0_184 256) 0) 1 0) 0)) (= v_~e2~0_249 0) (= (ite (or (= v_~n1~0_345 0) (< v_~n2~0_329 v_~n1~0_345)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_154|) (= v_~i2~0_215 v_~i~0_533) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_154| 0))) InVars {~i~0=v_~i~0_533, ~n1~0=v_~n1~0_345, ~tmp2~0=v_~tmp2~0_166, ~e1~0=v_~e1~0_184} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_154|, ~n2~0=v_~n2~0_329, ~i~0=v_~i~0_533, ~n1~0=v_~n1~0_345, ~i2~0=v_~i2~0_215, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_154|, ~tmp2~0=v_~tmp2~0_166, ~e2~0=v_~e2~0_249, ~e1~0=v_~e1~0_184} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] [2022-12-13 01:48:37,501 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [674] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse1 (select |v_#memory_int_126| v_~f~0.base_71))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_71 (* v_~j~0_93 4))))) (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= (ite (and (< .cse0 v_~n~0_86) (<= 0 .cse0)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|) (= v_~j~0_92 (select .cse1 (+ v_~f~0.offset_71 (* 4 .cse0)))) (= |v_thread3Thread1of1ForFork0_#res#1.offset_7| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|)))) InVars {~j~0=v_~j~0_93, ~f~0.base=v_~f~0.base_71, #memory_int=|v_#memory_int_126|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_7|, ~j~0=v_~j~0_92, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~f~0.base=v_~f~0.base_71, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_7|, #memory_int=|v_#memory_int_126|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_9|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_11|, ~n~0=v_~n~0_86, ~f~0.offset=v_~f~0.offset_71} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, ~j~0, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~mem4#1, thread3Thread1of1ForFork0_#t~mem3#1] and [517] L103-->L106: Formula: (= (select (select |v_#memory_int_26| v_~f~0.base_15) (+ v_~f~0.offset_15 (* v_~i2~0_5 4))) v_~i~0_20) InVars {#memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.base=v_~f~0.base_15, ~f~0.offset=v_~f~0.offset_15} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_1|, ~i~0=v_~i~0_20, ~f~0.base=v_~f~0.base_15, #memory_int=|v_#memory_int_26|, ~i2~0=v_~i2~0_5, ~f~0.offset=v_~f~0.offset_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0] [2022-12-13 01:48:37,543 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:48:37,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 204 [2022-12-13 01:48:37,544 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 173 flow [2022-12-13 01:48:37,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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-13 01:48:37,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:48:37,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:48:37,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 01:48:37,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable200 [2022-12-13 01:48:37,745 INFO L420 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:48:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:48:37,745 INFO L85 PathProgramCache]: Analyzing trace with hash -945246282, now seen corresponding path program 1 times [2022-12-13 01:48:37,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:48:37,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466927070] [2022-12-13 01:48:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:48:37,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:48:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:48:38,888 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-13 01:48:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:48:38,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466927070] [2022-12-13 01:48:38,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466927070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:48:38,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:48:38,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:48:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819633655] [2022-12-13 01:48:38,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:48:38,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:48:38,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:48:38,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:48:38,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:48:38,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 01:48:38,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 173 flow. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:48:38,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:48:38,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 01:48:38,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:48:39,073 INFO L130 PetriNetUnfolder]: 71/199 cut-off events. [2022-12-13 01:48:39,073 INFO L131 PetriNetUnfolder]: For 473/473 co-relation queries the response was YES. [2022-12-13 01:48:39,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 199 events. 71/199 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 760 event pairs, 35 based on Foata normal form. 2/189 useless extension candidates. Maximal degree in co-relation 727. Up to 100 conditions per place. [2022-12-13 01:48:39,074 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 21 selfloop transitions, 4 changer transitions 34/59 dead transitions. [2022-12-13 01:48:39,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 400 flow [2022-12-13 01:48:39,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:48:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:48:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-12-13 01:48:39,074 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2564102564102564 [2022-12-13 01:48:39,074 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 173 flow. Second operand 9 states and 60 transitions. [2022-12-13 01:48:39,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 400 flow [2022-12-13 01:48:39,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 342 flow, removed 11 selfloop flow, removed 11 redundant places. [2022-12-13 01:48:39,076 INFO L231 Difference]: Finished difference. Result has 52 places, 25 transitions, 117 flow [2022-12-13 01:48:39,076 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=117, PETRI_PLACES=52, PETRI_TRANSITIONS=25} [2022-12-13 01:48:39,076 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-12-13 01:48:39,076 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:48:39,076 INFO L89 Accepts]: Start accepts. Operand has 52 places, 25 transitions, 117 flow [2022-12-13 01:48:39,076 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:48:39,076 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:48:39,076 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 25 transitions, 117 flow [2022-12-13 01:48:39,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 25 transitions, 117 flow [2022-12-13 01:48:39,080 INFO L130 PetriNetUnfolder]: 5/44 cut-off events. [2022-12-13 01:48:39,080 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 01:48:39,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 44 events. 5/44 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 4 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 97. Up to 8 conditions per place. [2022-12-13 01:48:39,080 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 25 transitions, 117 flow [2022-12-13 01:48:39,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 01:49:03,351 WARN L233 SmtUtils]: Spent 24.27s on a formula simplification. DAG size of input: 245 DAG size of output: 243 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:49:11,812 WARN L233 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 237 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:49:14,961 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:49:14,962 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35886 [2022-12-13 01:49:14,962 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 112 flow [2022-12-13 01:49:14,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-13 01:49:14,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:49:14,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:49:14,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2022-12-13 01:49:14,962 INFO L420 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:49:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:49:14,962 INFO L85 PathProgramCache]: Analyzing trace with hash 207821580, now seen corresponding path program 1 times [2022-12-13 01:49:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:49:14,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79862393] [2022-12-13 01:49:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:49:14,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:49:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:49:15,986 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-13 01:49:15,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:49:15,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79862393] [2022-12-13 01:49:15,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79862393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:49:15,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:49:15,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:49:15,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504594963] [2022-12-13 01:49:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:49:15,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:49:15,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:49:15,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:49:15,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:49:15,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 01:49:15,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 112 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:49:15,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:49:15,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 01:49:15,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:49:16,204 INFO L130 PetriNetUnfolder]: 59/171 cut-off events. [2022-12-13 01:49:16,204 INFO L131 PetriNetUnfolder]: For 226/226 co-relation queries the response was YES. [2022-12-13 01:49:16,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 171 events. 59/171 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 628 event pairs, 19 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 580. Up to 83 conditions per place. [2022-12-13 01:49:16,204 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 21 selfloop transitions, 5 changer transitions 33/59 dead transitions. [2022-12-13 01:49:16,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 381 flow [2022-12-13 01:49:16,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:49:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:49:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2022-12-13 01:49:16,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2608695652173913 [2022-12-13 01:49:16,205 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 112 flow. Second operand 10 states and 60 transitions. [2022-12-13 01:49:16,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 381 flow [2022-12-13 01:49:16,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 325 flow, removed 20 selfloop flow, removed 9 redundant places. [2022-12-13 01:49:16,206 INFO L231 Difference]: Finished difference. Result has 47 places, 24 transitions, 112 flow [2022-12-13 01:49:16,206 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=24} [2022-12-13 01:49:16,206 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2022-12-13 01:49:16,206 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:49:16,207 INFO L89 Accepts]: Start accepts. Operand has 47 places, 24 transitions, 112 flow [2022-12-13 01:49:16,207 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:49:16,207 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:49:16,207 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 24 transitions, 112 flow [2022-12-13 01:49:16,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 24 transitions, 112 flow [2022-12-13 01:49:16,211 INFO L130 PetriNetUnfolder]: 5/50 cut-off events. [2022-12-13 01:49:16,211 INFO L131 PetriNetUnfolder]: For 25/26 co-relation queries the response was YES. [2022-12-13 01:49:16,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 50 events. 5/50 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 4 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 108. Up to 10 conditions per place. [2022-12-13 01:49:16,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 24 transitions, 112 flow [2022-12-13 01:49:16,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 01:49:41,801 WARN L233 SmtUtils]: Spent 22.78s on a formula simplification. DAG size of input: 259 DAG size of output: 257 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:49:47,197 WARN L233 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 251 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:49:47,199 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:49:47,199 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30993 [2022-12-13 01:49:47,199 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 23 transitions, 108 flow [2022-12-13 01:49:47,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:49:47,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:49:47,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:49:47,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2022-12-13 01:49:47,200 INFO L420 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:49:47,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:49:47,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1290250849, now seen corresponding path program 1 times [2022-12-13 01:49:47,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:49:47,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211103236] [2022-12-13 01:49:47,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:49:47,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:49:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:49:49,057 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-13 01:49:49,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:49:49,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211103236] [2022-12-13 01:49:49,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211103236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:49:49,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:49:49,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:49:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326391565] [2022-12-13 01:49:49,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:49:49,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:49:49,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:49:49,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:49:49,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:49:49,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 01:49:49,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 23 transitions, 108 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:49:49,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:49:49,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 01:49:49,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:49:49,439 INFO L130 PetriNetUnfolder]: 63/201 cut-off events. [2022-12-13 01:49:49,439 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2022-12-13 01:49:49,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 201 events. 63/201 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 847 event pairs, 29 based on Foata normal form. 2/191 useless extension candidates. Maximal degree in co-relation 659. Up to 86 conditions per place. [2022-12-13 01:49:49,440 INFO L137 encePairwiseOnDemand]: 11/23 looper letters, 37 selfloop transitions, 13 changer transitions 16/66 dead transitions. [2022-12-13 01:49:49,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 411 flow [2022-12-13 01:49:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:49:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:49:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-12-13 01:49:49,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32367149758454106 [2022-12-13 01:49:49,441 INFO L175 Difference]: Start difference. First operand has 41 places, 23 transitions, 108 flow. Second operand 9 states and 67 transitions. [2022-12-13 01:49:49,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 411 flow [2022-12-13 01:49:49,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 66 transitions, 357 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-12-13 01:49:49,442 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 192 flow [2022-12-13 01:49:49,442 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=192, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-13 01:49:49,442 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-12-13 01:49:49,442 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:49:49,442 INFO L89 Accepts]: Start accepts. Operand has 46 places, 33 transitions, 192 flow [2022-12-13 01:49:49,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:49:49,443 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:49:49,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 192 flow [2022-12-13 01:49:49,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 192 flow [2022-12-13 01:49:49,449 INFO L130 PetriNetUnfolder]: 7/101 cut-off events. [2022-12-13 01:49:49,449 INFO L131 PetriNetUnfolder]: For 82/90 co-relation queries the response was YES. [2022-12-13 01:49:49,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 101 events. 7/101 cut-off events. For 82/90 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 424 event pairs, 6 based on Foata normal form. 5/99 useless extension candidates. Maximal degree in co-relation 232. Up to 19 conditions per place. [2022-12-13 01:49:49,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 192 flow [2022-12-13 01:49:49,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-13 01:49:49,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [971] $Ultimate##0-->L103: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_954| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_954|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_954| (ite (or (= v_~n1~0_1322 0) (< v_~n2~0_1468 v_~n1~0_1322)) 1 0)) (= (+ v_~tmp2~0_850 1) v_~n2~0_1468) (= v_~tmp2~0_850 v_~n1~0_1322) (= v_~e2~0_1242 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_954| 0)) (not (= (ite (= (mod v_~e1~0_958 256) 0) 1 0) 0)) (= v_~i2~0_495 v_~i~0_2386)) InVars {~i~0=v_~i~0_2386, ~n1~0=v_~n1~0_1322, ~e1~0=v_~e1~0_958} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_954|, ~n2~0=v_~n2~0_1468, ~i~0=v_~i~0_2386, ~n1~0=v_~n1~0_1322, ~i2~0=v_~i2~0_495, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_954|, ~tmp2~0=v_~tmp2~0_850, ~e2~0=v_~e2~0_1242, ~e1~0=v_~e1~0_958} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~tmp2~0, ~e2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:49:49,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] L88-->L103: Formula: (and (= v_~i2~0_217 v_~i~0_535) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_156| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_156|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_156| 0)) (= (ite (or (< v_~n2~0_331 v_~n1~0_347) (= v_~n1~0_347 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_156|) (= v_~n2~0_331 (+ v_~tmp2~0_168 1)) (= v_~e2~0_251 0) (not (= (ite (= (mod v_~e1~0_186 256) 0) 1 0) 0))) InVars {~i~0=v_~i~0_535, ~n1~0=v_~n1~0_347, ~tmp2~0=v_~tmp2~0_168, ~e1~0=v_~e1~0_186} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_156|, ~n2~0=v_~n2~0_331, ~i~0=v_~i~0_535, ~n1~0=v_~n1~0_347, ~i2~0=v_~i2~0_217, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_156|, ~tmp2~0=v_~tmp2~0_168, ~e2~0=v_~e2~0_251, ~e1~0=v_~e1~0_186} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] and [666] L154-4-->L155-3: Formula: (and (= (store |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31| (store (select |v_#memory_int_107| |v_ULTIMATE.start_main_~#t3~0#1.base_31|) |v_ULTIMATE.start_main_~#t3~0#1.offset_31| |v_ULTIMATE.start_main_#t~pre17#1_35|)) |v_#memory_int_106|) (= |v_#pthreadsForks_46| (+ |v_#pthreadsForks_47| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_35| |v_#pthreadsForks_47|)) InVars {#pthreadsForks=|v_#pthreadsForks_47|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_25|, #pthreadsForks=|v_#pthreadsForks_46|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_31|, #memory_int=|v_#memory_int_106|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_31|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_33|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_35|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-13 01:49:49,601 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [686] $Ultimate##0-->thread1EXIT: Formula: (and (= v_~n1~0_168 0) (= v_~n1~0_169 v_~tmp2~0_95) (= v_~e2~0_133 1) (= |v_thread1Thread1of1ForFork1_#res#1.offset_20| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_20| 0)) InVars {~n1~0=v_~n1~0_169} OutVars{~n1~0=v_~n1~0_168, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_20|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_20|, ~tmp2~0=v_~tmp2~0_95, ~e2~0=v_~e2~0_133} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~tmp2~0, ~e2~0] and [978] L88-->L155-3: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_962| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_962|) (= v_~e2~0_1252 0) (= (store |v_#memory_int_1467| |v_ULTIMATE.start_main_~#t3~0#1.base_296| (store (select |v_#memory_int_1467| |v_ULTIMATE.start_main_~#t3~0#1.base_296|) |v_ULTIMATE.start_main_~#t3~0#1.offset_140| |v_ULTIMATE.start_main_#t~pre17#1_144|)) |v_#memory_int_1466|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_962| (ite (or (= v_~n1~0_1330 0) (< v_~n2~0_1480 v_~n1~0_1330)) 1 0)) (= v_~i2~0_509 v_~i~0_2400) (= (+ v_~tmp2~0_858 1) v_~n2~0_1480) (not (= (ite (= (mod v_~e1~0_966 256) 0) 1 0) 0)) (= (+ |v_#pthreadsForks_331| 1) |v_#pthreadsForks_330|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_962| 0)) (= |v_ULTIMATE.start_main_#t~pre17#1_144| |v_#pthreadsForks_331|)) InVars {#pthreadsForks=|v_#pthreadsForks_331|, ~i~0=v_~i~0_2400, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_140|, ~n1~0=v_~n1~0_1330, #memory_int=|v_#memory_int_1467|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_296|, ~tmp2~0=v_~tmp2~0_858, ~e1~0=v_~e1~0_966} OutVars{~n2~0=v_~n2~0_1480, ~i~0=v_~i~0_2400, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_140|, ~n1~0=v_~n1~0_1330, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_296|, ~i2~0=v_~i2~0_509, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_962|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_186|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_144|, ~e2~0=v_~e2~0_1252, ~e1~0=v_~e1~0_966, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_134|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_962|, #pthreadsForks=|v_#pthreadsForks_330|, #memory_int=|v_#memory_int_1466|, ~tmp2~0=v_~tmp2~0_858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, #pthreadsForks, #memory_int, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1, ~e2~0] [2022-12-13 01:49:49,743 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:49:49,744 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 302 [2022-12-13 01:49:49,744 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 191 flow [2022-12-13 01:49:49,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:49:49,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:49:49,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:49:49,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2022-12-13 01:49:49,744 INFO L420 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:49:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:49:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1459300915, now seen corresponding path program 1 times [2022-12-13 01:49:49,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:49:49,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294611022] [2022-12-13 01:49:49,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:49:49,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:49:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:49:50,939 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-13 01:49:50,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:49:50,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294611022] [2022-12-13 01:49:50,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294611022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:49:50,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:49:50,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:49:50,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552551085] [2022-12-13 01:49:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:49:50,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:49:50,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:49:50,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:49:50,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:49:50,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:49:50,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 191 flow. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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-13 01:49:50,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:49:50,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:49:50,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:49:51,172 INFO L130 PetriNetUnfolder]: 49/159 cut-off events. [2022-12-13 01:49:51,172 INFO L131 PetriNetUnfolder]: For 294/294 co-relation queries the response was YES. [2022-12-13 01:49:51,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 159 events. 49/159 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 612 event pairs, 29 based on Foata normal form. 2/148 useless extension candidates. Maximal degree in co-relation 569. Up to 86 conditions per place. [2022-12-13 01:49:51,173 INFO L137 encePairwiseOnDemand]: 14/25 looper letters, 20 selfloop transitions, 4 changer transitions 32/56 dead transitions. [2022-12-13 01:49:51,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 379 flow [2022-12-13 01:49:51,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:49:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:49:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-12-13 01:49:51,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.285 [2022-12-13 01:49:51,173 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 191 flow. Second operand 8 states and 57 transitions. [2022-12-13 01:49:51,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 379 flow [2022-12-13 01:49:51,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 363 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 01:49:51,174 INFO L231 Difference]: Finished difference. Result has 50 places, 24 transitions, 118 flow [2022-12-13 01:49:51,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=118, PETRI_PLACES=50, PETRI_TRANSITIONS=24} [2022-12-13 01:49:51,180 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2022-12-13 01:49:51,180 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:49:51,180 INFO L89 Accepts]: Start accepts. Operand has 50 places, 24 transitions, 118 flow [2022-12-13 01:49:51,180 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:49:51,180 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:49:51,180 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 24 transitions, 118 flow [2022-12-13 01:49:51,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 24 transitions, 118 flow [2022-12-13 01:49:51,185 INFO L130 PetriNetUnfolder]: 5/42 cut-off events. [2022-12-13 01:49:51,185 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 01:49:51,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 42 events. 5/42 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 4 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 95. Up to 8 conditions per place. [2022-12-13 01:49:51,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 24 transitions, 118 flow [2022-12-13 01:49:51,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 01:50:05,526 WARN L233 SmtUtils]: Spent 14.34s on a formula simplification. DAG size of input: 258 DAG size of output: 256 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:50:30,833 WARN L233 SmtUtils]: Spent 24.45s on a formula simplification. DAG size of input: 265 DAG size of output: 263 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:50:54,414 WARN L233 SmtUtils]: Spent 23.58s on a formula simplification that was a NOOP. DAG size: 256 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:50:54,416 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:50:54,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63237 [2022-12-13 01:50:54,417 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 23 transitions, 112 flow [2022-12-13 01:50:54,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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-13 01:50:54,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:50:54,417 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:50:54,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2022-12-13 01:50:54,417 INFO L420 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:50:54,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:50:54,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1596928733, now seen corresponding path program 1 times [2022-12-13 01:50:54,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:50:54,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885368883] [2022-12-13 01:50:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:50:54,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:50:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:50:55,853 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-13 01:50:55,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:50:55,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885368883] [2022-12-13 01:50:55,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885368883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:50:55,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:50:55,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:50:55,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564971174] [2022-12-13 01:50:55,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:50:55,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:50:55,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:50:55,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:50:55,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:50:55,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 01:50:55,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 23 transitions, 112 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:50:55,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:50:55,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 01:50:55,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:50:56,074 INFO L130 PetriNetUnfolder]: 59/171 cut-off events. [2022-12-13 01:50:56,074 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-13 01:50:56,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 171 events. 59/171 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 634 event pairs, 29 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 580. Up to 86 conditions per place. [2022-12-13 01:50:56,075 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 20 selfloop transitions, 4 changer transitions 33/57 dead transitions. [2022-12-13 01:50:56,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 364 flow [2022-12-13 01:50:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:50:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:50:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-12-13 01:50:56,076 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28019323671497587 [2022-12-13 01:50:56,076 INFO L175 Difference]: Start difference. First operand has 41 places, 23 transitions, 112 flow. Second operand 9 states and 58 transitions. [2022-12-13 01:50:56,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 364 flow [2022-12-13 01:50:56,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 312 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-13 01:50:56,077 INFO L231 Difference]: Finished difference. Result has 46 places, 24 transitions, 110 flow [2022-12-13 01:50:56,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=110, PETRI_PLACES=46, PETRI_TRANSITIONS=24} [2022-12-13 01:50:56,077 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-12-13 01:50:56,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:50:56,077 INFO L89 Accepts]: Start accepts. Operand has 46 places, 24 transitions, 110 flow [2022-12-13 01:50:56,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:50:56,078 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:50:56,078 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 24 transitions, 110 flow [2022-12-13 01:50:56,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 24 transitions, 110 flow [2022-12-13 01:50:56,082 INFO L130 PetriNetUnfolder]: 5/50 cut-off events. [2022-12-13 01:50:56,082 INFO L131 PetriNetUnfolder]: For 25/26 co-relation queries the response was YES. [2022-12-13 01:50:56,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 50 events. 5/50 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 4 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 105. Up to 10 conditions per place. [2022-12-13 01:50:56,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 110 flow [2022-12-13 01:50:56,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 01:51:14,405 WARN L233 SmtUtils]: Spent 12.48s on a formula simplification that was a NOOP. DAG size: 264 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:51:14,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:51:14,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18331 [2022-12-13 01:51:14,408 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 106 flow [2022-12-13 01:51:14,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:51:14,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:51:14,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:51:14,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2022-12-13 01:51:14,408 INFO L420 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:51:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:51:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash 599856380, now seen corresponding path program 1 times [2022-12-13 01:51:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:51:14,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967037349] [2022-12-13 01:51:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:51:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:51:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:51:15,883 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-13 01:51:15,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:51:15,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967037349] [2022-12-13 01:51:15,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967037349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:51:15,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:51:15,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:51:15,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862693859] [2022-12-13 01:51:15,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:51:15,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:51:15,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:51:15,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:51:15,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:51:15,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 01:51:15,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 106 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:51:15,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:51:15,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 01:51:15,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:51:16,149 INFO L130 PetriNetUnfolder]: 59/171 cut-off events. [2022-12-13 01:51:16,149 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2022-12-13 01:51:16,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 171 events. 59/171 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 635 event pairs, 29 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 575. Up to 86 conditions per place. [2022-12-13 01:51:16,150 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 20 selfloop transitions, 4 changer transitions 33/57 dead transitions. [2022-12-13 01:51:16,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 354 flow [2022-12-13 01:51:16,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:51:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:51:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-12-13 01:51:16,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31521739130434784 [2022-12-13 01:51:16,151 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 106 flow. Second operand 8 states and 58 transitions. [2022-12-13 01:51:16,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 354 flow [2022-12-13 01:51:16,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 57 transitions, 312 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-12-13 01:51:16,153 INFO L231 Difference]: Finished difference. Result has 45 places, 24 transitions, 110 flow [2022-12-13 01:51:16,153 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=45, PETRI_TRANSITIONS=24} [2022-12-13 01:51:16,153 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2022-12-13 01:51:16,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:51:16,153 INFO L89 Accepts]: Start accepts. Operand has 45 places, 24 transitions, 110 flow [2022-12-13 01:51:16,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:51:16,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:51:16,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 24 transitions, 110 flow [2022-12-13 01:51:16,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 24 transitions, 110 flow [2022-12-13 01:51:16,158 INFO L130 PetriNetUnfolder]: 5/42 cut-off events. [2022-12-13 01:51:16,158 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 01:51:16,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 42 events. 5/42 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 4 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 91. Up to 8 conditions per place. [2022-12-13 01:51:16,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 110 flow [2022-12-13 01:51:16,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 01:52:24,038 WARN L233 SmtUtils]: Spent 1.13m on a formula simplification. DAG size of input: 273 DAG size of output: 271 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:52:29,829 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:52:29,829 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73676 [2022-12-13 01:52:29,829 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 106 flow [2022-12-13 01:52:29,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:52:29,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:52:29,830 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:52:29,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2022-12-13 01:52:29,830 INFO L420 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:52:29,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:52:29,830 INFO L85 PathProgramCache]: Analyzing trace with hash 630650677, now seen corresponding path program 1 times [2022-12-13 01:52:29,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:52:29,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317807905] [2022-12-13 01:52:29,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:52:29,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:52:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:52:31,274 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-13 01:52:31,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:52:31,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317807905] [2022-12-13 01:52:31,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317807905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:52:31,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:52:31,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 01:52:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989932308] [2022-12-13 01:52:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:52:31,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 01:52:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:52:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 01:52:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 01:52:31,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 01:52:31,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 106 flow. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:52:31,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:52:31,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 01:52:31,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:52:31,528 INFO L130 PetriNetUnfolder]: 59/171 cut-off events. [2022-12-13 01:52:31,529 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2022-12-13 01:52:31,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 171 events. 59/171 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 628 event pairs, 29 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 575. Up to 86 conditions per place. [2022-12-13 01:52:31,529 INFO L137 encePairwiseOnDemand]: 12/23 looper letters, 20 selfloop transitions, 4 changer transitions 33/57 dead transitions. [2022-12-13 01:52:31,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 354 flow [2022-12-13 01:52:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:52:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:52:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-12-13 01:52:31,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31521739130434784 [2022-12-13 01:52:31,530 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 106 flow. Second operand 8 states and 58 transitions. [2022-12-13 01:52:31,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 354 flow [2022-12-13 01:52:31,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 57 transitions, 312 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-12-13 01:52:31,530 INFO L231 Difference]: Finished difference. Result has 45 places, 24 transitions, 110 flow [2022-12-13 01:52:31,531 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=45, PETRI_TRANSITIONS=24} [2022-12-13 01:52:31,531 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2022-12-13 01:52:31,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:52:31,531 INFO L89 Accepts]: Start accepts. Operand has 45 places, 24 transitions, 110 flow [2022-12-13 01:52:31,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:52:31,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:52:31,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 24 transitions, 110 flow [2022-12-13 01:52:31,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 24 transitions, 110 flow [2022-12-13 01:52:31,535 INFO L130 PetriNetUnfolder]: 5/50 cut-off events. [2022-12-13 01:52:31,535 INFO L131 PetriNetUnfolder]: For 24/25 co-relation queries the response was YES. [2022-12-13 01:52:31,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 50 events. 5/50 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 108 event pairs, 4 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 105. Up to 10 conditions per place. [2022-12-13 01:52:31,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 110 flow [2022-12-13 01:52:31,536 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 01:53:56,957 WARN L233 SmtUtils]: Spent 1.33m on a formula simplification. DAG size of input: 286 DAG size of output: 284 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:54:32,315 WARN L233 SmtUtils]: Spent 35.36s on a formula simplification that was a NOOP. DAG size: 278 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:54:32,317 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:54:32,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120787 [2022-12-13 01:54:32,318 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 106 flow [2022-12-13 01:54:32,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:54:32,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:54:32,318 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:54:32,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2022-12-13 01:54:32,318 INFO L420 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 01:54:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:54:32,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1394288326, now seen corresponding path program 1 times [2022-12-13 01:54:32,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:54:32,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103514935] [2022-12-13 01:54:32,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:54:32,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:54:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:54:33,791 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-13 01:54:33,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:54:33,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103514935] [2022-12-13 01:54:33,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103514935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:54:33,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:54:33,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:54:33,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085775980] [2022-12-13 01:54:33,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:54:33,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:54:33,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:54:33,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:54:33,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:54:33,792 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-13 01:54:33,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 106 flow. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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-13 01:54:33,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:54:33,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-13 01:54:33,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:54:34,000 INFO L130 PetriNetUnfolder]: 59/171 cut-off events. [2022-12-13 01:54:34,000 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2022-12-13 01:54:34,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 171 events. 59/171 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 613 event pairs, 42 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 575. Up to 86 conditions per place. [2022-12-13 01:54:34,001 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 20 selfloop transitions, 4 changer transitions 28/52 dead transitions. [2022-12-13 01:54:34,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 326 flow [2022-12-13 01:54:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 01:54:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 01:54:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-12-13 01:54:34,001 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28804347826086957 [2022-12-13 01:54:34,001 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 106 flow. Second operand 8 states and 53 transitions. [2022-12-13 01:54:34,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 326 flow [2022-12-13 01:54:34,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 284 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-12-13 01:54:34,002 INFO L231 Difference]: Finished difference. Result has 44 places, 24 transitions, 106 flow [2022-12-13 01:54:34,002 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=24} [2022-12-13 01:54:34,003 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2022-12-13 01:54:34,003 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:54:34,003 INFO L89 Accepts]: Start accepts. Operand has 44 places, 24 transitions, 106 flow [2022-12-13 01:54:34,003 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:54:34,003 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:54:34,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 24 transitions, 106 flow [2022-12-13 01:54:34,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 24 transitions, 106 flow [2022-12-13 01:54:34,007 INFO L130 PetriNetUnfolder]: 5/50 cut-off events. [2022-12-13 01:54:34,008 INFO L131 PetriNetUnfolder]: For 23/24 co-relation queries the response was YES. [2022-12-13 01:54:34,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 50 events. 5/50 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 110 event pairs, 4 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 101. Up to 10 conditions per place. [2022-12-13 01:54:34,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 24 transitions, 106 flow [2022-12-13 01:54:34,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 01:55:26,199 WARN L233 SmtUtils]: Spent 52.18s on a formula simplification. DAG size of input: 286 DAG size of output: 284 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 01:55:48,339 WARN L233 SmtUtils]: Spent 22.14s on a formula simplification that was a NOOP. DAG size: 280 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) Received shutdown request... [2022-12-13 01:56:18,162 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 [2022-12-13 01:56:18,320 WARN L249 SmtUtils]: Removed 50 from assertion stack [2022-12-13 01:56:18,321 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 01:56:18,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2022-12-13 01:56:18,321 WARN L619 AbstractCegarLoop]: Verification canceled: while SimplifyDDAWithTimeout was simplifying term of DAG size 284 for 26517ms.. [2022-12-13 01:56:18,322 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 01:56:18,322 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 01:56:18,322 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 01:56:18,323 INFO L445 BasicCegarLoop]: Path program histogram: [6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:56:18,325 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:56:18,325 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:56:18,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:56:18 BasicIcfg [2022-12-13 01:56:18,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:56:18,326 INFO L158 Benchmark]: Toolchain (without parser) took 843377.27ms. Allocated memory was 196.1MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 161.9MB in the beginning and 475.8MB in the end (delta: -313.9MB). Peak memory consumption was 616.7MB. Max. memory is 8.0GB. [2022-12-13 01:56:18,327 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 196.1MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:56:18,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.86ms. Allocated memory is still 196.1MB. Free memory was 161.9MB in the beginning and 145.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 01:56:18,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.60ms. Allocated memory is still 196.1MB. Free memory was 145.1MB in the beginning and 142.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 01:56:18,327 INFO L158 Benchmark]: Boogie Preprocessor took 31.20ms. Allocated memory is still 196.1MB. Free memory was 142.5MB in the beginning and 140.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 01:56:18,329 INFO L158 Benchmark]: RCFGBuilder took 439.46ms. Allocated memory is still 196.1MB. Free memory was 140.9MB in the beginning and 115.2MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 01:56:18,329 INFO L158 Benchmark]: TraceAbstraction took 842591.65ms. Allocated memory was 196.1MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 114.2MB in the beginning and 475.8MB in the end (delta: -361.6MB). Peak memory consumption was 568.4MB. Max. memory is 8.0GB. [2022-12-13 01:56:18,330 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 196.1MB. Free memory is still 173.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.86ms. Allocated memory is still 196.1MB. Free memory was 161.9MB in the beginning and 145.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.60ms. Allocated memory is still 196.1MB. Free memory was 145.1MB in the beginning and 142.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.20ms. Allocated memory is still 196.1MB. Free memory was 142.5MB in the beginning and 140.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 439.46ms. Allocated memory is still 196.1MB. Free memory was 140.9MB in the beginning and 115.2MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 842591.65ms. Allocated memory was 196.1MB in the beginning and 1.1GB in the end (delta: 929.0MB). Free memory was 114.2MB in the beginning and 475.8MB in the end (delta: -361.6MB). Peak memory consumption was 568.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 162 PlacesBefore, 41 PlacesAfterwards, 159 TransitionsBefore, 32 TransitionsAfterwards, 1266 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 97 TrivialYvCompositions, 24 ConcurrentYvCompositions, 6 ChoiceCompositions, 127 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1198, independent: 1108, independent conditional: 1108, independent unconditional: 0, dependent: 90, dependent conditional: 90, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1198, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1198, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1198, independent: 1108, independent conditional: 0, independent unconditional: 1108, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 772, independent: 741, independent conditional: 0, independent unconditional: 741, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 772, independent: 732, independent conditional: 0, independent unconditional: 732, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1198, independent: 367, independent conditional: 0, independent unconditional: 367, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 772, unknown conditional: 0, unknown unconditional: 772] , Statistics on independence cache: Total cache size (in pairs): 1007, Positive cache size: 976, Positive conditional cache size: 0, Positive unconditional cache size: 976, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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: 1.7s, 38 PlacesBefore, 37 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 300, independent: 244, independent conditional: 244, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 300, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 300, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 300, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 146, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 146, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 300, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 146, unknown conditional: 0, unknown unconditional: 146] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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, 48 PlacesBefore, 46 PlacesAfterwards, 46 TransitionsBefore, 44 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 528, independent: 442, independent conditional: 442, independent unconditional: 0, dependent: 86, dependent conditional: 86, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 528, independent: 442, independent conditional: 101, independent unconditional: 341, dependent: 86, dependent conditional: 23, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 528, independent: 442, independent conditional: 55, independent unconditional: 387, dependent: 86, dependent conditional: 23, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 528, independent: 442, independent conditional: 55, independent unconditional: 387, dependent: 86, dependent conditional: 23, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, independent: 41, independent conditional: 9, independent unconditional: 32, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 11, dependent conditional: 7, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 12, dependent conditional: 9, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 528, independent: 401, independent conditional: 46, independent unconditional: 355, dependent: 75, dependent conditional: 16, dependent unconditional: 59, unknown: 52, unknown conditional: 16, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 181, Positive conditional cache size: 9, Positive unconditional cache size: 172, Negative cache size: 37, Negative conditional cache size: 7, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 63 PlacesBefore, 60 PlacesAfterwards, 80 TransitionsBefore, 77 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 827, independent: 783, independent conditional: 783, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 827, independent: 783, independent conditional: 441, independent unconditional: 342, dependent: 44, dependent conditional: 38, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 827, independent: 783, independent conditional: 349, independent unconditional: 434, dependent: 44, dependent conditional: 38, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 827, independent: 783, independent conditional: 349, independent unconditional: 434, dependent: 44, dependent conditional: 38, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 56, independent conditional: 28, independent unconditional: 28, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 827, independent: 727, independent conditional: 321, independent unconditional: 406, dependent: 40, dependent conditional: 34, dependent unconditional: 6, unknown: 60, unknown conditional: 32, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 278, Positive conditional cache size: 42, Positive unconditional cache size: 236, Negative cache size: 41, Negative conditional cache size: 11, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 61 PlacesBefore, 59 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 242, independent: 214, independent conditional: 214, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 242, independent: 214, independent conditional: 58, independent unconditional: 156, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 242, independent: 214, independent conditional: 16, independent unconditional: 198, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 242, independent: 214, independent conditional: 16, independent unconditional: 198, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 242, independent: 213, independent conditional: 16, independent unconditional: 197, dependent: 28, dependent conditional: 10, dependent unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 279, Positive conditional cache size: 42, Positive unconditional cache size: 237, Negative cache size: 41, Negative conditional cache size: 11, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 64 PlacesBefore, 62 PlacesAfterwards, 64 TransitionsBefore, 62 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, independent: 286, independent conditional: 286, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 315, independent: 286, independent conditional: 154, independent unconditional: 132, dependent: 29, dependent conditional: 23, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 326, independent: 286, independent conditional: 100, independent unconditional: 186, dependent: 40, dependent conditional: 34, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 326, independent: 286, independent conditional: 100, independent unconditional: 186, dependent: 40, dependent conditional: 34, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 9, independent unconditional: 3, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 326, independent: 274, independent conditional: 91, independent unconditional: 183, dependent: 36, dependent conditional: 30, dependent unconditional: 6, unknown: 16, unknown conditional: 13, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 351, Positive cache size: 306, Positive conditional cache size: 51, Positive unconditional cache size: 255, Negative cache size: 45, Negative conditional cache size: 15, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 54, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 73 PlacesAfterwards, 86 TransitionsBefore, 85 TransitionsAfterwards, 852 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 336, independent: 313, independent conditional: 313, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 336, independent: 313, independent conditional: 149, independent unconditional: 164, dependent: 23, dependent conditional: 21, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 336, independent: 313, independent conditional: 111, independent unconditional: 202, dependent: 23, dependent conditional: 21, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 336, independent: 313, independent conditional: 111, independent unconditional: 202, dependent: 23, dependent conditional: 21, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 336, independent: 313, independent conditional: 111, independent unconditional: 202, dependent: 22, dependent conditional: 20, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 382, Positive cache size: 336, Positive conditional cache size: 51, Positive unconditional cache size: 285, Negative cache size: 46, Negative conditional cache size: 16, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 798 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 74, independent: 64, independent conditional: 16, independent unconditional: 48, dependent: 10, dependent conditional: 9, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 10, dependent conditional: 9, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 10, dependent conditional: 9, dependent unconditional: 1, 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: 74, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 10, dependent conditional: 9, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 382, Positive cache size: 336, Positive conditional cache size: 51, Positive unconditional cache size: 285, Negative cache size: 46, Negative conditional cache size: 16, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 772 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 74, independent: 64, independent conditional: 16, independent unconditional: 48, dependent: 10, dependent conditional: 9, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 10, dependent conditional: 9, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 10, dependent conditional: 9, dependent unconditional: 1, 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: 74, independent: 64, independent conditional: 8, independent unconditional: 56, dependent: 10, dependent conditional: 9, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 382, Positive cache size: 336, Positive conditional cache size: 51, Positive unconditional cache size: 285, Negative cache size: 46, Negative conditional cache size: 16, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 82 PlacesAfterwards, 91 TransitionsBefore, 90 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, independent: 386, independent conditional: 386, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 430, independent: 386, independent conditional: 80, independent unconditional: 306, dependent: 44, dependent conditional: 42, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 462, independent: 386, independent conditional: 60, independent unconditional: 326, dependent: 76, dependent conditional: 74, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 462, independent: 386, independent conditional: 60, independent unconditional: 326, dependent: 76, dependent conditional: 74, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 462, independent: 384, independent conditional: 58, independent unconditional: 326, dependent: 73, dependent conditional: 71, dependent unconditional: 2, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 364, Positive conditional cache size: 53, Positive unconditional cache size: 311, Negative cache size: 49, Negative conditional cache size: 19, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 884 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 131, independent conditional: 131, 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: 147, independent: 131, independent conditional: 30, independent unconditional: 101, dependent: 16, dependent conditional: 15, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 131, independent conditional: 19, independent unconditional: 112, dependent: 32, dependent conditional: 31, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 131, independent conditional: 19, independent unconditional: 112, dependent: 32, dependent conditional: 31, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 163, independent: 131, independent conditional: 19, independent unconditional: 112, dependent: 31, dependent conditional: 30, dependent unconditional: 1, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 364, Positive conditional cache size: 53, Positive unconditional cache size: 311, Negative cache size: 50, Negative conditional cache size: 20, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 916 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 355, independent: 315, independent conditional: 315, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 355, independent: 315, independent conditional: 107, independent unconditional: 208, dependent: 40, dependent conditional: 38, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 391, independent: 315, independent conditional: 85, independent unconditional: 230, dependent: 76, dependent conditional: 74, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 391, independent: 315, independent conditional: 85, independent unconditional: 230, dependent: 76, dependent conditional: 74, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 391, independent: 309, independent conditional: 79, independent unconditional: 230, dependent: 73, dependent conditional: 71, dependent unconditional: 2, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 386, Positive conditional cache size: 59, Positive unconditional cache size: 327, Negative cache size: 53, Negative conditional cache size: 23, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 922 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 391, independent: 343, independent conditional: 343, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 391, independent: 343, independent conditional: 101, independent unconditional: 242, dependent: 48, dependent conditional: 46, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 431, independent: 343, independent conditional: 79, independent unconditional: 264, dependent: 88, dependent conditional: 86, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 431, independent: 343, independent conditional: 79, independent unconditional: 264, dependent: 88, dependent conditional: 86, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 7, 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: 8, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 431, independent: 336, independent conditional: 72, independent unconditional: 264, dependent: 87, dependent conditional: 85, dependent unconditional: 2, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 451, Positive cache size: 397, Positive conditional cache size: 66, Positive unconditional cache size: 331, Negative cache size: 54, Negative conditional cache size: 24, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 241, independent: 212, independent conditional: 212, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 241, independent: 212, independent conditional: 113, independent unconditional: 99, dependent: 29, dependent conditional: 12, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 250, independent: 212, independent conditional: 67, independent unconditional: 145, dependent: 38, dependent conditional: 21, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 250, independent: 212, independent conditional: 67, independent unconditional: 145, dependent: 38, dependent conditional: 21, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 250, independent: 212, independent conditional: 67, independent unconditional: 145, dependent: 36, dependent conditional: 19, dependent unconditional: 17, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 453, Positive cache size: 397, Positive conditional cache size: 66, Positive unconditional cache size: 331, Negative cache size: 56, Negative conditional cache size: 26, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 111 PlacesBefore, 109 PlacesAfterwards, 113 TransitionsBefore, 110 TransitionsAfterwards, 1204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 685, independent: 621, independent conditional: 621, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 685, independent: 621, independent conditional: 387, independent unconditional: 234, dependent: 64, dependent conditional: 28, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 707, independent: 621, independent conditional: 216, independent unconditional: 405, dependent: 86, dependent conditional: 50, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 707, independent: 621, independent conditional: 216, independent unconditional: 405, dependent: 86, dependent conditional: 50, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 707, independent: 612, independent conditional: 213, independent unconditional: 399, dependent: 84, dependent conditional: 48, dependent unconditional: 36, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 466, Positive cache size: 408, Positive conditional cache size: 70, Positive unconditional cache size: 338, Negative cache size: 58, Negative conditional cache size: 28, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 171, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 109 PlacesBefore, 110 PlacesAfterwards, 103 TransitionsBefore, 104 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 474, independent: 400, independent conditional: 400, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 474, independent: 400, independent conditional: 228, independent unconditional: 172, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 488, independent: 400, independent conditional: 141, independent unconditional: 259, dependent: 88, dependent conditional: 85, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 488, independent: 400, independent conditional: 141, independent unconditional: 259, dependent: 88, dependent conditional: 85, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 488, independent: 395, independent conditional: 140, independent unconditional: 255, dependent: 85, dependent conditional: 82, dependent unconditional: 3, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 484, Positive cache size: 423, Positive conditional cache size: 71, Positive unconditional cache size: 352, Negative cache size: 61, Negative conditional cache size: 31, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 111 PlacesBefore, 110 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 930 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 333, independent: 264, independent conditional: 264, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 333, independent: 264, independent conditional: 65, independent unconditional: 199, dependent: 69, dependent conditional: 60, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 333, independent: 264, independent conditional: 45, independent unconditional: 219, dependent: 69, dependent conditional: 60, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 333, independent: 264, independent conditional: 45, independent unconditional: 219, dependent: 69, dependent conditional: 60, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 0, dependent unconditional: 1, 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: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 333, independent: 264, independent conditional: 45, independent unconditional: 219, dependent: 68, dependent conditional: 60, dependent unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 427, Positive conditional cache size: 71, Positive unconditional cache size: 356, Negative cache size: 62, Negative conditional cache size: 31, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 114 PlacesBefore, 113 PlacesAfterwards, 107 TransitionsBefore, 106 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 196, independent: 162, independent conditional: 88, independent unconditional: 74, dependent: 34, dependent conditional: 8, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, independent: 162, independent conditional: 64, independent unconditional: 98, dependent: 34, dependent conditional: 8, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, independent: 162, independent conditional: 64, independent unconditional: 98, dependent: 34, dependent conditional: 8, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 2, independent unconditional: 4, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, independent: 156, independent conditional: 62, independent unconditional: 94, dependent: 33, dependent conditional: 7, dependent unconditional: 26, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 457, Positive conditional cache size: 73, Positive unconditional cache size: 384, Negative cache size: 63, Negative conditional cache size: 32, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 107 PlacesAfterwards, 101 TransitionsBefore, 100 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 290, independent: 260, independent conditional: 260, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 290, independent: 260, independent conditional: 108, independent unconditional: 152, dependent: 30, dependent conditional: 22, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 290, independent: 260, independent conditional: 84, independent unconditional: 176, dependent: 30, dependent conditional: 22, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 290, independent: 260, independent conditional: 84, independent unconditional: 176, dependent: 30, dependent conditional: 22, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 290, independent: 255, independent conditional: 80, independent unconditional: 175, dependent: 30, dependent conditional: 22, dependent unconditional: 8, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 549, Positive cache size: 486, Positive conditional cache size: 79, Positive unconditional cache size: 407, Negative cache size: 63, Negative conditional cache size: 32, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 868 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, independent: 171, independent conditional: 171, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 196, independent: 171, independent conditional: 67, independent unconditional: 104, dependent: 25, dependent conditional: 22, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, independent: 171, independent conditional: 61, independent unconditional: 110, dependent: 45, dependent conditional: 42, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, independent: 171, independent conditional: 61, independent unconditional: 110, dependent: 45, dependent conditional: 42, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 216, independent: 170, independent conditional: 60, independent unconditional: 110, dependent: 43, dependent conditional: 40, dependent unconditional: 3, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 552, Positive cache size: 487, Positive conditional cache size: 80, Positive unconditional cache size: 407, Negative cache size: 65, Negative conditional cache size: 34, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 854 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 144, independent: 121, independent conditional: 121, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 144, independent: 121, independent conditional: 40, independent unconditional: 81, dependent: 23, dependent conditional: 21, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 164, independent: 121, independent conditional: 37, independent unconditional: 84, dependent: 43, dependent conditional: 41, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 164, independent: 121, independent conditional: 37, independent unconditional: 84, dependent: 43, dependent conditional: 41, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 164, independent: 121, independent conditional: 37, independent unconditional: 84, dependent: 42, dependent conditional: 40, dependent unconditional: 2, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 553, Positive cache size: 487, Positive conditional cache size: 80, Positive unconditional cache size: 407, Negative cache size: 66, Negative conditional cache size: 35, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 141, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 141, independent: 106, independent conditional: 73, independent unconditional: 33, dependent: 35, dependent conditional: 33, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 106, independent conditional: 67, independent unconditional: 39, dependent: 81, dependent conditional: 79, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 106, independent conditional: 67, independent unconditional: 39, dependent: 81, dependent conditional: 79, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 187, independent: 101, independent conditional: 65, independent unconditional: 36, dependent: 78, dependent conditional: 76, dependent unconditional: 2, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 561, Positive cache size: 492, Positive conditional cache size: 82, Positive unconditional cache size: 410, Negative cache size: 69, Negative conditional cache size: 38, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 107 PlacesBefore, 106 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 788 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 374, independent: 314, independent conditional: 314, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 374, independent: 314, independent conditional: 122, independent unconditional: 192, dependent: 60, dependent conditional: 56, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 442, independent: 314, independent conditional: 89, independent unconditional: 225, dependent: 128, dependent conditional: 124, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 442, independent: 314, independent conditional: 89, independent unconditional: 225, dependent: 128, dependent conditional: 124, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 442, independent: 311, independent conditional: 87, independent unconditional: 224, dependent: 124, dependent conditional: 120, dependent unconditional: 4, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 588, Positive cache size: 515, Positive conditional cache size: 85, Positive unconditional cache size: 430, Negative cache size: 73, Negative conditional cache size: 42, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 113 PlacesBefore, 111 PlacesAfterwards, 105 TransitionsBefore, 103 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 517, independent: 455, independent conditional: 455, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 517, independent: 455, independent conditional: 181, independent unconditional: 274, dependent: 62, dependent conditional: 58, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 597, independent: 455, independent conditional: 177, independent unconditional: 278, dependent: 142, dependent conditional: 138, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 597, independent: 455, independent conditional: 177, independent unconditional: 278, dependent: 142, dependent conditional: 138, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 597, independent: 444, independent conditional: 166, independent unconditional: 278, dependent: 136, dependent conditional: 132, dependent unconditional: 4, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 631, Positive cache size: 552, Positive conditional cache size: 96, Positive unconditional cache size: 456, Negative cache size: 79, Negative conditional cache size: 48, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 91 PlacesBefore, 86 PlacesAfterwards, 72 TransitionsBefore, 67 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 279, independent: 272, independent conditional: 272, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 279, independent: 272, independent conditional: 158, independent unconditional: 114, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 283, independent: 272, independent conditional: 138, independent unconditional: 134, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 283, independent: 272, independent conditional: 138, independent unconditional: 134, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 14, independent conditional: 12, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 283, independent: 258, independent conditional: 126, independent unconditional: 132, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 17, unknown conditional: 15, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 914, Positive cache size: 832, Positive conditional cache size: 110, Positive unconditional cache size: 722, Negative cache size: 82, Negative conditional cache size: 51, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 84 PlacesBefore, 84 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 16, independent unconditional: 12, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 28, independent conditional: 12, independent unconditional: 16, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 28, independent conditional: 12, independent unconditional: 16, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 28, independent conditional: 12, independent unconditional: 16, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 929, Positive cache size: 846, Positive conditional cache size: 110, Positive unconditional cache size: 736, Negative cache size: 83, Negative conditional cache size: 52, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 89 PlacesBefore, 88 PlacesAfterwards, 73 TransitionsBefore, 72 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 944, Positive cache size: 860, Positive conditional cache size: 113, Positive unconditional cache size: 747, Negative cache size: 84, Negative conditional cache size: 53, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, 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: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 862, Positive conditional cache size: 115, Positive unconditional cache size: 747, Negative cache size: 88, Negative conditional cache size: 57, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 91 PlacesBefore, 90 PlacesAfterwards, 77 TransitionsBefore, 76 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 867, Positive conditional cache size: 117, Positive unconditional cache size: 750, Negative cache size: 89, Negative conditional cache size: 58, Negative unconditional cache size: 31, 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, 91 PlacesBefore, 91 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 957, Positive cache size: 867, Positive conditional cache size: 117, Positive unconditional cache size: 750, Negative cache size: 90, Negative conditional cache size: 59, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 94 PlacesBefore, 94 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 965, Positive cache size: 874, Positive conditional cache size: 123, Positive unconditional cache size: 751, Negative cache size: 91, Negative conditional cache size: 60, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 965, Positive cache size: 874, Positive conditional cache size: 123, Positive unconditional cache size: 751, Negative cache size: 91, Negative conditional cache size: 60, Negative unconditional cache size: 31, 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, 101 PlacesBefore, 99 PlacesAfterwards, 86 TransitionsBefore, 84 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 5, independent unconditional: 2, 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: 8, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 13, independent conditional: 7, independent unconditional: 6, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 996, Positive cache size: 904, Positive conditional cache size: 128, Positive unconditional cache size: 776, Negative cache size: 92, Negative conditional cache size: 61, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 97 PlacesBefore, 97 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 20, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 26, independent conditional: 16, independent unconditional: 10, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 26, independent conditional: 16, independent unconditional: 10, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 23, independent conditional: 15, independent unconditional: 8, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1007, Positive cache size: 914, Positive conditional cache size: 129, Positive unconditional cache size: 785, Negative cache size: 93, Negative conditional cache size: 62, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 96 PlacesBefore, 96 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 8, dependent conditional: 8, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1010, Positive cache size: 916, Positive conditional cache size: 131, Positive unconditional cache size: 785, Negative cache size: 94, Negative conditional cache size: 63, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1010, Positive cache size: 916, Positive conditional cache size: 131, Positive unconditional cache size: 785, Negative cache size: 94, Negative conditional cache size: 63, Negative unconditional cache size: 31, 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, 91 PlacesBefore, 91 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 916, Positive conditional cache size: 131, Positive unconditional cache size: 785, Negative cache size: 95, Negative conditional cache size: 64, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 86 PlacesBefore, 83 PlacesAfterwards, 68 TransitionsBefore, 67 TransitionsAfterwards, 418 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1011, Positive cache size: 916, Positive conditional cache size: 131, Positive unconditional cache size: 785, Negative cache size: 95, Negative conditional cache size: 64, Negative unconditional cache size: 31, 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, 85 PlacesBefore, 85 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, 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: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1020, Positive cache size: 924, Positive conditional cache size: 135, Positive unconditional cache size: 789, Negative cache size: 96, Negative conditional cache size: 65, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1024, Positive cache size: 926, Positive conditional cache size: 137, Positive unconditional cache size: 789, Negative cache size: 98, Negative conditional cache size: 67, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1025, Positive cache size: 926, Positive conditional cache size: 137, Positive unconditional cache size: 789, Negative cache size: 99, Negative conditional cache size: 68, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1026, Positive cache size: 926, Positive conditional cache size: 137, Positive unconditional cache size: 789, Negative cache size: 100, Negative conditional cache size: 69, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 107 PlacesBefore, 104 PlacesAfterwards, 93 TransitionsBefore, 92 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 9, 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: 10, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 947, Positive conditional cache size: 146, Positive unconditional cache size: 801, Negative cache size: 101, Negative conditional cache size: 70, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, 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): 1053, Positive cache size: 947, Positive conditional cache size: 146, Positive unconditional cache size: 801, Negative cache size: 106, Negative conditional cache size: 75, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1054, Positive cache size: 947, Positive conditional cache size: 146, Positive unconditional cache size: 801, Negative cache size: 107, Negative conditional cache size: 76, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1055, Positive cache size: 947, Positive conditional cache size: 146, Positive unconditional cache size: 801, Negative cache size: 108, Negative conditional cache size: 77, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1056, Positive cache size: 947, Positive conditional cache size: 146, Positive unconditional cache size: 801, Negative cache size: 109, Negative conditional cache size: 78, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1057, Positive cache size: 947, Positive conditional cache size: 146, Positive unconditional cache size: 801, Negative cache size: 110, Negative conditional cache size: 79, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1059, Positive cache size: 947, Positive conditional cache size: 146, Positive unconditional cache size: 801, Negative cache size: 112, Negative conditional cache size: 81, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 103 PlacesBefore, 103 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 3, dependent conditional: 3, 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: 27, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1068, Positive cache size: 956, Positive conditional cache size: 149, Positive unconditional cache size: 807, Negative cache size: 112, Negative conditional cache size: 81, Negative unconditional cache size: 31, 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, 93 PlacesBefore, 93 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1068, Positive cache size: 956, Positive conditional cache size: 149, Positive unconditional cache size: 807, Negative cache size: 112, Negative conditional cache size: 81, Negative unconditional cache size: 31, 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, 89 PlacesBefore, 89 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1074, Positive cache size: 962, Positive conditional cache size: 151, Positive unconditional cache size: 811, Negative cache size: 112, Negative conditional cache size: 81, Negative unconditional cache size: 31, 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, 92 PlacesBefore, 91 PlacesAfterwards, 75 TransitionsBefore, 74 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 2, dependent conditional: 2, 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: 13, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1084, Positive cache size: 972, Positive conditional cache size: 151, Positive unconditional cache size: 821, Negative cache size: 112, Negative conditional cache size: 81, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 96 PlacesBefore, 95 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 26, independent conditional: 24, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 24, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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: 28, independent: 24, independent conditional: 22, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1100, Positive cache size: 988, Positive conditional cache size: 154, Positive unconditional cache size: 834, Negative cache size: 112, Negative conditional cache size: 81, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1102, Positive cache size: 988, Positive conditional cache size: 154, Positive unconditional cache size: 834, Negative cache size: 114, Negative conditional cache size: 83, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 99 PlacesBefore, 99 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 22, independent conditional: 18, independent unconditional: 4, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 4, independent unconditional: 2, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 7, unknown conditional: 5, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1111, Positive cache size: 996, Positive conditional cache size: 158, Positive unconditional cache size: 838, Negative cache size: 115, Negative conditional cache size: 84, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 100 PlacesBefore, 100 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1112, Positive cache size: 996, Positive conditional cache size: 158, Positive unconditional cache size: 838, Negative cache size: 116, Negative conditional cache size: 85, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 1, dependent conditional: 1, 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: 6, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1112, Positive cache size: 996, Positive conditional cache size: 158, Positive unconditional cache size: 838, Negative cache size: 116, Negative conditional cache size: 85, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 89 PlacesBefore, 87 PlacesAfterwards, 68 TransitionsBefore, 67 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1112, Positive cache size: 996, Positive conditional cache size: 158, Positive unconditional cache size: 838, Negative cache size: 116, Negative conditional cache size: 85, Negative unconditional cache size: 31, 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: 1.0s, 83 PlacesBefore, 84 PlacesAfterwards, 69 TransitionsBefore, 76 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 31, independent conditional: 29, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 31, independent conditional: 29, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 33, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1118, Positive cache size: 1002, Positive conditional cache size: 162, Positive unconditional cache size: 840, Negative cache size: 116, Negative conditional cache size: 85, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1119, Positive cache size: 1002, Positive conditional cache size: 162, Positive unconditional cache size: 840, Negative cache size: 117, Negative conditional cache size: 86, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1119, Positive cache size: 1002, Positive conditional cache size: 162, Positive unconditional cache size: 840, Negative cache size: 117, Negative conditional cache size: 86, Negative unconditional cache size: 31, 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, 99 PlacesBefore, 99 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1120, Positive cache size: 1002, Positive conditional cache size: 162, Positive unconditional cache size: 840, Negative cache size: 118, Negative conditional cache size: 87, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 598 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1121, Positive cache size: 1002, Positive conditional cache size: 162, Positive unconditional cache size: 840, Negative cache size: 119, Negative conditional cache size: 88, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 105 PlacesBefore, 105 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1126, Positive cache size: 1006, Positive conditional cache size: 162, Positive unconditional cache size: 844, Negative cache size: 120, Negative conditional cache size: 89, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, 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): 1131, Positive cache size: 1006, Positive conditional cache size: 162, Positive unconditional cache size: 844, Negative cache size: 125, Negative conditional cache size: 94, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 109 PlacesBefore, 108 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1152, Positive cache size: 1026, Positive conditional cache size: 168, Positive unconditional cache size: 858, Negative cache size: 126, Negative conditional cache size: 95, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1153, Positive cache size: 1026, Positive conditional cache size: 168, Positive unconditional cache size: 858, Negative cache size: 127, Negative conditional cache size: 96, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1154, Positive cache size: 1026, Positive conditional cache size: 168, Positive unconditional cache size: 858, Negative cache size: 128, Negative conditional cache size: 97, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 110 PlacesBefore, 109 PlacesAfterwards, 91 TransitionsBefore, 90 TransitionsAfterwards, 588 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1174, Positive cache size: 1045, Positive conditional cache size: 173, Positive unconditional cache size: 872, Negative cache size: 129, Negative conditional cache size: 98, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 112 PlacesBefore, 112 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 16, independent unconditional: 6, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 22, independent conditional: 12, independent unconditional: 10, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 22, independent conditional: 12, independent unconditional: 10, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 15, independent conditional: 8, independent unconditional: 7, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1186, Positive cache size: 1055, Positive conditional cache size: 177, Positive unconditional cache size: 878, Negative cache size: 131, Negative conditional cache size: 100, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 108 PlacesBefore, 107 PlacesAfterwards, 90 TransitionsBefore, 89 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1189, Positive cache size: 1058, Positive conditional cache size: 180, Positive unconditional cache size: 878, Negative cache size: 131, Negative conditional cache size: 100, Negative unconditional cache size: 31, 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, 107 PlacesBefore, 107 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1189, Positive cache size: 1058, Positive conditional cache size: 180, Positive unconditional cache size: 878, Negative cache size: 131, Negative conditional cache size: 100, Negative unconditional cache size: 31, 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, 106 PlacesBefore, 106 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1198, Positive cache size: 1066, Positive conditional cache size: 180, Positive unconditional cache size: 886, Negative cache size: 132, Negative conditional cache size: 101, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1199, Positive cache size: 1066, Positive conditional cache size: 180, Positive unconditional cache size: 886, Negative cache size: 133, Negative conditional cache size: 102, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 102 PlacesBefore, 101 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1215, Positive cache size: 1082, Positive conditional cache size: 183, Positive unconditional cache size: 899, Negative cache size: 133, Negative conditional cache size: 102, Negative unconditional cache size: 31, 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.5s, 105 PlacesBefore, 104 PlacesAfterwards, 85 TransitionsBefore, 84 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 24, independent conditional: 22, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 24, independent conditional: 22, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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: 26, independent: 22, independent conditional: 20, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1087, Positive conditional cache size: 185, Positive unconditional cache size: 902, Negative cache size: 133, Negative conditional cache size: 102, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1087, Positive conditional cache size: 185, Positive unconditional cache size: 902, Negative cache size: 133, Negative conditional cache size: 102, Negative unconditional cache size: 31, 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, 81 TransitionsBefore, 81 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1087, Positive conditional cache size: 185, Positive unconditional cache size: 902, Negative cache size: 133, Negative conditional cache size: 102, Negative unconditional cache size: 31, 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, 104 PlacesBefore, 104 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1087, Positive conditional cache size: 185, Positive unconditional cache size: 902, Negative cache size: 133, Negative conditional cache size: 102, Negative unconditional cache size: 31, 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, 100 PlacesBefore, 100 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1221, Positive cache size: 1087, Positive conditional cache size: 185, Positive unconditional cache size: 902, Negative cache size: 134, Negative conditional cache size: 103, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 96 PlacesBefore, 93 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1221, Positive cache size: 1087, Positive conditional cache size: 185, Positive unconditional cache size: 902, Negative cache size: 134, Negative conditional cache size: 103, Negative unconditional cache size: 31, 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.5s, 96 PlacesBefore, 95 PlacesAfterwards, 88 TransitionsBefore, 87 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1237, Positive cache size: 1101, Positive conditional cache size: 185, Positive unconditional cache size: 916, Negative cache size: 136, Negative conditional cache size: 105, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, 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): 1242, Positive cache size: 1101, Positive conditional cache size: 185, Positive unconditional cache size: 916, Negative cache size: 141, Negative conditional cache size: 110, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 106 PlacesAfterwards, 93 TransitionsBefore, 92 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1247, Positive cache size: 1105, Positive conditional cache size: 185, Positive unconditional cache size: 920, Negative cache size: 142, Negative conditional cache size: 111, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 110 PlacesBefore, 107 PlacesAfterwards, 84 TransitionsBefore, 83 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 2, dependent conditional: 2, 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: 18, independent: 16, independent conditional: 14, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1261, Positive cache size: 1119, Positive conditional cache size: 185, Positive unconditional cache size: 934, Negative cache size: 142, Negative conditional cache size: 111, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1119, Positive conditional cache size: 185, Positive unconditional cache size: 934, Negative cache size: 143, Negative conditional cache size: 112, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 101 PlacesBefore, 100 PlacesAfterwards, 84 TransitionsBefore, 83 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 23, independent conditional: 18, independent unconditional: 5, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 23, independent conditional: 18, independent unconditional: 5, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1286, Positive cache size: 1142, Positive conditional cache size: 185, Positive unconditional cache size: 957, Negative cache size: 144, Negative conditional cache size: 113, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1287, Positive cache size: 1142, Positive conditional cache size: 185, Positive unconditional cache size: 957, Negative cache size: 145, Negative conditional cache size: 114, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 104 PlacesBefore, 103 PlacesAfterwards, 85 TransitionsBefore, 84 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1160, Positive conditional cache size: 185, Positive unconditional cache size: 975, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1160, Positive conditional cache size: 185, Positive unconditional cache size: 975, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, 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, 99 PlacesBefore, 99 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1160, Positive conditional cache size: 185, Positive unconditional cache size: 975, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, 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, 98 PlacesBefore, 98 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1160, Positive conditional cache size: 185, Positive unconditional cache size: 975, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, 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, 96 PlacesBefore, 96 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1160, Positive conditional cache size: 185, Positive unconditional cache size: 975, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, 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, 96 PlacesBefore, 96 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1160, Positive conditional cache size: 185, Positive unconditional cache size: 975, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, 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, 101 PlacesBefore, 101 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1310, Positive cache size: 1164, Positive conditional cache size: 185, Positive unconditional cache size: 979, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, 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, 103 PlacesBefore, 102 PlacesAfterwards, 80 TransitionsBefore, 79 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1322, Positive cache size: 1176, Positive conditional cache size: 185, Positive unconditional cache size: 991, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, 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, 81 TransitionsBefore, 81 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1322, Positive cache size: 1176, Positive conditional cache size: 185, Positive unconditional cache size: 991, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, 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, 106 PlacesBefore, 106 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 1, dependent conditional: 1, 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: 7, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1322, Positive cache size: 1176, Positive conditional cache size: 185, Positive unconditional cache size: 991, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 110 PlacesBefore, 110 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 2, dependent conditional: 2, 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: 2, independent unconditional: 1, 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: 11, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1332, Positive cache size: 1186, Positive conditional cache size: 187, Positive unconditional cache size: 999, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 111 PlacesBefore, 111 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1334, Positive cache size: 1188, Positive conditional cache size: 189, Positive unconditional cache size: 999, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, 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, 109 PlacesBefore, 109 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1334, Positive cache size: 1188, Positive conditional cache size: 189, Positive unconditional cache size: 999, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, 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, 107 PlacesBefore, 106 PlacesAfterwards, 79 TransitionsBefore, 78 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1341, Positive cache size: 1193, Positive conditional cache size: 189, Positive unconditional cache size: 1004, Negative cache size: 148, Negative conditional cache size: 117, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1341, Positive cache size: 1193, Positive conditional cache size: 189, Positive unconditional cache size: 1004, Negative cache size: 148, Negative conditional cache size: 117, Negative unconditional cache size: 31, 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: 2.9s, 100 PlacesBefore, 97 PlacesAfterwards, 73 TransitionsBefore, 72 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1341, Positive cache size: 1193, Positive conditional cache size: 189, Positive unconditional cache size: 1004, Negative cache size: 148, Negative conditional cache size: 117, Negative unconditional cache size: 31, 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, 98 PlacesBefore, 98 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 536 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1342, Positive cache size: 1193, Positive conditional cache size: 189, Positive unconditional cache size: 1004, Negative cache size: 149, Negative conditional cache size: 118, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 108 PlacesBefore, 106 PlacesAfterwards, 84 TransitionsBefore, 83 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 20, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1361, Positive cache size: 1212, Positive conditional cache size: 190, Positive unconditional cache size: 1022, Negative cache size: 149, Negative conditional cache size: 118, Negative unconditional cache size: 31, 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, 101 PlacesBefore, 101 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1361, Positive cache size: 1212, Positive conditional cache size: 190, Positive unconditional cache size: 1022, Negative cache size: 149, Negative conditional cache size: 118, Negative unconditional cache size: 31, 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, 103 PlacesBefore, 103 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1367, Positive cache size: 1216, Positive conditional cache size: 190, Positive unconditional cache size: 1026, Negative cache size: 151, Negative conditional cache size: 120, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 111 PlacesBefore, 110 PlacesAfterwards, 89 TransitionsBefore, 88 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1386, Positive cache size: 1234, Positive conditional cache size: 190, Positive unconditional cache size: 1044, Negative cache size: 152, Negative conditional cache size: 121, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 112 PlacesAfterwards, 89 TransitionsBefore, 88 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1399, Positive cache size: 1246, Positive conditional cache size: 190, Positive unconditional cache size: 1056, Negative cache size: 153, Negative conditional cache size: 122, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 114 PlacesBefore, 114 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1400, Positive cache size: 1246, Positive conditional cache size: 190, Positive unconditional cache size: 1056, Negative cache size: 154, Negative conditional cache size: 123, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 117 PlacesBefore, 117 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1401, Positive cache size: 1246, Positive conditional cache size: 190, Positive unconditional cache size: 1056, Negative cache size: 155, Negative conditional cache size: 124, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1402, Positive cache size: 1246, Positive conditional cache size: 190, Positive unconditional cache size: 1056, Negative cache size: 156, Negative conditional cache size: 125, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1403, Positive cache size: 1246, Positive conditional cache size: 190, Positive unconditional cache size: 1056, Negative cache size: 157, Negative conditional cache size: 126, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1403, Positive cache size: 1246, Positive conditional cache size: 190, Positive unconditional cache size: 1056, Negative cache size: 157, Negative conditional cache size: 126, Negative unconditional cache size: 31, 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: 2.0s, 99 PlacesBefore, 97 PlacesAfterwards, 73 TransitionsBefore, 72 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1403, Positive cache size: 1246, Positive conditional cache size: 190, Positive unconditional cache size: 1056, Negative cache size: 157, Negative conditional cache size: 126, Negative unconditional cache size: 31, 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, 98 PlacesBefore, 98 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1404, Positive cache size: 1246, Positive conditional cache size: 190, Positive unconditional cache size: 1056, Negative cache size: 158, Negative conditional cache size: 127, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 106 PlacesBefore, 104 PlacesAfterwards, 87 TransitionsBefore, 86 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1434, Positive cache size: 1274, Positive conditional cache size: 190, Positive unconditional cache size: 1084, Negative cache size: 160, Negative conditional cache size: 129, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 3, independent unconditional: 1, 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): 1439, Positive cache size: 1274, Positive conditional cache size: 190, Positive unconditional cache size: 1084, Negative cache size: 165, Negative conditional cache size: 134, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 104 PlacesBefore, 103 PlacesAfterwards, 86 TransitionsBefore, 85 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1458, Positive cache size: 1292, Positive conditional cache size: 190, Positive unconditional cache size: 1102, Negative cache size: 166, Negative conditional cache size: 135, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1459, Positive cache size: 1292, Positive conditional cache size: 190, Positive unconditional cache size: 1102, Negative cache size: 167, Negative conditional cache size: 136, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1459, Positive cache size: 1292, Positive conditional cache size: 190, Positive unconditional cache size: 1102, Negative cache size: 167, Negative conditional cache size: 136, Negative unconditional cache size: 31, 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, 105 PlacesBefore, 105 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1461, Positive cache size: 1293, Positive conditional cache size: 191, Positive unconditional cache size: 1102, Negative cache size: 168, Negative conditional cache size: 137, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1462, Positive cache size: 1293, Positive conditional cache size: 191, Positive unconditional cache size: 1102, Negative cache size: 169, Negative conditional cache size: 138, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1462, Positive cache size: 1293, Positive conditional cache size: 191, Positive unconditional cache size: 1102, Negative cache size: 169, Negative conditional cache size: 138, Negative unconditional cache size: 31, 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, 100 PlacesBefore, 100 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 10, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1466, Positive cache size: 1297, Positive conditional cache size: 191, Positive unconditional cache size: 1106, Negative cache size: 169, Negative conditional cache size: 138, Negative unconditional cache size: 31, 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, 98 PlacesBefore, 97 PlacesAfterwards, 78 TransitionsBefore, 77 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 2, dependent conditional: 2, 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: 21, independent: 19, independent conditional: 17, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1502, Positive cache size: 1333, Positive conditional cache size: 191, Positive unconditional cache size: 1142, Negative cache size: 169, Negative conditional cache size: 138, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 104 PlacesBefore, 103 PlacesAfterwards, 86 TransitionsBefore, 85 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 24, independent conditional: 22, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 24, independent conditional: 22, independent unconditional: 2, dependent: 2, dependent conditional: 2, 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: 26, independent: 24, independent conditional: 22, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1518, Positive cache size: 1349, Positive conditional cache size: 191, Positive unconditional cache size: 1158, Negative cache size: 169, Negative conditional cache size: 138, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 1, dependent conditional: 1, 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: 9, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1518, Positive cache size: 1349, Positive conditional cache size: 191, Positive unconditional cache size: 1158, Negative cache size: 169, Negative conditional cache size: 138, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1520, Positive cache size: 1349, Positive conditional cache size: 191, Positive unconditional cache size: 1158, Negative cache size: 171, Negative conditional cache size: 140, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 108 PlacesBefore, 108 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1522, Positive cache size: 1351, Positive conditional cache size: 193, Positive unconditional cache size: 1158, Negative cache size: 171, Negative conditional cache size: 140, Negative unconditional cache size: 31, 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, 106 PlacesBefore, 106 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1522, Positive cache size: 1351, Positive conditional cache size: 193, Positive unconditional cache size: 1158, Negative cache size: 171, Negative conditional cache size: 140, Negative unconditional cache size: 31, 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: 4.9s, 102 PlacesBefore, 102 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1524, Positive cache size: 1351, Positive conditional cache size: 193, Positive unconditional cache size: 1158, Negative cache size: 173, Negative conditional cache size: 142, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1524, Positive cache size: 1351, Positive conditional cache size: 193, Positive unconditional cache size: 1158, Negative cache size: 173, Negative conditional cache size: 142, Negative unconditional cache size: 31, 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, 98 PlacesBefore, 98 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1525, Positive cache size: 1351, Positive conditional cache size: 193, Positive unconditional cache size: 1158, Negative cache size: 174, Negative conditional cache size: 143, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1527, Positive cache size: 1351, Positive conditional cache size: 193, Positive unconditional cache size: 1158, Negative cache size: 176, Negative conditional cache size: 145, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1528, Positive cache size: 1351, Positive conditional cache size: 193, Positive unconditional cache size: 1158, Negative cache size: 177, Negative conditional cache size: 146, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1529, Positive cache size: 1351, Positive conditional cache size: 193, Positive unconditional cache size: 1158, Negative cache size: 178, Negative conditional cache size: 147, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1530, Positive cache size: 1351, Positive conditional cache size: 193, Positive unconditional cache size: 1158, Negative cache size: 179, Negative conditional cache size: 148, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 108 PlacesBefore, 107 PlacesAfterwards, 91 TransitionsBefore, 90 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 36, independent conditional: 36, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1554, Positive cache size: 1369, Positive conditional cache size: 193, Positive unconditional cache size: 1176, Negative cache size: 185, Negative conditional cache size: 154, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 5, independent conditional: 5, 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): 1559, Positive cache size: 1369, Positive conditional cache size: 193, Positive unconditional cache size: 1176, Negative cache size: 190, Negative conditional cache size: 159, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1562, Positive cache size: 1371, Positive conditional cache size: 195, Positive unconditional cache size: 1176, Negative cache size: 191, Negative conditional cache size: 160, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 116 PlacesBefore, 114 PlacesAfterwards, 91 TransitionsBefore, 90 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1581, Positive cache size: 1389, Positive conditional cache size: 195, Positive unconditional cache size: 1194, Negative cache size: 192, Negative conditional cache size: 161, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1582, Positive cache size: 1389, Positive conditional cache size: 195, Positive unconditional cache size: 1194, Negative cache size: 193, Negative conditional cache size: 162, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 112 PlacesBefore, 111 PlacesAfterwards, 91 TransitionsBefore, 90 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1601, Positive cache size: 1407, Positive conditional cache size: 195, Positive unconditional cache size: 1212, Negative cache size: 194, Negative conditional cache size: 163, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 112 PlacesBefore, 112 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1602, Positive cache size: 1407, Positive conditional cache size: 195, Positive unconditional cache size: 1212, Negative cache size: 195, Negative conditional cache size: 164, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1603, Positive cache size: 1407, Positive conditional cache size: 195, Positive unconditional cache size: 1212, Negative cache size: 196, Negative conditional cache size: 165, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1605, Positive cache size: 1407, Positive conditional cache size: 195, Positive unconditional cache size: 1212, Negative cache size: 198, Negative conditional cache size: 167, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 6, independent conditional: 5, independent unconditional: 1, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1606, Positive cache size: 1407, Positive conditional cache size: 195, Positive unconditional cache size: 1212, Negative cache size: 199, Negative conditional cache size: 168, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1606, Positive cache size: 1407, Positive conditional cache size: 195, Positive unconditional cache size: 1212, Negative cache size: 199, Negative conditional cache size: 168, Negative unconditional cache size: 31, 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, 103 PlacesBefore, 103 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1607, Positive cache size: 1407, Positive conditional cache size: 195, Positive unconditional cache size: 1212, Negative cache size: 200, Negative conditional cache size: 169, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1607, Positive cache size: 1407, Positive conditional cache size: 195, Positive unconditional cache size: 1212, Negative cache size: 200, Negative conditional cache size: 169, Negative unconditional cache size: 31, 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: 4.5s, 103 PlacesBefore, 101 PlacesAfterwards, 75 TransitionsBefore, 74 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1607, Positive cache size: 1407, Positive conditional cache size: 195, Positive unconditional cache size: 1212, Negative cache size: 200, Negative conditional cache size: 169, Negative unconditional cache size: 31, 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: 1.0s, 100 PlacesBefore, 101 PlacesAfterwards, 75 TransitionsBefore, 82 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 30, independent conditional: 26, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 30, independent conditional: 26, independent unconditional: 4, dependent: 2, dependent conditional: 2, 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: 4, independent unconditional: 1, 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: 32, independent: 25, independent conditional: 22, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1612, Positive cache size: 1412, Positive conditional cache size: 199, Positive unconditional cache size: 1213, Negative cache size: 200, Negative conditional cache size: 169, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1613, Positive cache size: 1412, Positive conditional cache size: 199, Positive unconditional cache size: 1213, Negative cache size: 201, Negative conditional cache size: 170, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 114 PlacesBefore, 114 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 518 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1621, Positive cache size: 1419, Positive conditional cache size: 199, Positive unconditional cache size: 1220, Negative cache size: 202, Negative conditional cache size: 171, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1622, Positive cache size: 1419, Positive conditional cache size: 199, Positive unconditional cache size: 1220, Negative cache size: 203, Negative conditional cache size: 172, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1624, Positive cache size: 1419, Positive conditional cache size: 199, Positive unconditional cache size: 1220, Negative cache size: 205, Negative conditional cache size: 174, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 118 PlacesBefore, 117 PlacesAfterwards, 95 TransitionsBefore, 94 TransitionsAfterwards, 546 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1647, Positive cache size: 1437, Positive conditional cache size: 199, Positive unconditional cache size: 1238, Negative cache size: 210, Negative conditional cache size: 179, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 117 PlacesBefore, 117 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1648, Positive cache size: 1437, Positive conditional cache size: 199, Positive unconditional cache size: 1238, Negative cache size: 211, Negative conditional cache size: 180, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 116 PlacesBefore, 116 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1649, Positive cache size: 1437, Positive conditional cache size: 199, Positive unconditional cache size: 1238, Negative cache size: 212, Negative conditional cache size: 181, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1649, Positive cache size: 1437, Positive conditional cache size: 199, Positive unconditional cache size: 1238, Negative cache size: 212, Negative conditional cache size: 181, Negative unconditional cache size: 31, 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, 110 PlacesBefore, 110 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1650, Positive cache size: 1437, Positive conditional cache size: 199, Positive unconditional cache size: 1238, Negative cache size: 213, Negative conditional cache size: 182, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 103 PlacesBefore, 103 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1650, Positive cache size: 1437, Positive conditional cache size: 199, Positive unconditional cache size: 1238, Negative cache size: 213, Negative conditional cache size: 182, Negative unconditional cache size: 31, 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: 6.0s, 100 PlacesBefore, 97 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1650, Positive cache size: 1437, Positive conditional cache size: 199, Positive unconditional cache size: 1238, Negative cache size: 213, Negative conditional cache size: 182, Negative unconditional cache size: 31, 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.2s, 100 PlacesBefore, 99 PlacesAfterwards, 84 TransitionsBefore, 83 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1673, Positive cache size: 1459, Positive conditional cache size: 199, Positive unconditional cache size: 1260, Negative cache size: 214, Negative conditional cache size: 183, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1674, Positive cache size: 1459, Positive conditional cache size: 199, Positive unconditional cache size: 1260, Negative cache size: 215, Negative conditional cache size: 184, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 116 PlacesBefore, 115 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 35, independent conditional: 30, independent unconditional: 5, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 35, independent conditional: 30, independent unconditional: 5, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 35, independent conditional: 30, independent unconditional: 5, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1699, Positive cache size: 1483, Positive conditional cache size: 199, Positive unconditional cache size: 1284, Negative cache size: 216, Negative conditional cache size: 185, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 119 PlacesBefore, 119 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 3, independent conditional: 3, 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): 1704, Positive cache size: 1483, Positive conditional cache size: 199, Positive unconditional cache size: 1284, Negative cache size: 221, Negative conditional cache size: 190, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 117 PlacesBefore, 117 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1705, Positive cache size: 1483, Positive conditional cache size: 199, Positive unconditional cache size: 1284, Negative cache size: 222, Negative conditional cache size: 191, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1705, Positive cache size: 1483, Positive conditional cache size: 199, Positive unconditional cache size: 1284, Negative cache size: 222, Negative conditional cache size: 191, Negative unconditional cache size: 31, 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, 116 PlacesBefore, 115 PlacesAfterwards, 90 TransitionsBefore, 89 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1718, Positive cache size: 1495, Positive conditional cache size: 199, Positive unconditional cache size: 1296, Negative cache size: 223, Negative conditional cache size: 192, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1718, Positive cache size: 1495, Positive conditional cache size: 199, Positive unconditional cache size: 1296, Negative cache size: 223, Negative conditional cache size: 192, Negative unconditional cache size: 31, 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, 102 PlacesBefore, 102 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1718, Positive cache size: 1495, Positive conditional cache size: 199, Positive unconditional cache size: 1296, Negative cache size: 223, Negative conditional cache size: 192, Negative unconditional cache size: 31, 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, 102 PlacesBefore, 102 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1718, Positive cache size: 1495, Positive conditional cache size: 199, Positive unconditional cache size: 1296, Negative cache size: 223, Negative conditional cache size: 192, Negative unconditional cache size: 31, 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: 15.7s, 99 PlacesBefore, 97 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1718, Positive cache size: 1495, Positive conditional cache size: 199, Positive unconditional cache size: 1296, Negative cache size: 223, Negative conditional cache size: 192, Negative unconditional cache size: 31, 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, 97 PlacesBefore, 97 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1718, Positive cache size: 1495, Positive conditional cache size: 199, Positive unconditional cache size: 1296, Negative cache size: 223, Negative conditional cache size: 192, Negative unconditional cache size: 31, 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, 103 PlacesBefore, 103 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 1718, Positive cache size: 1495, Positive conditional cache size: 199, Positive unconditional cache size: 1296, Negative cache size: 223, Negative conditional cache size: 192, Negative unconditional cache size: 31, 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, 112 PlacesBefore, 112 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1732, Positive cache size: 1507, Positive conditional cache size: 199, Positive unconditional cache size: 1308, Negative cache size: 225, Negative conditional cache size: 194, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 420 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1733, Positive cache size: 1507, Positive conditional cache size: 199, Positive unconditional cache size: 1308, Negative cache size: 226, Negative conditional cache size: 195, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, 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: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1733, Positive cache size: 1507, Positive conditional cache size: 199, Positive unconditional cache size: 1308, Negative cache size: 226, Negative conditional cache size: 195, Negative unconditional cache size: 31, 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: 20.1s, 100 PlacesBefore, 98 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1733, Positive cache size: 1507, Positive conditional cache size: 199, Positive unconditional cache size: 1308, Negative cache size: 226, Negative conditional cache size: 195, Negative unconditional cache size: 31, 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, 99 PlacesBefore, 98 PlacesAfterwards, 80 TransitionsBefore, 79 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 16, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1751, Positive cache size: 1525, Positive conditional cache size: 199, Positive unconditional cache size: 1326, Negative cache size: 226, Negative conditional cache size: 195, Negative unconditional cache size: 31, 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, 107 PlacesBefore, 107 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 420 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1753, Positive cache size: 1525, Positive conditional cache size: 199, Positive unconditional cache size: 1326, Negative cache size: 228, Negative conditional cache size: 197, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 110 PlacesBefore, 110 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 420 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1772, Positive cache size: 1541, Positive conditional cache size: 199, Positive unconditional cache size: 1342, Negative cache size: 231, Negative conditional cache size: 200, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 114 PlacesBefore, 114 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1773, Positive cache size: 1541, Positive conditional cache size: 199, Positive unconditional cache size: 1342, Negative cache size: 232, Negative conditional cache size: 201, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 115 PlacesBefore, 115 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1791, Positive cache size: 1554, Positive conditional cache size: 200, Positive unconditional cache size: 1354, Negative cache size: 237, Negative conditional cache size: 206, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 117 PlacesBefore, 117 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1792, Positive cache size: 1554, Positive conditional cache size: 200, Positive unconditional cache size: 1354, Negative cache size: 238, Negative conditional cache size: 207, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 103 PlacesBefore, 103 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 33, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 30, independent conditional: 27, independent unconditional: 3, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 30, independent conditional: 27, independent unconditional: 3, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 25, independent conditional: 22, independent unconditional: 3, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1836, Positive cache size: 1597, Positive conditional cache size: 205, Positive unconditional cache size: 1392, Negative cache size: 239, Negative conditional cache size: 208, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1837, Positive cache size: 1597, Positive conditional cache size: 205, Positive unconditional cache size: 1392, Negative cache size: 240, Negative conditional cache size: 209, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1839, Positive cache size: 1598, Positive conditional cache size: 206, Positive unconditional cache size: 1392, Negative cache size: 241, Negative conditional cache size: 210, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 82 PlacesBefore, 80 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 178 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1840, Positive cache size: 1598, Positive conditional cache size: 206, Positive unconditional cache size: 1392, Negative cache size: 242, Negative conditional cache size: 211, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1841, Positive cache size: 1598, Positive conditional cache size: 206, Positive unconditional cache size: 1392, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 75 PlacesBefore, 75 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 17, independent unconditional: 3, 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: 14, independent unconditional: 6, 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: 14, independent unconditional: 6, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 14, independent conditional: 8, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1870, Positive cache size: 1627, Positive conditional cache size: 212, Positive unconditional cache size: 1415, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 130 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): 1870, Positive cache size: 1627, Positive conditional cache size: 212, Positive unconditional cache size: 1415, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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.4s, 61 PlacesBefore, 59 PlacesAfterwards, 42 TransitionsBefore, 40 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 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: 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: 7, independent: 4, independent conditional: 4, 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): 1878, Positive cache size: 1635, Positive conditional cache size: 215, Positive unconditional cache size: 1420, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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, 56 PlacesBefore, 56 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 118 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): 1878, Positive cache size: 1635, Positive conditional cache size: 215, Positive unconditional cache size: 1420, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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, 58 PlacesBefore, 58 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 2, independent unconditional: 4, 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: 2, independent unconditional: 4, 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: 2, independent unconditional: 4, 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: 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: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1897, Positive cache size: 1654, Positive conditional cache size: 215, Positive unconditional cache size: 1439, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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: 17.6s, 53 PlacesBefore, 51 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 1897, Positive cache size: 1654, Positive conditional cache size: 215, Positive unconditional cache size: 1439, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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, 51 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 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): 1905, Positive cache size: 1662, Positive conditional cache size: 218, Positive unconditional cache size: 1444, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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.2s, 53 PlacesBefore, 52 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 5, independent conditional: 5, 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): 1924, Positive cache size: 1681, Positive conditional cache size: 225, Positive unconditional cache size: 1456, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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: 35.9s, 45 PlacesBefore, 42 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 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: 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: 6, independent: 3, independent conditional: 3, 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): 1931, Positive cache size: 1688, Positive conditional cache size: 228, Positive unconditional cache size: 1460, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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: 31.0s, 42 PlacesBefore, 41 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 1931, Positive cache size: 1688, Positive conditional cache size: 228, Positive unconditional cache size: 1460, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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.3s, 45 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 8, independent unconditional: 3, 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: 11, independent: 11, independent conditional: 8, independent unconditional: 3, 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: 11, independent: 11, independent conditional: 8, independent unconditional: 3, 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: 4, independent unconditional: 3, 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: 11, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1947, Positive cache size: 1704, Positive conditional cache size: 232, Positive unconditional cache size: 1472, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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: 63.2s, 43 PlacesBefore, 41 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 1947, Positive cache size: 1704, Positive conditional cache size: 232, Positive unconditional cache size: 1472, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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: 18.3s, 41 PlacesBefore, 40 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 1947, Positive cache size: 1704, Positive conditional cache size: 232, Positive unconditional cache size: 1472, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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: 73.7s, 41 PlacesBefore, 40 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 1947, Positive cache size: 1704, Positive conditional cache size: 232, Positive unconditional cache size: 1472, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, 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: 120.8s, 41 PlacesBefore, 40 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 1947, Positive cache size: 1704, Positive conditional cache size: 232, Positive unconditional cache size: 1472, Negative cache size: 243, Negative conditional cache size: 212, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 284 for 26517ms.. - TimeoutResultAtElement [Line: 155]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 284 for 26517ms.. - TimeoutResultAtElement [Line: 153]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 284 for 26517ms.. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 284 for 26517ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 201 locations, 4 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: 842.5s, OverallIterations: 209, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 105.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26949 SdHoareTripleChecker+Valid, 45.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26949 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 38.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 1709 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89936 IncrementalHoareTripleChecker+Invalid, 91645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1709 mSolverCounterUnsat, 14 mSDtfsCounter, 89936 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2771 GetRequests, 288 SyntacticMatches, 10 SemanticMatches, 2473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2888 ImplicationChecksByTransitivity, 30.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1330occurred in iteration=169, InterpolantAutomatonStates: 1842, 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.5s SsaConstructionTime, 7.4s SatisfiabilityAnalysisTime, 153.9s InterpolantComputationTime, 4758 NumberOfCodeBlocks, 4756 NumberOfCodeBlocksAsserted, 222 NumberOfCheckSat, 4536 ConstructedInterpolants, 18 QuantifiedInterpolants, 100339 SizeOfPredicates, 125 NumberOfNonLiveVariables, 4045 ConjunctsInSsa, 293 ConjunctsInUnsatCore, 222 InterpolantComputations, 209 PerfectInterpolantSequences, 13/26 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown