/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:29:19,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:29:19,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:29:19,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:29:19,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:29:19,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:29:19,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:29:19,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:29:19,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:29:19,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:29:19,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:29:19,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:29:19,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:29:19,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:29:19,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:29:19,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:29:19,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:29:19,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:29:19,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:29:19,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:29:19,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:29:19,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:29:19,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:29:19,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:29:19,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:29:19,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:29:19,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:29:19,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:29:19,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:29:19,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:29:19,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:29:19,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:29:19,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:29:19,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:29:19,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:29:19,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:29:19,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:29:19,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:29:19,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:29:19,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:29:19,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:29:19,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 10:29:19,861 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:29:19,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:29:19,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:29:19,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:29:19,863 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:29:19,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:29:19,864 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:29:19,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:29:19,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:29:19,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:29:19,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:29:19,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:29:19,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:29:19,865 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:29:19,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:29:19,865 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:29:19,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:29:19,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:29:19,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:29:19,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:29:19,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:29:19,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:29:19,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:29:19,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:29:19,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:29:19,866 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:29:19,866 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:29:19,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:29:19,866 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:29:19,866 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 10:29:20,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:29:20,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:29:20,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:29:20,160 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:29:20,160 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:29:20,161 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 10:29:21,104 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:29:21,283 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:29:21,284 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2022-12-13 10:29:21,289 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deef6fd07/90c87b93e21840e4a865633baf425f50/FLAG00b841109 [2022-12-13 10:29:21,301 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deef6fd07/90c87b93e21840e4a865633baf425f50 [2022-12-13 10:29:21,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:29:21,303 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:29:21,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:29:21,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:29:21,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:29:21,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d22994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21, skipping insertion in model container [2022-12-13 10:29:21,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:29:21,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:29:21,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,423 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,464 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 10:29:21,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:29:21,487 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:29:21,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:29:21,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:29:21,534 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 10:29:21,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:29:21,548 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:29:21,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21 WrapperNode [2022-12-13 10:29:21,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:29:21,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:29:21,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:29:21,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:29:21,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,597 INFO L138 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 235 [2022-12-13 10:29:21,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:29:21,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:29:21,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:29:21,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:29:21,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,630 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:29:21,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:29:21,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:29:21,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:29:21,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (1/1) ... [2022-12-13 10:29:21,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:29:21,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:29:21,665 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 10:29:21,672 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 10:29:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:29:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:29:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:29:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:29:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:29:21,696 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:29:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:29:21,696 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:29:21,696 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 10:29:21,696 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 10:29:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:29:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 10:29:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 10:29:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 10:29:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:29:21,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:29:21,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:29:21,699 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 10:29:21,780 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:29:21,782 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:29:22,041 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:29:22,117 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:29:22,118 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 10:29:22,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:29:22 BoogieIcfgContainer [2022-12-13 10:29:22,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:29:22,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:29:22,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:29:22,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:29:22,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:29:21" (1/3) ... [2022-12-13 10:29:22,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7747e4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:29:22, skipping insertion in model container [2022-12-13 10:29:22,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:29:21" (2/3) ... [2022-12-13 10:29:22,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7747e4b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:29:22, skipping insertion in model container [2022-12-13 10:29:22,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:29:22" (3/3) ... [2022-12-13 10:29:22,125 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2022-12-13 10:29:22,141 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:29:22,142 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:29:22,144 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:29:22,214 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 10:29:22,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 172 transitions, 368 flow [2022-12-13 10:29:22,305 INFO L130 PetriNetUnfolder]: 7/169 cut-off events. [2022-12-13 10:29:22,305 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:29:22,309 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 10:29:22,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 172 transitions, 368 flow [2022-12-13 10:29:22,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 159 transitions, 336 flow [2022-12-13 10:29:22,314 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:22,325 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 159 transitions, 336 flow [2022-12-13 10:29:22,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 159 transitions, 336 flow [2022-12-13 10:29:22,370 INFO L130 PetriNetUnfolder]: 7/159 cut-off events. [2022-12-13 10:29:22,370 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:29:22,371 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 10:29:22,373 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 159 transitions, 336 flow [2022-12-13 10:29:22,373 INFO L226 LiptonReduction]: Number of co-enabled transitions 1266 [2022-12-13 10:29:27,880 INFO L241 LiptonReduction]: Total number of compositions: 127 [2022-12-13 10:29:27,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:29:27,895 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;@9ad7d62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:29:27,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 10:29:27,901 INFO L130 PetriNetUnfolder]: 1/31 cut-off events. [2022-12-13 10:29:27,901 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:29:27,901 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:27,902 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 10:29:27,902 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 10:29:27,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:27,906 INFO L85 PathProgramCache]: Analyzing trace with hash -694790440, now seen corresponding path program 1 times [2022-12-13 10:29:27,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:27,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623274603] [2022-12-13 10:29:27,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:27,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:28,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 10:29:28,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:28,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623274603] [2022-12-13 10:29:28,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623274603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:28,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:28,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:29:28,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361029793] [2022-12-13 10:29:28,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:28,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:29:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:28,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:29:28,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:29:28,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 10:29:28,328 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 10:29:28,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:28,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 10:29:28,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:28,508 INFO L130 PetriNetUnfolder]: 934/1483 cut-off events. [2022-12-13 10:29:28,508 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 10:29:28,513 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 10:29:28,519 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 31 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-13 10:29:28,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 150 flow [2022-12-13 10:29:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:29:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:29:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-13 10:29:28,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-13 10:29:28,528 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 82 flow. Second operand 3 states and 34 transitions. [2022-12-13 10:29:28,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 150 flow [2022-12-13 10:29:28,533 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 10:29:28,535 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 82 flow [2022-12-13 10:29:28,536 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 10:29:28,539 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-12-13 10:29:28,539 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:28,539 INFO L89 Accepts]: Start accepts. Operand has 38 places, 33 transitions, 82 flow [2022-12-13 10:29:28,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:28,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:28,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 82 flow [2022-12-13 10:29:28,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 82 flow [2022-12-13 10:29:28,547 INFO L130 PetriNetUnfolder]: 1/33 cut-off events. [2022-12-13 10:29:28,547 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:29:28,548 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 10:29:28,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 82 flow [2022-12-13 10:29:28,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-13 10:29:30,015 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:29:30,016 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1477 [2022-12-13 10:29:30,016 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 78 flow [2022-12-13 10:29:30,016 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 10:29:30,016 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:30,016 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 10:29:30,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:29:30,017 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 10:29:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 274489270, now seen corresponding path program 1 times [2022-12-13 10:29:30,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:30,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683594204] [2022-12-13 10:29:30,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:30,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:30,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 10:29:30,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:30,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683594204] [2022-12-13 10:29:30,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683594204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:30,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:30,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:29:30,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835589298] [2022-12-13 10:29:30,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:30,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:29:30,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:30,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:29:30,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:29:30,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 10:29:30,179 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 10:29:30,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:30,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 10:29:30,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:30,476 INFO L130 PetriNetUnfolder]: 1344/2264 cut-off events. [2022-12-13 10:29:30,476 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-13 10:29:30,479 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 10:29:30,505 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 101 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2022-12-13 10:29:30,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 119 transitions, 500 flow [2022-12-13 10:29:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:29:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:29:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2022-12-13 10:29:30,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 10:29:30,509 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 78 flow. Second operand 9 states and 136 transitions. [2022-12-13 10:29:30,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 119 transitions, 500 flow [2022-12-13 10:29:30,510 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 10:29:30,512 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 166 flow [2022-12-13 10:29:30,512 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 10:29:30,513 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-13 10:29:30,513 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:30,514 INFO L89 Accepts]: Start accepts. Operand has 48 places, 46 transitions, 166 flow [2022-12-13 10:29:30,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:30,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:30,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions, 166 flow [2022-12-13 10:29:30,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions, 166 flow [2022-12-13 10:29:30,527 INFO L130 PetriNetUnfolder]: 10/89 cut-off events. [2022-12-13 10:29:30,527 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 10:29:30,528 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 10:29:30,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 46 transitions, 166 flow [2022-12-13 10:29:30,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-13 10:29:30,564 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 10:29:30,667 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:29:30,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 10:29:30,669 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 163 flow [2022-12-13 10:29:30,669 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 10:29:30,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:30,669 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 10:29:30,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:29:30,670 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 10:29:30,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1483630388, now seen corresponding path program 1 times [2022-12-13 10:29:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:30,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882150069] [2022-12-13 10:29:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:31,272 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 10:29:31,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:31,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882150069] [2022-12-13 10:29:31,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882150069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:31,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:31,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:29:31,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073768913] [2022-12-13 10:29:31,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:31,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:29:31,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:31,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:29:31,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:29:31,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-13 10:29:31,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 163 flow. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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 10:29:31,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:31,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-13 10:29:31,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:31,996 INFO L130 PetriNetUnfolder]: 3623/5956 cut-off events. [2022-12-13 10:29:31,996 INFO L131 PetriNetUnfolder]: For 2517/2517 co-relation queries the response was YES. [2022-12-13 10:29:32,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14477 conditions, 5956 events. 3623/5956 cut-off events. For 2517/2517 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 35457 event pairs, 809 based on Foata normal form. 2/5956 useless extension candidates. Maximal degree in co-relation 6936. Up to 1855 conditions per place. [2022-12-13 10:29:32,021 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 183 selfloop transitions, 21 changer transitions 28/232 dead transitions. [2022-12-13 10:29:32,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 232 transitions, 1327 flow [2022-12-13 10:29:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:29:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:29:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 174 transitions. [2022-12-13 10:29:32,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2022-12-13 10:29:32,025 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 163 flow. Second operand 12 states and 174 transitions. [2022-12-13 10:29:32,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 232 transitions, 1327 flow [2022-12-13 10:29:32,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 232 transitions, 1327 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 10:29:32,045 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 307 flow [2022-12-13 10:29:32,045 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=307, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2022-12-13 10:29:32,046 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2022-12-13 10:29:32,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:32,046 INFO L89 Accepts]: Start accepts. Operand has 64 places, 66 transitions, 307 flow [2022-12-13 10:29:32,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:32,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:32,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 66 transitions, 307 flow [2022-12-13 10:29:32,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 66 transitions, 307 flow [2022-12-13 10:29:32,085 INFO L130 PetriNetUnfolder]: 132/561 cut-off events. [2022-12-13 10:29:32,085 INFO L131 PetriNetUnfolder]: For 173/176 co-relation queries the response was YES. [2022-12-13 10:29:32,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 561 events. 132/561 cut-off events. For 173/176 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4075 event pairs, 18 based on Foata normal form. 1/532 useless extension candidates. Maximal degree in co-relation 1179. Up to 98 conditions per place. [2022-12-13 10:29:32,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 66 transitions, 307 flow [2022-12-13 10:29:32,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 838 [2022-12-13 10:29:35,602 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 10:29:35,638 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 10:29:35,678 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:29:35,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3633 [2022-12-13 10:29:35,679 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 65 transitions, 317 flow [2022-12-13 10:29:35,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 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 10:29:35,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:35,679 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 10:29:35,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:29:35,679 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 10:29:35,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash 379919014, now seen corresponding path program 1 times [2022-12-13 10:29:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:35,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865480427] [2022-12-13 10:29:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:35,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:36,086 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 10:29:36,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:36,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865480427] [2022-12-13 10:29:36,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865480427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:36,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:36,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:29:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128328128] [2022-12-13 10:29:36,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:36,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:29:36,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:36,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:29:36,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:29:36,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:29:36,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 65 transitions, 317 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 10:29:36,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:36,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:29:36,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:36,901 INFO L130 PetriNetUnfolder]: 4013/6794 cut-off events. [2022-12-13 10:29:36,901 INFO L131 PetriNetUnfolder]: For 5073/5073 co-relation queries the response was YES. [2022-12-13 10:29:36,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19903 conditions, 6794 events. 4013/6794 cut-off events. For 5073/5073 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 42844 event pairs, 959 based on Foata normal form. 2/6795 useless extension candidates. Maximal degree in co-relation 19851. Up to 3565 conditions per place. [2022-12-13 10:29:36,941 INFO L137 encePairwiseOnDemand]: 25/37 looper letters, 190 selfloop transitions, 21 changer transitions 31/242 dead transitions. [2022-12-13 10:29:36,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 242 transitions, 1565 flow [2022-12-13 10:29:36,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:29:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:29:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2022-12-13 10:29:36,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4275184275184275 [2022-12-13 10:29:36,943 INFO L175 Difference]: Start difference. First operand has 60 places, 65 transitions, 317 flow. Second operand 11 states and 174 transitions. [2022-12-13 10:29:36,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 242 transitions, 1565 flow [2022-12-13 10:29:37,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 242 transitions, 1535 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-13 10:29:37,018 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 443 flow [2022-12-13 10:29:37,018 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=443, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2022-12-13 10:29:37,020 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2022-12-13 10:29:37,020 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:37,020 INFO L89 Accepts]: Start accepts. Operand has 75 places, 75 transitions, 443 flow [2022-12-13 10:29:37,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:37,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:37,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 75 transitions, 443 flow [2022-12-13 10:29:37,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 75 transitions, 443 flow [2022-12-13 10:29:37,126 INFO L130 PetriNetUnfolder]: 181/839 cut-off events. [2022-12-13 10:29:37,126 INFO L131 PetriNetUnfolder]: For 587/613 co-relation queries the response was YES. [2022-12-13 10:29:37,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 839 events. 181/839 cut-off events. For 587/613 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7002 event pairs, 16 based on Foata normal form. 5/806 useless extension candidates. Maximal degree in co-relation 2030. Up to 153 conditions per place. [2022-12-13 10:29:37,134 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 75 transitions, 443 flow [2022-12-13 10:29:37,134 INFO L226 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-13 10:29:37,148 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 10:29:37,189 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 10:29:37,212 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 10:29:37,246 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:29:37,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-13 10:29:37,247 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 450 flow [2022-12-13 10:29:37,247 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 10:29:37,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:37,248 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 10:29:37,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:29:37,248 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 10:29:37,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1711398042, now seen corresponding path program 1 times [2022-12-13 10:29:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:37,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131940524] [2022-12-13 10:29:37,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:37,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:37,595 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 10:29:37,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:37,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131940524] [2022-12-13 10:29:37,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131940524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:37,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:37,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:29:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285132522] [2022-12-13 10:29:37,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:37,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:29:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:29:37,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:29:37,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:29:37,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 450 flow. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 10:29:37,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:37,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:29:37,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:38,298 INFO L130 PetriNetUnfolder]: 4295/7278 cut-off events. [2022-12-13 10:29:38,298 INFO L131 PetriNetUnfolder]: For 9320/9320 co-relation queries the response was YES. [2022-12-13 10:29:38,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23759 conditions, 7278 events. 4295/7278 cut-off events. For 9320/9320 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 46901 event pairs, 1062 based on Foata normal form. 2/7280 useless extension candidates. Maximal degree in co-relation 23734. Up to 5712 conditions per place. [2022-12-13 10:29:38,336 INFO L137 encePairwiseOnDemand]: 27/41 looper letters, 141 selfloop transitions, 29 changer transitions 16/186 dead transitions. [2022-12-13 10:29:38,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 186 transitions, 1347 flow [2022-12-13 10:29:38,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:29:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:29:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2022-12-13 10:29:38,337 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2022-12-13 10:29:38,337 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 450 flow. Second operand 8 states and 128 transitions. [2022-12-13 10:29:38,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 186 transitions, 1347 flow [2022-12-13 10:29:38,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 186 transitions, 1311 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-13 10:29:38,380 INFO L231 Difference]: Finished difference. Result has 75 places, 89 transitions, 620 flow [2022-12-13 10:29:38,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=620, PETRI_PLACES=75, PETRI_TRANSITIONS=89} [2022-12-13 10:29:38,382 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2022-12-13 10:29:38,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:38,382 INFO L89 Accepts]: Start accepts. Operand has 75 places, 89 transitions, 620 flow [2022-12-13 10:29:38,385 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:38,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:38,385 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 89 transitions, 620 flow [2022-12-13 10:29:38,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 89 transitions, 620 flow [2022-12-13 10:29:38,514 INFO L130 PetriNetUnfolder]: 257/1083 cut-off events. [2022-12-13 10:29:38,515 INFO L131 PetriNetUnfolder]: For 1180/1212 co-relation queries the response was YES. [2022-12-13 10:29:38,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3012 conditions, 1083 events. 257/1083 cut-off events. For 1180/1212 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9447 event pairs, 25 based on Foata normal form. 2/1038 useless extension candidates. Maximal degree in co-relation 2564. Up to 216 conditions per place. [2022-12-13 10:29:38,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 89 transitions, 620 flow [2022-12-13 10:29:38,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 992 [2022-12-13 10:29:38,538 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 10:29:38,591 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 10:29:38,609 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 10:29:38,631 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:29:38,632 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 250 [2022-12-13 10:29:38,632 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 88 transitions, 636 flow [2022-12-13 10:29:38,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 10:29:38,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:38,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, 1, 1, 1, 1, 1] [2022-12-13 10:29:38,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:29:38,632 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 10:29:38,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:38,633 INFO L85 PathProgramCache]: Analyzing trace with hash -954710382, now seen corresponding path program 2 times [2022-12-13 10:29:38,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:38,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106605141] [2022-12-13 10:29:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:39,019 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 10:29:39,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:39,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106605141] [2022-12-13 10:29:39,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106605141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:39,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:39,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:29:39,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121075724] [2022-12-13 10:29:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:39,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:29:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:39,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:29:39,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:29:39,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:29:39,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 88 transitions, 636 flow. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 10:29:39,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:39,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:29:39,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:39,919 INFO L130 PetriNetUnfolder]: 4471/7661 cut-off events. [2022-12-13 10:29:39,919 INFO L131 PetriNetUnfolder]: For 13533/13533 co-relation queries the response was YES. [2022-12-13 10:29:39,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26935 conditions, 7661 events. 4471/7661 cut-off events. For 13533/13533 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 50766 event pairs, 893 based on Foata normal form. 2/7663 useless extension candidates. Maximal degree in co-relation 19253. Up to 2215 conditions per place. [2022-12-13 10:29:39,960 INFO L137 encePairwiseOnDemand]: 23/45 looper letters, 186 selfloop transitions, 45 changer transitions 20/251 dead transitions. [2022-12-13 10:29:39,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 251 transitions, 1900 flow [2022-12-13 10:29:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:29:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:29:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2022-12-13 10:29:39,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3595959595959596 [2022-12-13 10:29:39,962 INFO L175 Difference]: Start difference. First operand has 74 places, 88 transitions, 636 flow. Second operand 11 states and 178 transitions. [2022-12-13 10:29:39,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 251 transitions, 1900 flow [2022-12-13 10:29:40,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 251 transitions, 1837 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-13 10:29:40,018 INFO L231 Difference]: Finished difference. Result has 83 places, 97 transitions, 827 flow [2022-12-13 10:29:40,019 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=827, PETRI_PLACES=83, PETRI_TRANSITIONS=97} [2022-12-13 10:29:40,019 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2022-12-13 10:29:40,019 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:40,019 INFO L89 Accepts]: Start accepts. Operand has 83 places, 97 transitions, 827 flow [2022-12-13 10:29:40,020 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:40,020 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:40,020 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 97 transitions, 827 flow [2022-12-13 10:29:40,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 97 transitions, 827 flow [2022-12-13 10:29:40,093 INFO L130 PetriNetUnfolder]: 271/1192 cut-off events. [2022-12-13 10:29:40,094 INFO L131 PetriNetUnfolder]: For 2135/2213 co-relation queries the response was YES. [2022-12-13 10:29:40,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3843 conditions, 1192 events. 271/1192 cut-off events. For 2135/2213 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 10829 event pairs, 22 based on Foata normal form. 7/1151 useless extension candidates. Maximal degree in co-relation 3787. Up to 228 conditions per place. [2022-12-13 10:29:40,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 97 transitions, 827 flow [2022-12-13 10:29:40,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 1036 [2022-12-13 10:29:40,108 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:40,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 10:29:40,112 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 97 transitions, 827 flow [2022-12-13 10:29:40,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 10:29:40,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:40,112 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 10:29:40,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 10:29:40,113 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 10:29:40,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:40,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1609773346, now seen corresponding path program 1 times [2022-12-13 10:29:40,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:40,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772409272] [2022-12-13 10:29:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:40,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:40,454 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 10:29:40,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:40,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772409272] [2022-12-13 10:29:40,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772409272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:40,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:40,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:29:40,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359429466] [2022-12-13 10:29:40,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:40,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:29:40,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:40,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:29:40,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:29:40,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:29:40,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 97 transitions, 827 flow. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 10:29:40,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:40,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:29:40,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:41,217 INFO L130 PetriNetUnfolder]: 4487/7721 cut-off events. [2022-12-13 10:29:41,218 INFO L131 PetriNetUnfolder]: For 18782/18782 co-relation queries the response was YES. [2022-12-13 10:29:41,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29252 conditions, 7721 events. 4487/7721 cut-off events. For 18782/18782 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 51635 event pairs, 1409 based on Foata normal form. 2/7723 useless extension candidates. Maximal degree in co-relation 29179. Up to 6315 conditions per place. [2022-12-13 10:29:41,256 INFO L137 encePairwiseOnDemand]: 26/45 looper letters, 143 selfloop transitions, 27 changer transitions 20/190 dead transitions. [2022-12-13 10:29:41,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 190 transitions, 1656 flow [2022-12-13 10:29:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:29:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:29:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2022-12-13 10:29:41,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40634920634920635 [2022-12-13 10:29:41,257 INFO L175 Difference]: Start difference. First operand has 81 places, 97 transitions, 827 flow. Second operand 7 states and 128 transitions. [2022-12-13 10:29:41,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 190 transitions, 1656 flow [2022-12-13 10:29:41,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 190 transitions, 1618 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 10:29:41,323 INFO L231 Difference]: Finished difference. Result has 85 places, 100 transitions, 909 flow [2022-12-13 10:29:41,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=909, PETRI_PLACES=85, PETRI_TRANSITIONS=100} [2022-12-13 10:29:41,324 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2022-12-13 10:29:41,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:41,324 INFO L89 Accepts]: Start accepts. Operand has 85 places, 100 transitions, 909 flow [2022-12-13 10:29:41,325 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:41,325 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:41,325 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 100 transitions, 909 flow [2022-12-13 10:29:41,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 100 transitions, 909 flow [2022-12-13 10:29:41,398 INFO L130 PetriNetUnfolder]: 266/1211 cut-off events. [2022-12-13 10:29:41,398 INFO L131 PetriNetUnfolder]: For 2288/2374 co-relation queries the response was YES. [2022-12-13 10:29:41,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3977 conditions, 1211 events. 266/1211 cut-off events. For 2288/2374 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11155 event pairs, 22 based on Foata normal form. 3/1164 useless extension candidates. Maximal degree in co-relation 3610. Up to 227 conditions per place. [2022-12-13 10:29:41,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 100 transitions, 909 flow [2022-12-13 10:29:41,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 1052 [2022-12-13 10:29:41,414 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [699] L100-->L106: Formula: (and (= v_~i2~0_114 v_~i~0_230) (= v_~i~0_229 (select (select |v_#memory_int_219| v_~f~0.base_148) (+ v_~f~0.offset_149 (* v_~i2~0_114 4))))) InVars {~i~0=v_~i~0_230, ~f~0.base=v_~f~0.base_148, #memory_int=|v_#memory_int_219|, ~f~0.offset=v_~f~0.offset_149} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_47|, ~i~0=v_~i~0_229, ~f~0.base=v_~f~0.base_148, #memory_int=|v_#memory_int_219|, ~i2~0=v_~i2~0_114, ~f~0.offset=v_~f~0.offset_149} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0, ~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 10:29:41,439 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:29:41,441 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 10:29:41,441 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 100 transitions, 920 flow [2022-12-13 10:29:41,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 10:29:41,442 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:41,442 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 10:29:41,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 10:29:41,442 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 10:29:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash -880038261, now seen corresponding path program 1 times [2022-12-13 10:29:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:41,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933379093] [2022-12-13 10:29:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:41,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:41,501 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 10:29:41,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:41,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933379093] [2022-12-13 10:29:41,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933379093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:41,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:41,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:29:41,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266456977] [2022-12-13 10:29:41,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:41,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:29:41,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:41,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:29:41,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:29:41,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 46 [2022-12-13 10:29:41,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 100 transitions, 920 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:41,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:41,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 46 [2022-12-13 10:29:41,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:42,024 INFO L130 PetriNetUnfolder]: 3813/6780 cut-off events. [2022-12-13 10:29:42,025 INFO L131 PetriNetUnfolder]: For 19013/19071 co-relation queries the response was YES. [2022-12-13 10:29:42,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26167 conditions, 6780 events. 3813/6780 cut-off events. For 19013/19071 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 46831 event pairs, 2642 based on Foata normal form. 22/6760 useless extension candidates. Maximal degree in co-relation 23769. Up to 6427 conditions per place. [2022-12-13 10:29:42,084 INFO L137 encePairwiseOnDemand]: 42/46 looper letters, 105 selfloop transitions, 5 changer transitions 0/113 dead transitions. [2022-12-13 10:29:42,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 113 transitions, 1232 flow [2022-12-13 10:29:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:29:42,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:29:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 10:29:42,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2022-12-13 10:29:42,085 INFO L175 Difference]: Start difference. First operand has 85 places, 100 transitions, 920 flow. Second operand 3 states and 59 transitions. [2022-12-13 10:29:42,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 113 transitions, 1232 flow [2022-12-13 10:29:42,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 113 transitions, 1139 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-13 10:29:42,150 INFO L231 Difference]: Finished difference. Result has 83 places, 100 transitions, 851 flow [2022-12-13 10:29:42,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=851, PETRI_PLACES=83, PETRI_TRANSITIONS=100} [2022-12-13 10:29:42,152 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2022-12-13 10:29:42,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:42,152 INFO L89 Accepts]: Start accepts. Operand has 83 places, 100 transitions, 851 flow [2022-12-13 10:29:42,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:42,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:42,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 100 transitions, 851 flow [2022-12-13 10:29:42,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 100 transitions, 851 flow [2022-12-13 10:29:42,246 INFO L130 PetriNetUnfolder]: 258/1214 cut-off events. [2022-12-13 10:29:42,247 INFO L131 PetriNetUnfolder]: For 2128/2156 co-relation queries the response was YES. [2022-12-13 10:29:42,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3861 conditions, 1214 events. 258/1214 cut-off events. For 2128/2156 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 11340 event pairs, 21 based on Foata normal form. 5/1171 useless extension candidates. Maximal degree in co-relation 3492. Up to 215 conditions per place. [2022-12-13 10:29:42,260 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 100 transitions, 851 flow [2022-12-13 10:29:42,260 INFO L226 LiptonReduction]: Number of co-enabled transitions 1016 [2022-12-13 10:29:42,532 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:29:42,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-13 10:29:42,534 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 99 transitions, 857 flow [2022-12-13 10:29:42,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:42,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:42,534 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] [2022-12-13 10:29:42,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 10:29:42,535 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 10:29:42,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:42,535 INFO L85 PathProgramCache]: Analyzing trace with hash -811549602, now seen corresponding path program 1 times [2022-12-13 10:29:42,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:42,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488298398] [2022-12-13 10:29:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:43,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 10:29:43,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:43,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488298398] [2022-12-13 10:29:43,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488298398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:43,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:43,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:29:43,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874109866] [2022-12-13 10:29:43,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:43,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:29:43,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:43,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:29:43,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:29:43,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:29:43,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 99 transitions, 857 flow. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:43,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:43,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:29:43,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:43,966 INFO L130 PetriNetUnfolder]: 4796/8553 cut-off events. [2022-12-13 10:29:43,966 INFO L131 PetriNetUnfolder]: For 23397/23397 co-relation queries the response was YES. [2022-12-13 10:29:43,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33047 conditions, 8553 events. 4796/8553 cut-off events. For 23397/23397 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 61693 event pairs, 1729 based on Foata normal form. 12/8561 useless extension candidates. Maximal degree in co-relation 30370. Up to 3990 conditions per place. [2022-12-13 10:29:44,013 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 196 selfloop transitions, 48 changer transitions 52/296 dead transitions. [2022-12-13 10:29:44,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 296 transitions, 2659 flow [2022-12-13 10:29:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:29:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:29:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 191 transitions. [2022-12-13 10:29:44,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47160493827160493 [2022-12-13 10:29:44,017 INFO L175 Difference]: Start difference. First operand has 82 places, 99 transitions, 857 flow. Second operand 9 states and 191 transitions. [2022-12-13 10:29:44,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 296 transitions, 2659 flow [2022-12-13 10:29:44,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 296 transitions, 2615 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 10:29:44,122 INFO L231 Difference]: Finished difference. Result has 93 places, 116 transitions, 1151 flow [2022-12-13 10:29:44,122 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1151, PETRI_PLACES=93, PETRI_TRANSITIONS=116} [2022-12-13 10:29:44,123 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2022-12-13 10:29:44,123 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:44,123 INFO L89 Accepts]: Start accepts. Operand has 93 places, 116 transitions, 1151 flow [2022-12-13 10:29:44,124 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:44,124 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:44,124 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 116 transitions, 1151 flow [2022-12-13 10:29:44,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 116 transitions, 1151 flow [2022-12-13 10:29:44,202 INFO L130 PetriNetUnfolder]: 241/1223 cut-off events. [2022-12-13 10:29:44,202 INFO L131 PetriNetUnfolder]: For 3106/3204 co-relation queries the response was YES. [2022-12-13 10:29:44,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4203 conditions, 1223 events. 241/1223 cut-off events. For 3106/3204 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11688 event pairs, 20 based on Foata normal form. 7/1174 useless extension candidates. Maximal degree in co-relation 3732. Up to 205 conditions per place. [2022-12-13 10:29:44,213 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 116 transitions, 1151 flow [2022-12-13 10:29:44,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 1072 [2022-12-13 10:29:44,214 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L100-->L106: Formula: (and (= v_~i2~0_112 v_~i~0_226) (= (select (select |v_#memory_int_217| v_~f~0.base_146) (+ v_~f~0.offset_147 (* v_~i2~0_112 4))) v_~i~0_225)) InVars {~i~0=v_~i~0_226, ~f~0.base=v_~f~0.base_146, #memory_int=|v_#memory_int_217|, ~f~0.offset=v_~f~0.offset_147} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_45|, ~i~0=v_~i~0_225, ~f~0.base=v_~f~0.base_146, #memory_int=|v_#memory_int_217|, ~i2~0=v_~i2~0_112, ~f~0.offset=v_~f~0.offset_147} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0, ~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 10:29:44,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [698] L100-->L106: Formula: (and (= v_~i2~0_112 v_~i~0_226) (= (select (select |v_#memory_int_217| v_~f~0.base_146) (+ v_~f~0.offset_147 (* v_~i2~0_112 4))) v_~i~0_225)) InVars {~i~0=v_~i~0_226, ~f~0.base=v_~f~0.base_146, #memory_int=|v_#memory_int_217|, ~f~0.offset=v_~f~0.offset_147} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_45|, ~i~0=v_~i~0_225, ~f~0.base=v_~f~0.base_146, #memory_int=|v_#memory_int_217|, ~i2~0=v_~i2~0_112, ~f~0.offset=v_~f~0.offset_147} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0, ~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 10:29:44,289 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:29:44,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 10:29:44,290 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 116 transitions, 1171 flow [2022-12-13 10:29:44,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:44,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:44,290 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 10:29:44,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 10:29:44,291 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 10:29:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash -521517892, now seen corresponding path program 1 times [2022-12-13 10:29:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:44,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524540512] [2022-12-13 10:29:44,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:44,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:44,399 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 10:29:44,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:44,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524540512] [2022-12-13 10:29:44,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524540512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:44,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:44,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:29:44,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073505181] [2022-12-13 10:29:44,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:44,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:29:44,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:44,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:29:44,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:29:44,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 10:29:44,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 116 transitions, 1171 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:44,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:44,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 10:29:44,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:45,349 INFO L130 PetriNetUnfolder]: 5143/9408 cut-off events. [2022-12-13 10:29:45,349 INFO L131 PetriNetUnfolder]: For 32407/32461 co-relation queries the response was YES. [2022-12-13 10:29:45,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38402 conditions, 9408 events. 5143/9408 cut-off events. For 32407/32461 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 71364 event pairs, 1597 based on Foata normal form. 68/9433 useless extension candidates. Maximal degree in co-relation 34875. Up to 6096 conditions per place. [2022-12-13 10:29:45,404 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 290 selfloop transitions, 17 changer transitions 6/315 dead transitions. [2022-12-13 10:29:45,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 315 transitions, 3692 flow [2022-12-13 10:29:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:29:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:29:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2022-12-13 10:29:45,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2022-12-13 10:29:45,405 INFO L175 Difference]: Start difference. First operand has 92 places, 116 transitions, 1171 flow. Second operand 9 states and 140 transitions. [2022-12-13 10:29:45,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 315 transitions, 3692 flow [2022-12-13 10:29:45,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 315 transitions, 3334 flow, removed 92 selfloop flow, removed 5 redundant places. [2022-12-13 10:29:45,611 INFO L231 Difference]: Finished difference. Result has 99 places, 129 transitions, 1177 flow [2022-12-13 10:29:45,612 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1177, PETRI_PLACES=99, PETRI_TRANSITIONS=129} [2022-12-13 10:29:45,612 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-12-13 10:29:45,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:45,613 INFO L89 Accepts]: Start accepts. Operand has 99 places, 129 transitions, 1177 flow [2022-12-13 10:29:45,613 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:45,613 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:45,613 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 129 transitions, 1177 flow [2022-12-13 10:29:45,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 129 transitions, 1177 flow [2022-12-13 10:29:45,719 INFO L130 PetriNetUnfolder]: 334/1850 cut-off events. [2022-12-13 10:29:45,719 INFO L131 PetriNetUnfolder]: For 4169/4290 co-relation queries the response was YES. [2022-12-13 10:29:45,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6056 conditions, 1850 events. 334/1850 cut-off events. For 4169/4290 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 19920 event pairs, 30 based on Foata normal form. 10/1789 useless extension candidates. Maximal degree in co-relation 4911. Up to 305 conditions per place. [2022-12-13 10:29:45,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 129 transitions, 1177 flow [2022-12-13 10:29:45,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 1298 [2022-12-13 10:29:45,740 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:45,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 10:29:45,740 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 129 transitions, 1177 flow [2022-12-13 10:29:45,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:45,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:45,741 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 10:29:45,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 10:29:45,741 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 10:29:45,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash 570225542, now seen corresponding path program 2 times [2022-12-13 10:29:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:45,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686800481] [2022-12-13 10:29:45,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:45,836 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 10:29:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:45,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686800481] [2022-12-13 10:29:45,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686800481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:45,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:45,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:29:45,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535656307] [2022-12-13 10:29:45,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:45,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:29:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:45,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:29:45,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:29:45,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 10:29:45,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 129 transitions, 1177 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:45,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:45,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 10:29:45,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:46,906 INFO L130 PetriNetUnfolder]: 5506/10337 cut-off events. [2022-12-13 10:29:46,906 INFO L131 PetriNetUnfolder]: For 33475/33533 co-relation queries the response was YES. [2022-12-13 10:29:46,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41767 conditions, 10337 events. 5506/10337 cut-off events. For 33475/33533 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 81604 event pairs, 1918 based on Foata normal form. 70/10361 useless extension candidates. Maximal degree in co-relation 32057. Up to 7165 conditions per place. [2022-12-13 10:29:46,965 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 313 selfloop transitions, 21 changer transitions 6/342 dead transitions. [2022-12-13 10:29:46,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 342 transitions, 3741 flow [2022-12-13 10:29:46,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:29:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:29:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2022-12-13 10:29:46,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3268398268398268 [2022-12-13 10:29:46,966 INFO L175 Difference]: Start difference. First operand has 99 places, 129 transitions, 1177 flow. Second operand 11 states and 151 transitions. [2022-12-13 10:29:46,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 342 transitions, 3741 flow [2022-12-13 10:29:47,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 342 transitions, 3739 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 10:29:47,082 INFO L231 Difference]: Finished difference. Result has 115 places, 138 transitions, 1330 flow [2022-12-13 10:29:47,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1330, PETRI_PLACES=115, PETRI_TRANSITIONS=138} [2022-12-13 10:29:47,082 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2022-12-13 10:29:47,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:47,082 INFO L89 Accepts]: Start accepts. Operand has 115 places, 138 transitions, 1330 flow [2022-12-13 10:29:47,083 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:47,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:47,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 138 transitions, 1330 flow [2022-12-13 10:29:47,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 138 transitions, 1330 flow [2022-12-13 10:29:47,236 INFO L130 PetriNetUnfolder]: 306/1998 cut-off events. [2022-12-13 10:29:47,236 INFO L131 PetriNetUnfolder]: For 5140/5292 co-relation queries the response was YES. [2022-12-13 10:29:47,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6673 conditions, 1998 events. 306/1998 cut-off events. For 5140/5292 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 22433 event pairs, 29 based on Foata normal form. 44/1974 useless extension candidates. Maximal degree in co-relation 5805. Up to 309 conditions per place. [2022-12-13 10:29:47,258 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 138 transitions, 1330 flow [2022-12-13 10:29:47,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 1430 [2022-12-13 10:29:47,262 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 10:29:47,292 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 10:29:47,313 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:29:47,314 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 232 [2022-12-13 10:29:47,314 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 137 transitions, 1330 flow [2022-12-13 10:29:47,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:47,314 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:47,314 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 10:29:47,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 10:29:47,314 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 10:29:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1344293528, now seen corresponding path program 3 times [2022-12-13 10:29:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:47,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115038167] [2022-12-13 10:29:47,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:47,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:47,419 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 10:29:47,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:47,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115038167] [2022-12-13 10:29:47,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115038167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:47,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:47,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:29:47,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559166885] [2022-12-13 10:29:47,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:47,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:29:47,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:47,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:29:47,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:29:47,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 44 [2022-12-13 10:29:47,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 137 transitions, 1330 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:47,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:47,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 44 [2022-12-13 10:29:47,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:48,648 INFO L130 PetriNetUnfolder]: 5404/10200 cut-off events. [2022-12-13 10:29:48,648 INFO L131 PetriNetUnfolder]: For 38842/38898 co-relation queries the response was YES. [2022-12-13 10:29:48,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43222 conditions, 10200 events. 5404/10200 cut-off events. For 38842/38898 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 80619 event pairs, 1778 based on Foata normal form. 69/10230 useless extension candidates. Maximal degree in co-relation 37807. Up to 6990 conditions per place. [2022-12-13 10:29:48,697 INFO L137 encePairwiseOnDemand]: 33/44 looper letters, 313 selfloop transitions, 20 changer transitions 0/335 dead transitions. [2022-12-13 10:29:48,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 335 transitions, 3751 flow [2022-12-13 10:29:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:29:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:29:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2022-12-13 10:29:48,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2022-12-13 10:29:48,709 INFO L175 Difference]: Start difference. First operand has 114 places, 137 transitions, 1330 flow. Second operand 10 states and 144 transitions. [2022-12-13 10:29:48,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 335 transitions, 3751 flow [2022-12-13 10:29:48,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 335 transitions, 3727 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 10:29:48,857 INFO L231 Difference]: Finished difference. Result has 123 places, 136 transitions, 1341 flow [2022-12-13 10:29:48,857 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1341, PETRI_PLACES=123, PETRI_TRANSITIONS=136} [2022-12-13 10:29:48,857 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 82 predicate places. [2022-12-13 10:29:48,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:48,858 INFO L89 Accepts]: Start accepts. Operand has 123 places, 136 transitions, 1341 flow [2022-12-13 10:29:48,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:48,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:48,859 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 136 transitions, 1341 flow [2022-12-13 10:29:48,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 136 transitions, 1341 flow [2022-12-13 10:29:48,985 INFO L130 PetriNetUnfolder]: 305/1999 cut-off events. [2022-12-13 10:29:48,985 INFO L131 PetriNetUnfolder]: For 5326/5448 co-relation queries the response was YES. [2022-12-13 10:29:48,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6857 conditions, 1999 events. 305/1999 cut-off events. For 5326/5448 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 22390 event pairs, 30 based on Foata normal form. 29/1955 useless extension candidates. Maximal degree in co-relation 5995. Up to 312 conditions per place. [2022-12-13 10:29:49,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 136 transitions, 1341 flow [2022-12-13 10:29:49,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 1404 [2022-12-13 10:29:49,010 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 [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 10:29:49,035 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:29:49,036 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-13 10:29:49,036 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 136 transitions, 1348 flow [2022-12-13 10:29:49,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:49,036 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:49,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, 1, 1, 1, 1] [2022-12-13 10:29:49,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 10:29:49,036 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 10:29:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 270058328, now seen corresponding path program 4 times [2022-12-13 10:29:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:49,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493996023] [2022-12-13 10:29:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:49,085 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 10:29:49,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:49,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493996023] [2022-12-13 10:29:49,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493996023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:49,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:49,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:29:49,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142757318] [2022-12-13 10:29:49,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:49,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:29:49,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:49,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:29:49,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:29:49,086 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 45 [2022-12-13 10:29:49,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 136 transitions, 1348 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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 10:29:49,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:49,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 45 [2022-12-13 10:29:49,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:49,775 INFO L130 PetriNetUnfolder]: 4133/7852 cut-off events. [2022-12-13 10:29:49,775 INFO L131 PetriNetUnfolder]: For 29327/29379 co-relation queries the response was YES. [2022-12-13 10:29:49,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32892 conditions, 7852 events. 4133/7852 cut-off events. For 29327/29379 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 59309 event pairs, 3035 based on Foata normal form. 46/7880 useless extension candidates. Maximal degree in co-relation 30960. Up to 7358 conditions per place. [2022-12-13 10:29:49,902 INFO L137 encePairwiseOnDemand]: 41/45 looper letters, 141 selfloop transitions, 11 changer transitions 0/154 dead transitions. [2022-12-13 10:29:49,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 154 transitions, 1765 flow [2022-12-13 10:29:49,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:29:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:29:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 10:29:49,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2022-12-13 10:29:49,903 INFO L175 Difference]: Start difference. First operand has 123 places, 136 transitions, 1348 flow. Second operand 3 states and 58 transitions. [2022-12-13 10:29:49,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 154 transitions, 1765 flow [2022-12-13 10:29:50,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 154 transitions, 1711 flow, removed 3 selfloop flow, removed 11 redundant places. [2022-12-13 10:29:50,005 INFO L231 Difference]: Finished difference. Result has 113 places, 132 transitions, 1274 flow [2022-12-13 10:29:50,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1274, PETRI_PLACES=113, PETRI_TRANSITIONS=132} [2022-12-13 10:29:50,006 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2022-12-13 10:29:50,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:50,006 INFO L89 Accepts]: Start accepts. Operand has 113 places, 132 transitions, 1274 flow [2022-12-13 10:29:50,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:50,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:50,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 132 transitions, 1274 flow [2022-12-13 10:29:50,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 132 transitions, 1274 flow [2022-12-13 10:29:50,105 INFO L130 PetriNetUnfolder]: 207/1479 cut-off events. [2022-12-13 10:29:50,105 INFO L131 PetriNetUnfolder]: For 3448/3561 co-relation queries the response was YES. [2022-12-13 10:29:50,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4821 conditions, 1479 events. 207/1479 cut-off events. For 3448/3561 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15603 event pairs, 22 based on Foata normal form. 16/1438 useless extension candidates. Maximal degree in co-relation 4283. Up to 222 conditions per place. [2022-12-13 10:29:50,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 132 transitions, 1274 flow [2022-12-13 10:29:50,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 1192 [2022-12-13 10:29:50,311 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 10:29:50,335 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [717] L88-->L59: Formula: (and (= v_~e1~0_164 0) (= v_~e2~0_221 0) (= v_~n2~0_298 (+ v_~tmp2~0_151 1)) (= (+ v_~tmp1~0_167 1) v_~n1~0_315)) InVars {~tmp2~0=v_~tmp2~0_151, ~tmp1~0=v_~tmp1~0_167} OutVars{~n2~0=v_~n2~0_298, ~n1~0=v_~n1~0_315, ~tmp2~0=v_~tmp2~0_151, ~tmp1~0=v_~tmp1~0_167, ~e2~0=v_~e2~0_221, ~e1~0=v_~e1~0_164} 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 10:29:50,388 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:29:50,389 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 383 [2022-12-13 10:29:50,389 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 133 transitions, 1302 flow [2022-12-13 10:29:50,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 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 10:29:50,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:50,390 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 10:29:50,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 10:29:50,390 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 10:29:50,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2021775394, now seen corresponding path program 1 times [2022-12-13 10:29:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:50,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393827880] [2022-12-13 10:29:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:50,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:50,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 10:29:50,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:50,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393827880] [2022-12-13 10:29:50,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393827880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:50,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:50,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:29:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189502004] [2022-12-13 10:29:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:50,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:29:50,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:50,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:29:50,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:29:50,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 47 [2022-12-13 10:29:50,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 133 transitions, 1302 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 10:29:50,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:50,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 47 [2022-12-13 10:29:50,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:51,146 INFO L130 PetriNetUnfolder]: 2766/5414 cut-off events. [2022-12-13 10:29:51,147 INFO L131 PetriNetUnfolder]: For 19054/19090 co-relation queries the response was YES. [2022-12-13 10:29:51,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22942 conditions, 5414 events. 2766/5414 cut-off events. For 19054/19090 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 39460 event pairs, 1082 based on Foata normal form. 63/5453 useless extension candidates. Maximal degree in co-relation 20929. Up to 4540 conditions per place. [2022-12-13 10:29:51,181 INFO L137 encePairwiseOnDemand]: 34/47 looper letters, 174 selfloop transitions, 14 changer transitions 14/204 dead transitions. [2022-12-13 10:29:51,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 204 transitions, 2211 flow [2022-12-13 10:29:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:29:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:29:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2022-12-13 10:29:51,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29521276595744683 [2022-12-13 10:29:51,182 INFO L175 Difference]: Start difference. First operand has 114 places, 133 transitions, 1302 flow. Second operand 8 states and 111 transitions. [2022-12-13 10:29:51,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 204 transitions, 2211 flow [2022-12-13 10:29:51,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 204 transitions, 2168 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 10:29:51,246 INFO L231 Difference]: Finished difference. Result has 119 places, 129 transitions, 1254 flow [2022-12-13 10:29:51,246 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1254, PETRI_PLACES=119, PETRI_TRANSITIONS=129} [2022-12-13 10:29:51,246 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 10:29:51,246 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:51,246 INFO L89 Accepts]: Start accepts. Operand has 119 places, 129 transitions, 1254 flow [2022-12-13 10:29:51,247 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:51,247 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:51,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 129 transitions, 1254 flow [2022-12-13 10:29:51,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 129 transitions, 1254 flow [2022-12-13 10:29:51,312 INFO L130 PetriNetUnfolder]: 145/1032 cut-off events. [2022-12-13 10:29:51,312 INFO L131 PetriNetUnfolder]: For 2490/2572 co-relation queries the response was YES. [2022-12-13 10:29:51,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3433 conditions, 1032 events. 145/1032 cut-off events. For 2490/2572 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9974 event pairs, 19 based on Foata normal form. 8/994 useless extension candidates. Maximal degree in co-relation 3162. Up to 144 conditions per place. [2022-12-13 10:29:51,323 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 129 transitions, 1254 flow [2022-12-13 10:29:51,324 INFO L226 LiptonReduction]: Number of co-enabled transitions 1038 [2022-12-13 10:29:51,338 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 [715] L88-->L97: Formula: (and (= v_~n2~0_294 (+ v_~tmp2~0_147 1)) (= v_~e2~0_217 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_97|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97| (ite (= (mod v_~e1~0_160 256) 0) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_97| 0))) InVars {~tmp2~0=v_~tmp2~0_147, ~e1~0=v_~e1~0_160} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_97|, ~n2~0=v_~n2~0_294, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_97|, ~tmp2~0=v_~tmp2~0_147, ~e2~0=v_~e2~0_217, ~e1~0=v_~e1~0_160} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~e2~0] [2022-12-13 10:29:51,436 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 [718] L88-->L97: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_107| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_107|) (= (ite (= (mod v_~e1~0_176 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_107|) (= (+ v_~tmp2~0_153 1) v_~n2~0_306) (= v_~e1~0_176 0) (= (+ v_~tmp1~0_175 1) v_~n1~0_326) (= v_~e2~0_223 0)) InVars {~tmp2~0=v_~tmp2~0_153, ~tmp1~0=v_~tmp1~0_175} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_107|, ~n2~0=v_~n2~0_306, ~n1~0=v_~n1~0_326, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_107|, ~tmp2~0=v_~tmp2~0_153, ~tmp1~0=v_~tmp1~0_175, ~e2~0=v_~e2~0_223, ~e1~0=v_~e1~0_176} 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 10:29:51,491 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 10:29:51,509 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [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] [2022-12-13 10:29:51,548 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:29:51,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 303 [2022-12-13 10:29:51,549 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 126 transitions, 1254 flow [2022-12-13 10:29:51,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 10:29:51,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:51,550 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] [2022-12-13 10:29:51,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 10:29:51,550 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 10:29:51,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1142913099, now seen corresponding path program 1 times [2022-12-13 10:29:51,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:51,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60575426] [2022-12-13 10:29:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:51,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:52,167 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 10:29:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:52,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60575426] [2022-12-13 10:29:52,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60575426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:52,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:52,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:29:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208685683] [2022-12-13 10:29:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:52,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:29:52,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:52,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:29:52,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:29:52,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:29:52,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 126 transitions, 1254 flow. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:52,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:52,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:29:52,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:53,227 INFO L130 PetriNetUnfolder]: 3092/5948 cut-off events. [2022-12-13 10:29:53,227 INFO L131 PetriNetUnfolder]: For 21680/21680 co-relation queries the response was YES. [2022-12-13 10:29:53,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24698 conditions, 5948 events. 3092/5948 cut-off events. For 21680/21680 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 42713 event pairs, 1484 based on Foata normal form. 22/5970 useless extension candidates. Maximal degree in co-relation 23269. Up to 1871 conditions per place. [2022-12-13 10:29:53,261 INFO L137 encePairwiseOnDemand]: 34/49 looper letters, 54 selfloop transitions, 0 changer transitions 246/300 dead transitions. [2022-12-13 10:29:53,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 300 transitions, 3259 flow [2022-12-13 10:29:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:29:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:29:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2022-12-13 10:29:53,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2022-12-13 10:29:53,273 INFO L175 Difference]: Start difference. First operand has 113 places, 126 transitions, 1254 flow. Second operand 10 states and 189 transitions. [2022-12-13 10:29:53,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 300 transitions, 3259 flow [2022-12-13 10:29:53,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 300 transitions, 3084 flow, removed 48 selfloop flow, removed 6 redundant places. [2022-12-13 10:29:53,338 INFO L231 Difference]: Finished difference. Result has 120 places, 54 transitions, 362 flow [2022-12-13 10:29:53,338 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=362, PETRI_PLACES=120, PETRI_TRANSITIONS=54} [2022-12-13 10:29:53,339 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 79 predicate places. [2022-12-13 10:29:53,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:53,339 INFO L89 Accepts]: Start accepts. Operand has 120 places, 54 transitions, 362 flow [2022-12-13 10:29:53,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:53,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:53,340 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 54 transitions, 362 flow [2022-12-13 10:29:53,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 54 transitions, 362 flow [2022-12-13 10:29:53,352 INFO L130 PetriNetUnfolder]: 30/211 cut-off events. [2022-12-13 10:29:53,352 INFO L131 PetriNetUnfolder]: For 295/296 co-relation queries the response was YES. [2022-12-13 10:29:53,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 211 events. 30/211 cut-off events. For 295/296 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1244 event pairs, 11 based on Foata normal form. 1/197 useless extension candidates. Maximal degree in co-relation 536. Up to 46 conditions per place. [2022-12-13 10:29:53,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 54 transitions, 362 flow [2022-12-13 10:29:53,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 10:29:53,362 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:29:53,363 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 10:29:53,363 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 54 transitions, 362 flow [2022-12-13 10:29:53,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:53,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:53,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, 1, 1, 1, 1, 1] [2022-12-13 10:29:53,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 10:29:53,364 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 10:29:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:53,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1760931971, now seen corresponding path program 1 times [2022-12-13 10:29:53,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:53,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313113568] [2022-12-13 10:29:53,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:54,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 10:29:54,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:54,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313113568] [2022-12-13 10:29:54,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313113568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:54,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:54,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 10:29:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305071572] [2022-12-13 10:29:54,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:54,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:29:54,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:54,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:29:54,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:29:54,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:29:54,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 54 transitions, 362 flow. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 10:29:54,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:54,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:29:54,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:55,310 INFO L130 PetriNetUnfolder]: 2496/4391 cut-off events. [2022-12-13 10:29:55,310 INFO L131 PetriNetUnfolder]: For 11760/11760 co-relation queries the response was YES. [2022-12-13 10:29:55,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16059 conditions, 4391 events. 2496/4391 cut-off events. For 11760/11760 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 27024 event pairs, 556 based on Foata normal form. 4/4395 useless extension candidates. Maximal degree in co-relation 15971. Up to 1551 conditions per place. [2022-12-13 10:29:55,338 INFO L137 encePairwiseOnDemand]: 25/37 looper letters, 214 selfloop transitions, 24 changer transitions 30/268 dead transitions. [2022-12-13 10:29:55,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 268 transitions, 2256 flow [2022-12-13 10:29:55,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:29:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:29:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 215 transitions. [2022-12-13 10:29:55,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48423423423423423 [2022-12-13 10:29:55,348 INFO L175 Difference]: Start difference. First operand has 82 places, 54 transitions, 362 flow. Second operand 12 states and 215 transitions. [2022-12-13 10:29:55,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 268 transitions, 2256 flow [2022-12-13 10:29:55,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 268 transitions, 1975 flow, removed 116 selfloop flow, removed 16 redundant places. [2022-12-13 10:29:55,371 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 497 flow [2022-12-13 10:29:55,371 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=497, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2022-12-13 10:29:55,371 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2022-12-13 10:29:55,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:55,371 INFO L89 Accepts]: Start accepts. Operand has 85 places, 74 transitions, 497 flow [2022-12-13 10:29:55,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:55,372 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:55,372 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 74 transitions, 497 flow [2022-12-13 10:29:55,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 74 transitions, 497 flow [2022-12-13 10:29:55,404 INFO L130 PetriNetUnfolder]: 91/566 cut-off events. [2022-12-13 10:29:55,404 INFO L131 PetriNetUnfolder]: For 682/698 co-relation queries the response was YES. [2022-12-13 10:29:55,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 566 events. 91/566 cut-off events. For 682/698 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4613 event pairs, 24 based on Foata normal form. 2/532 useless extension candidates. Maximal degree in co-relation 1513. Up to 130 conditions per place. [2022-12-13 10:29:55,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 74 transitions, 497 flow [2022-12-13 10:29:55,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 732 [2022-12-13 10:29:55,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [706] L59-->L68: Formula: (and (not (= (ite (= (mod v_~e2~0_204 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128| (ite (or (= v_~n2~0_257 0) (<= v_~n1~0_247 v_~n2~0_257)) 1 0)) (= v_~i1~0_114 v_~i~0_251) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128| 0))) InVars {~n2~0=v_~n2~0_257, ~i~0=v_~i~0_251, ~n1~0=v_~n1~0_247, ~e2~0=v_~e2~0_204} OutVars{~n2~0=v_~n2~0_257, ~i~0=v_~i~0_251, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128|, ~n1~0=v_~n1~0_247, ~i1~0=v_~i1~0_114, ~e2~0=v_~e2~0_204, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, 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 10:29:55,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [706] L59-->L68: Formula: (and (not (= (ite (= (mod v_~e2~0_204 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128| (ite (or (= v_~n2~0_257 0) (<= v_~n1~0_247 v_~n2~0_257)) 1 0)) (= v_~i1~0_114 v_~i~0_251) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128| 0))) InVars {~n2~0=v_~n2~0_257, ~i~0=v_~i~0_251, ~n1~0=v_~n1~0_247, ~e2~0=v_~e2~0_204} OutVars{~n2~0=v_~n2~0_257, ~i~0=v_~i~0_251, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128|, ~n1~0=v_~n1~0_247, ~i1~0=v_~i1~0_114, ~e2~0=v_~e2~0_204, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, 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 10:29:55,584 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 10:29:55,624 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:29:55,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 254 [2022-12-13 10:29:55,625 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 495 flow [2022-12-13 10:29:55,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 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 10:29:55,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:55,625 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 10:29:55,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 10:29:55,625 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 10:29:55,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2108998833, now seen corresponding path program 1 times [2022-12-13 10:29:55,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:55,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156485534] [2022-12-13 10:29:55,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:55,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:56,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 10:29:56,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:56,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156485534] [2022-12-13 10:29:56,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156485534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:56,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:56,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:29:56,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509183552] [2022-12-13 10:29:56,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:56,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:29:56,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:56,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:29:56,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:29:56,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 10:29:56,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 495 flow. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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 10:29:56,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:56,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 10:29:56,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:56,665 INFO L130 PetriNetUnfolder]: 2600/4583 cut-off events. [2022-12-13 10:29:56,665 INFO L131 PetriNetUnfolder]: For 9714/9714 co-relation queries the response was YES. [2022-12-13 10:29:56,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17120 conditions, 4583 events. 2600/4583 cut-off events. For 9714/9714 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 28731 event pairs, 648 based on Foata normal form. 4/4587 useless extension candidates. Maximal degree in co-relation 17069. Up to 1838 conditions per place. [2022-12-13 10:29:56,690 INFO L137 encePairwiseOnDemand]: 27/41 looper letters, 172 selfloop transitions, 25 changer transitions 25/222 dead transitions. [2022-12-13 10:29:56,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 222 transitions, 1867 flow [2022-12-13 10:29:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:29:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:29:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2022-12-13 10:29:56,691 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45528455284552843 [2022-12-13 10:29:56,691 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 495 flow. Second operand 9 states and 168 transitions. [2022-12-13 10:29:56,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 222 transitions, 1867 flow [2022-12-13 10:29:56,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 222 transitions, 1781 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-12-13 10:29:56,730 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 602 flow [2022-12-13 10:29:56,731 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2022-12-13 10:29:56,731 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2022-12-13 10:29:56,731 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:56,731 INFO L89 Accepts]: Start accepts. Operand has 88 places, 82 transitions, 602 flow [2022-12-13 10:29:56,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:56,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:56,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 82 transitions, 602 flow [2022-12-13 10:29:56,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 602 flow [2022-12-13 10:29:56,769 INFO L130 PetriNetUnfolder]: 127/700 cut-off events. [2022-12-13 10:29:56,770 INFO L131 PetriNetUnfolder]: For 877/905 co-relation queries the response was YES. [2022-12-13 10:29:56,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 700 events. 127/700 cut-off events. For 877/905 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5943 event pairs, 21 based on Foata normal form. 4/664 useless extension candidates. Maximal degree in co-relation 1934. Up to 139 conditions per place. [2022-12-13 10:29:56,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 82 transitions, 602 flow [2022-12-13 10:29:56,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 762 [2022-12-13 10:29:56,793 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 10:29:56,841 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 10:29:56,865 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [727] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| (ite (or (= v_~n2~0_362 0) (<= v_~n1~0_377 v_~n2~0_362)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|) (= v_~i1~0_142 v_~i~0_304) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156| 0)) (not (= (ite (= (mod v_~e2~0_256 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_264| v_~f~0.base_184) (+ v_~f~0.offset_183 (* v_~i1~0_142 4))) v_~i~0_303)) InVars {~n2~0=v_~n2~0_362, ~i~0=v_~i~0_304, ~f~0.base=v_~f~0.base_184, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256} OutVars{~n2~0=v_~n2~0_362, ~i~0=v_~i~0_303, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156|, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~i1~0=v_~i1~0_142, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_50|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|} 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 10:29:56,921 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [727] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| (ite (or (= v_~n2~0_362 0) (<= v_~n1~0_377 v_~n2~0_362)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|) (= v_~i1~0_142 v_~i~0_304) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156| 0)) (not (= (ite (= (mod v_~e2~0_256 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_264| v_~f~0.base_184) (+ v_~f~0.offset_183 (* v_~i1~0_142 4))) v_~i~0_303)) InVars {~n2~0=v_~n2~0_362, ~i~0=v_~i~0_304, ~f~0.base=v_~f~0.base_184, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256} OutVars{~n2~0=v_~n2~0_362, ~i~0=v_~i~0_303, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156|, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~i1~0=v_~i1~0_142, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_50|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|} 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 [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 10:29:56,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [727] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| (ite (or (= v_~n2~0_362 0) (<= v_~n1~0_377 v_~n2~0_362)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|) (= v_~i1~0_142 v_~i~0_304) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156| 0)) (not (= (ite (= (mod v_~e2~0_256 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_264| v_~f~0.base_184) (+ v_~f~0.offset_183 (* v_~i1~0_142 4))) v_~i~0_303)) InVars {~n2~0=v_~n2~0_362, ~i~0=v_~i~0_304, ~f~0.base=v_~f~0.base_184, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256} OutVars{~n2~0=v_~n2~0_362, ~i~0=v_~i~0_303, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156|, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~i1~0=v_~i1~0_142, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_50|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|} 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 [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 10:29:57,043 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:29:57,044 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 313 [2022-12-13 10:29:57,044 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 630 flow [2022-12-13 10:29:57,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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 10:29:57,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:57,045 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] [2022-12-13 10:29:57,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 10:29:57,045 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 10:29:57,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1992673486, now seen corresponding path program 1 times [2022-12-13 10:29:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:57,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654647682] [2022-12-13 10:29:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:57,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:29:57,546 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 10:29:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:29:57,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654647682] [2022-12-13 10:29:57,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654647682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:29:57,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:29:57,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:29:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827810984] [2022-12-13 10:29:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:29:57,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:29:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:29:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:29:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:29:57,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 10:29:57,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 630 flow. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:57,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:29:57,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 10:29:57,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:29:58,296 INFO L130 PetriNetUnfolder]: 2766/4965 cut-off events. [2022-12-13 10:29:58,296 INFO L131 PetriNetUnfolder]: For 12586/12586 co-relation queries the response was YES. [2022-12-13 10:29:58,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18972 conditions, 4965 events. 2766/4965 cut-off events. For 12586/12586 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 32663 event pairs, 698 based on Foata normal form. 4/4969 useless extension candidates. Maximal degree in co-relation 18920. Up to 2778 conditions per place. [2022-12-13 10:29:58,320 INFO L137 encePairwiseOnDemand]: 26/48 looper letters, 176 selfloop transitions, 36 changer transitions 15/227 dead transitions. [2022-12-13 10:29:58,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 227 transitions, 1980 flow [2022-12-13 10:29:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:29:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:29:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2022-12-13 10:29:58,321 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36875 [2022-12-13 10:29:58,321 INFO L175 Difference]: Start difference. First operand has 86 places, 81 transitions, 630 flow. Second operand 10 states and 177 transitions. [2022-12-13 10:29:58,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 227 transitions, 1980 flow [2022-12-13 10:29:58,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 227 transitions, 1919 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-13 10:29:58,362 INFO L231 Difference]: Finished difference. Result has 95 places, 91 transitions, 784 flow [2022-12-13 10:29:58,362 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=784, PETRI_PLACES=95, PETRI_TRANSITIONS=91} [2022-12-13 10:29:58,362 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2022-12-13 10:29:58,362 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:29:58,362 INFO L89 Accepts]: Start accepts. Operand has 95 places, 91 transitions, 784 flow [2022-12-13 10:29:58,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:29:58,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:29:58,363 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 91 transitions, 784 flow [2022-12-13 10:29:58,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 91 transitions, 784 flow [2022-12-13 10:29:58,408 INFO L130 PetriNetUnfolder]: 125/795 cut-off events. [2022-12-13 10:29:58,409 INFO L131 PetriNetUnfolder]: For 1509/1541 co-relation queries the response was YES. [2022-12-13 10:29:58,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 795 events. 125/795 cut-off events. For 1509/1541 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7215 event pairs, 25 based on Foata normal form. 10/759 useless extension candidates. Maximal degree in co-relation 2349. Up to 151 conditions per place. [2022-12-13 10:29:58,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 91 transitions, 784 flow [2022-12-13 10:29:58,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 858 [2022-12-13 10:29:58,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [727] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| (ite (or (= v_~n2~0_362 0) (<= v_~n1~0_377 v_~n2~0_362)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|) (= v_~i1~0_142 v_~i~0_304) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156| 0)) (not (= (ite (= (mod v_~e2~0_256 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_264| v_~f~0.base_184) (+ v_~f~0.offset_183 (* v_~i1~0_142 4))) v_~i~0_303)) InVars {~n2~0=v_~n2~0_362, ~i~0=v_~i~0_304, ~f~0.base=v_~f~0.base_184, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256} OutVars{~n2~0=v_~n2~0_362, ~i~0=v_~i~0_303, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156|, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~i1~0=v_~i1~0_142, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_50|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|} 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 [730] L100-->thread3EXIT: Formula: (let ((.cse0 (select |v_#memory_int_278| v_~f~0.base_200))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_198 (* v_~j~0_178 4))))) (and (= v_~j~0_177 (select .cse0 (+ v_~f~0.offset_198 (* 4 .cse1)))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_38|) (= |v_thread3Thread1of1ForFork0_#res#1.base_34| 0) (= |v_thread3Thread1of1ForFork0_#res#1.offset_34| 0) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38| (ite (and (< .cse1 v_~n~0_148) (<= 0 .cse1)) 1 0)) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_38| 0)) (= v_~i2~0_142 v_~i~0_324)))) InVars {~j~0=v_~j~0_178, ~i~0=v_~i~0_324, ~f~0.base=v_~f~0.base_200, #memory_int=|v_#memory_int_278|, ~n~0=v_~n~0_148, ~f~0.offset=v_~f~0.offset_198} OutVars{~j~0=v_~j~0_177, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_38|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_38|, ~i~0=v_~i~0_324, ~f~0.base=v_~f~0.base_200, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_34|, thread3Thread1of1ForFork0_#t~mem3#1=|v_thread3Thread1of1ForFork0_#t~mem3#1_38|, ~i2~0=v_~i2~0_142, ~f~0.offset=v_~f~0.offset_198, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_34|, #memory_int=|v_#memory_int_278|, thread3Thread1of1ForFork0_#t~mem4#1=|v_thread3Thread1of1ForFork0_#t~mem4#1_36|, ~n~0=v_~n~0_148} 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, ~i2~0] [2022-12-13 10:29:58,525 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [727] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| (ite (or (= v_~n2~0_362 0) (<= v_~n1~0_377 v_~n2~0_362)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|) (= v_~i1~0_142 v_~i~0_304) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156| 0)) (not (= (ite (= (mod v_~e2~0_256 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_264| v_~f~0.base_184) (+ v_~f~0.offset_183 (* v_~i1~0_142 4))) v_~i~0_303)) InVars {~n2~0=v_~n2~0_362, ~i~0=v_~i~0_304, ~f~0.base=v_~f~0.base_184, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256} OutVars{~n2~0=v_~n2~0_362, ~i~0=v_~i~0_303, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156|, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~i1~0=v_~i1~0_142, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_50|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|} 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 [729] L100-->L106: Formula: (and (= (select (select |v_#memory_int_276| v_~f~0.base_198) (+ v_~f~0.offset_196 (* v_~i2~0_140 4))) v_~i~0_320) (= v_~i2~0_140 v_~i~0_321)) InVars {~i~0=v_~i~0_321, ~f~0.base=v_~f~0.base_198, #memory_int=|v_#memory_int_276|, ~f~0.offset=v_~f~0.offset_196} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_69|, ~i~0=v_~i~0_320, ~f~0.base=v_~f~0.base_198, #memory_int=|v_#memory_int_276|, ~i2~0=v_~i2~0_140, ~f~0.offset=v_~f~0.offset_196} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, ~i~0, ~i2~0] [2022-12-13 10:29:58,597 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [732] L100-->L155-3: Formula: (and (= (store |v_#memory_int_283| |v_ULTIMATE.start_main_~#t3~0#1.base_69| (store (select |v_#memory_int_283| |v_ULTIMATE.start_main_~#t3~0#1.base_69|) |v_ULTIMATE.start_main_~#t3~0#1.offset_61| |v_ULTIMATE.start_main_#t~pre17#1_65|)) |v_#memory_int_282|) (= v_~i2~0_146 v_~i~0_330) (= |v_#pthreadsForks_98| (+ |v_#pthreadsForks_99| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_65| |v_#pthreadsForks_99|)) InVars {#pthreadsForks=|v_#pthreadsForks_99|, ~i~0=v_~i~0_330, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_61|, #memory_int=|v_#memory_int_283|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_69|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_55|, #pthreadsForks=|v_#pthreadsForks_98|, ~i~0=v_~i~0_330, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_61|, #memory_int=|v_#memory_int_282|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_69|, ~i2~0=v_~i2~0_146, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_67|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_65|} 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 10:29:58,624 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [727] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| (ite (or (= v_~n2~0_362 0) (<= v_~n1~0_377 v_~n2~0_362)) 1 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|) (= v_~i1~0_142 v_~i~0_304) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156| 0)) (not (= (ite (= (mod v_~e2~0_256 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_264| v_~f~0.base_184) (+ v_~f~0.offset_183 (* v_~i1~0_142 4))) v_~i~0_303)) InVars {~n2~0=v_~n2~0_362, ~i~0=v_~i~0_304, ~f~0.base=v_~f~0.base_184, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256} OutVars{~n2~0=v_~n2~0_362, ~i~0=v_~i~0_303, ~f~0.base=v_~f~0.base_184, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_156|, ~n1~0=v_~n1~0_377, #memory_int=|v_#memory_int_264|, ~i1~0=v_~i1~0_142, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_50|, ~f~0.offset=v_~f~0.offset_183, ~e2~0=v_~e2~0_256, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_156|} 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 [732] L100-->L155-3: Formula: (and (= (store |v_#memory_int_283| |v_ULTIMATE.start_main_~#t3~0#1.base_69| (store (select |v_#memory_int_283| |v_ULTIMATE.start_main_~#t3~0#1.base_69|) |v_ULTIMATE.start_main_~#t3~0#1.offset_61| |v_ULTIMATE.start_main_#t~pre17#1_65|)) |v_#memory_int_282|) (= v_~i2~0_146 v_~i~0_330) (= |v_#pthreadsForks_98| (+ |v_#pthreadsForks_99| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_65| |v_#pthreadsForks_99|)) InVars {#pthreadsForks=|v_#pthreadsForks_99|, ~i~0=v_~i~0_330, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_61|, #memory_int=|v_#memory_int_283|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_69|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_55|, #pthreadsForks=|v_#pthreadsForks_98|, ~i~0=v_~i~0_330, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_61|, #memory_int=|v_#memory_int_282|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_69|, ~i2~0=v_~i2~0_146, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_67|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_65|} 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] [2022-12-13 10:29:58,685 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:29:58,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-13 10:29:58,686 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 807 flow [2022-12-13 10:29:58,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:29:58,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:29:58,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, 1, 1, 1] [2022-12-13 10:29:58,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 10:29:58,686 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 10:29:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:29:58,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1778323825, now seen corresponding path program 1 times [2022-12-13 10:29:58,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:29:58,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488425638] [2022-12-13 10:29:58,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:29:58,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:29:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:00,118 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 10:30:00,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:00,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488425638] [2022-12-13 10:30:00,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488425638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:00,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:00,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:30:00,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744856688] [2022-12-13 10:30:00,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:00,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:30:00,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:00,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:30:00,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:30:00,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:30:00,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 807 flow. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:00,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:00,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:30:00,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:01,066 INFO L130 PetriNetUnfolder]: 2838/5080 cut-off events. [2022-12-13 10:30:01,066 INFO L131 PetriNetUnfolder]: For 16453/16453 co-relation queries the response was YES. [2022-12-13 10:30:01,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20750 conditions, 5080 events. 2838/5080 cut-off events. For 16453/16453 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 33458 event pairs, 766 based on Foata normal form. 4/5084 useless extension candidates. Maximal degree in co-relation 20695. Up to 1641 conditions per place. [2022-12-13 10:30:01,092 INFO L137 encePairwiseOnDemand]: 28/50 looper letters, 167 selfloop transitions, 29 changer transitions 40/236 dead transitions. [2022-12-13 10:30:01,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 236 transitions, 2201 flow [2022-12-13 10:30:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2022-12-13 10:30:01,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39111111111111113 [2022-12-13 10:30:01,093 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 807 flow. Second operand 9 states and 176 transitions. [2022-12-13 10:30:01,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 236 transitions, 2201 flow [2022-12-13 10:30:01,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 236 transitions, 2120 flow, removed 28 selfloop flow, removed 5 redundant places. [2022-12-13 10:30:01,157 INFO L231 Difference]: Finished difference. Result has 100 places, 87 transitions, 792 flow [2022-12-13 10:30:01,158 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=792, PETRI_PLACES=100, PETRI_TRANSITIONS=87} [2022-12-13 10:30:01,158 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2022-12-13 10:30:01,158 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:01,158 INFO L89 Accepts]: Start accepts. Operand has 100 places, 87 transitions, 792 flow [2022-12-13 10:30:01,159 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:01,159 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:01,159 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 87 transitions, 792 flow [2022-12-13 10:30:01,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 87 transitions, 792 flow [2022-12-13 10:30:01,199 INFO L130 PetriNetUnfolder]: 110/689 cut-off events. [2022-12-13 10:30:01,199 INFO L131 PetriNetUnfolder]: For 1453/1475 co-relation queries the response was YES. [2022-12-13 10:30:01,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 689 events. 110/689 cut-off events. For 1453/1475 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5959 event pairs, 24 based on Foata normal form. 11/657 useless extension candidates. Maximal degree in co-relation 2153. Up to 135 conditions per place. [2022-12-13 10:30:01,205 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 87 transitions, 792 flow [2022-12-13 10:30:01,205 INFO L226 LiptonReduction]: Number of co-enabled transitions 816 [2022-12-13 10:30:01,214 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:01,215 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 10:30:01,215 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 87 transitions, 792 flow [2022-12-13 10:30:01,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:01,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:01,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, 1, 1] [2022-12-13 10:30:01,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 10:30:01,215 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 10:30:01,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:01,216 INFO L85 PathProgramCache]: Analyzing trace with hash -281827279, now seen corresponding path program 1 times [2022-12-13 10:30:01,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:01,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476151898] [2022-12-13 10:30:01,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:01,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:01,599 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 10:30:01,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:01,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476151898] [2022-12-13 10:30:01,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476151898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:01,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:01,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:30:01,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468736493] [2022-12-13 10:30:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:01,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:01,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:01,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:01,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:01,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 10:30:01,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 792 flow. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:01,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:01,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 10:30:01,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:02,284 INFO L130 PetriNetUnfolder]: 2478/4437 cut-off events. [2022-12-13 10:30:02,284 INFO L131 PetriNetUnfolder]: For 13016/13016 co-relation queries the response was YES. [2022-12-13 10:30:02,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18159 conditions, 4437 events. 2478/4437 cut-off events. For 13016/13016 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 28189 event pairs, 836 based on Foata normal form. 4/4441 useless extension candidates. Maximal degree in co-relation 18102. Up to 2085 conditions per place. [2022-12-13 10:30:02,308 INFO L137 encePairwiseOnDemand]: 30/46 looper letters, 160 selfloop transitions, 17 changer transitions 34/211 dead transitions. [2022-12-13 10:30:02,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 211 transitions, 1999 flow [2022-12-13 10:30:02,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:30:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:30:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2022-12-13 10:30:02,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2022-12-13 10:30:02,311 INFO L175 Difference]: Start difference. First operand has 95 places, 87 transitions, 792 flow. Second operand 8 states and 152 transitions. [2022-12-13 10:30:02,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 211 transitions, 1999 flow [2022-12-13 10:30:02,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 211 transitions, 1952 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-13 10:30:02,356 INFO L231 Difference]: Finished difference. Result has 99 places, 87 transitions, 790 flow [2022-12-13 10:30:02,357 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=790, PETRI_PLACES=99, PETRI_TRANSITIONS=87} [2022-12-13 10:30:02,357 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-12-13 10:30:02,357 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:02,357 INFO L89 Accepts]: Start accepts. Operand has 99 places, 87 transitions, 790 flow [2022-12-13 10:30:02,358 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:02,358 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:02,358 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 87 transitions, 790 flow [2022-12-13 10:30:02,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions, 790 flow [2022-12-13 10:30:02,397 INFO L130 PetriNetUnfolder]: 105/681 cut-off events. [2022-12-13 10:30:02,398 INFO L131 PetriNetUnfolder]: For 1489/1507 co-relation queries the response was YES. [2022-12-13 10:30:02,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 681 events. 105/681 cut-off events. For 1489/1507 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5901 event pairs, 23 based on Foata normal form. 11/644 useless extension candidates. Maximal degree in co-relation 2165. Up to 130 conditions per place. [2022-12-13 10:30:02,403 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 87 transitions, 790 flow [2022-12-13 10:30:02,403 INFO L226 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-13 10:30:02,408 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:02,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 10:30:02,409 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 87 transitions, 790 flow [2022-12-13 10:30:02,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:02,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:02,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, 1, 1, 1] [2022-12-13 10:30:02,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 10:30:02,410 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 10:30:02,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash -485359483, now seen corresponding path program 1 times [2022-12-13 10:30:02,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:02,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785283832] [2022-12-13 10:30:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:02,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 10:30:02,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:02,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785283832] [2022-12-13 10:30:02,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785283832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:02,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:02,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558883500] [2022-12-13 10:30:02,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:02,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:02,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:02,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:02,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:02,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:30:02,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 87 transitions, 790 flow. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:02,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:02,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:30:02,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:03,679 INFO L130 PetriNetUnfolder]: 2535/4582 cut-off events. [2022-12-13 10:30:03,679 INFO L131 PetriNetUnfolder]: For 13088/13088 co-relation queries the response was YES. [2022-12-13 10:30:03,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18687 conditions, 4582 events. 2535/4582 cut-off events. For 13088/13088 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 29630 event pairs, 731 based on Foata normal form. 4/4586 useless extension candidates. Maximal degree in co-relation 18630. Up to 1551 conditions per place. [2022-12-13 10:30:03,699 INFO L137 encePairwiseOnDemand]: 29/45 looper letters, 166 selfloop transitions, 28 changer transitions 36/230 dead transitions. [2022-12-13 10:30:03,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 230 transitions, 2161 flow [2022-12-13 10:30:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2022-12-13 10:30:03,703 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4123456790123457 [2022-12-13 10:30:03,703 INFO L175 Difference]: Start difference. First operand has 97 places, 87 transitions, 790 flow. Second operand 9 states and 167 transitions. [2022-12-13 10:30:03,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 230 transitions, 2161 flow [2022-12-13 10:30:03,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 230 transitions, 2123 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-13 10:30:03,746 INFO L231 Difference]: Finished difference. Result has 104 places, 89 transitions, 869 flow [2022-12-13 10:30:03,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=869, PETRI_PLACES=104, PETRI_TRANSITIONS=89} [2022-12-13 10:30:03,747 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places. [2022-12-13 10:30:03,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:03,747 INFO L89 Accepts]: Start accepts. Operand has 104 places, 89 transitions, 869 flow [2022-12-13 10:30:03,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:03,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:03,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 89 transitions, 869 flow [2022-12-13 10:30:03,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 89 transitions, 869 flow [2022-12-13 10:30:03,792 INFO L130 PetriNetUnfolder]: 103/724 cut-off events. [2022-12-13 10:30:03,792 INFO L131 PetriNetUnfolder]: For 1968/1990 co-relation queries the response was YES. [2022-12-13 10:30:03,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 724 events. 103/724 cut-off events. For 1968/1990 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6540 event pairs, 23 based on Foata normal form. 12/691 useless extension candidates. Maximal degree in co-relation 2387. Up to 140 conditions per place. [2022-12-13 10:30:03,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 89 transitions, 869 flow [2022-12-13 10:30:03,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 826 [2022-12-13 10:30:03,804 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:03,805 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 10:30:03,805 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 89 transitions, 869 flow [2022-12-13 10:30:03,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:03,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:03,805 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] [2022-12-13 10:30:03,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 10:30:03,805 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 10:30:03,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:03,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1853582491, now seen corresponding path program 2 times [2022-12-13 10:30:03,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:03,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020746579] [2022-12-13 10:30:03,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:03,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30: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 10:30:04,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:04,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020746579] [2022-12-13 10:30:04,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020746579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:04,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:04,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396198967] [2022-12-13 10:30:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:04,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:04,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:30:04,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 89 transitions, 869 flow. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:04,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:04,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:30:04,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:05,075 INFO L130 PetriNetUnfolder]: 2628/4761 cut-off events. [2022-12-13 10:30:05,076 INFO L131 PetriNetUnfolder]: For 15771/15771 co-relation queries the response was YES. [2022-12-13 10:30:05,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19981 conditions, 4761 events. 2628/4761 cut-off events. For 15771/15771 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 31043 event pairs, 754 based on Foata normal form. 3/4764 useless extension candidates. Maximal degree in co-relation 19916. Up to 1653 conditions per place. [2022-12-13 10:30:05,102 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 194 selfloop transitions, 29 changer transitions 32/255 dead transitions. [2022-12-13 10:30:05,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 255 transitions, 2404 flow [2022-12-13 10:30:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:30:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:30:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 192 transitions. [2022-12-13 10:30:05,103 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2022-12-13 10:30:05,103 INFO L175 Difference]: Start difference. First operand has 102 places, 89 transitions, 869 flow. Second operand 11 states and 192 transitions. [2022-12-13 10:30:05,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 255 transitions, 2404 flow [2022-12-13 10:30:05,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 255 transitions, 2352 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-13 10:30:05,166 INFO L231 Difference]: Finished difference. Result has 111 places, 92 transitions, 937 flow [2022-12-13 10:30:05,166 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=937, PETRI_PLACES=111, PETRI_TRANSITIONS=92} [2022-12-13 10:30:05,166 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 10:30:05,166 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:05,166 INFO L89 Accepts]: Start accepts. Operand has 111 places, 92 transitions, 937 flow [2022-12-13 10:30:05,167 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:05,167 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:05,167 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 92 transitions, 937 flow [2022-12-13 10:30:05,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 92 transitions, 937 flow [2022-12-13 10:30:05,214 INFO L130 PetriNetUnfolder]: 104/772 cut-off events. [2022-12-13 10:30:05,215 INFO L131 PetriNetUnfolder]: For 2183/2202 co-relation queries the response was YES. [2022-12-13 10:30:05,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 772 events. 104/772 cut-off events. For 2183/2202 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7078 event pairs, 24 based on Foata normal form. 11/739 useless extension candidates. Maximal degree in co-relation 2531. Up to 144 conditions per place. [2022-12-13 10:30:05,221 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 92 transitions, 937 flow [2022-12-13 10:30:05,222 INFO L226 LiptonReduction]: Number of co-enabled transitions 830 [2022-12-13 10:30:05,228 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:05,229 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 10:30:05,229 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 92 transitions, 937 flow [2022-12-13 10:30:05,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:05,229 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:05,229 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] [2022-12-13 10:30:05,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 10:30:05,229 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 10:30:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash -149423309, now seen corresponding path program 3 times [2022-12-13 10:30:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:05,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140918287] [2022-12-13 10:30:05,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:05,727 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 10:30:05,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:05,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140918287] [2022-12-13 10:30:05,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140918287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:05,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:05,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:05,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813639360] [2022-12-13 10:30:05,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:05,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:05,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:05,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:05,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:05,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:30:05,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 92 transitions, 937 flow. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:05,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:05,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:30:05,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:06,475 INFO L130 PetriNetUnfolder]: 2524/4580 cut-off events. [2022-12-13 10:30:06,476 INFO L131 PetriNetUnfolder]: For 16179/16179 co-relation queries the response was YES. [2022-12-13 10:30:06,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19546 conditions, 4580 events. 2524/4580 cut-off events. For 16179/16179 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 29675 event pairs, 749 based on Foata normal form. 2/4582 useless extension candidates. Maximal degree in co-relation 19476. Up to 1613 conditions per place. [2022-12-13 10:30:06,499 INFO L137 encePairwiseOnDemand]: 28/45 looper letters, 162 selfloop transitions, 25 changer transitions 38/225 dead transitions. [2022-12-13 10:30:06,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 225 transitions, 2209 flow [2022-12-13 10:30:06,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2022-12-13 10:30:06,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2022-12-13 10:30:06,500 INFO L175 Difference]: Start difference. First operand has 109 places, 92 transitions, 937 flow. Second operand 9 states and 168 transitions. [2022-12-13 10:30:06,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 225 transitions, 2209 flow [2022-12-13 10:30:06,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 225 transitions, 2151 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-12-13 10:30:06,552 INFO L231 Difference]: Finished difference. Result has 111 places, 88 transitions, 871 flow [2022-12-13 10:30:06,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=871, PETRI_PLACES=111, PETRI_TRANSITIONS=88} [2022-12-13 10:30:06,553 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 10:30:06,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:06,553 INFO L89 Accepts]: Start accepts. Operand has 111 places, 88 transitions, 871 flow [2022-12-13 10:30:06,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:06,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:06,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 88 transitions, 871 flow [2022-12-13 10:30:06,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 88 transitions, 871 flow [2022-12-13 10:30:06,598 INFO L130 PetriNetUnfolder]: 100/750 cut-off events. [2022-12-13 10:30:06,598 INFO L131 PetriNetUnfolder]: For 2038/2055 co-relation queries the response was YES. [2022-12-13 10:30:06,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 750 events. 100/750 cut-off events. For 2038/2055 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6824 event pairs, 24 based on Foata normal form. 10/717 useless extension candidates. Maximal degree in co-relation 2482. Up to 139 conditions per place. [2022-12-13 10:30:06,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 88 transitions, 871 flow [2022-12-13 10:30:06,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 794 [2022-12-13 10:30:06,610 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:06,611 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 10:30:06,611 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 88 transitions, 871 flow [2022-12-13 10:30:06,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:06,611 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:06,612 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] [2022-12-13 10:30:06,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 10:30:06,612 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 10:30:06,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:06,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1926907079, now seen corresponding path program 4 times [2022-12-13 10:30:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:06,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568246526] [2022-12-13 10:30:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:06,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:07,209 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 10:30:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:07,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568246526] [2022-12-13 10:30:07,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568246526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:07,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:07,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:30:07,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905433201] [2022-12-13 10:30:07,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:07,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:30:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:07,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:30:07,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:30:07,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 10:30:07,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 88 transitions, 871 flow. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:07,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:07,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 10:30:07,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:07,904 INFO L130 PetriNetUnfolder]: 2422/4416 cut-off events. [2022-12-13 10:30:07,904 INFO L131 PetriNetUnfolder]: For 15135/15135 co-relation queries the response was YES. [2022-12-13 10:30:07,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18935 conditions, 4416 events. 2422/4416 cut-off events. For 15135/15135 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 28665 event pairs, 734 based on Foata normal form. 1/4417 useless extension candidates. Maximal degree in co-relation 18875. Up to 1572 conditions per place. [2022-12-13 10:30:07,930 INFO L137 encePairwiseOnDemand]: 29/44 looper letters, 150 selfloop transitions, 20 changer transitions 44/214 dead transitions. [2022-12-13 10:30:07,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 214 transitions, 2091 flow [2022-12-13 10:30:07,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2022-12-13 10:30:07,931 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4116161616161616 [2022-12-13 10:30:07,931 INFO L175 Difference]: Start difference. First operand has 109 places, 88 transitions, 871 flow. Second operand 9 states and 163 transitions. [2022-12-13 10:30:07,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 214 transitions, 2091 flow [2022-12-13 10:30:07,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 214 transitions, 2021 flow, removed 2 selfloop flow, removed 9 redundant places. [2022-12-13 10:30:07,987 INFO L231 Difference]: Finished difference. Result has 110 places, 81 transitions, 763 flow [2022-12-13 10:30:07,987 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=763, PETRI_PLACES=110, PETRI_TRANSITIONS=81} [2022-12-13 10:30:07,987 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2022-12-13 10:30:07,987 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:07,987 INFO L89 Accepts]: Start accepts. Operand has 110 places, 81 transitions, 763 flow [2022-12-13 10:30:07,988 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:07,988 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:07,988 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 81 transitions, 763 flow [2022-12-13 10:30:07,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 81 transitions, 763 flow [2022-12-13 10:30:08,031 INFO L130 PetriNetUnfolder]: 91/676 cut-off events. [2022-12-13 10:30:08,032 INFO L131 PetriNetUnfolder]: For 1899/1917 co-relation queries the response was YES. [2022-12-13 10:30:08,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 676 events. 91/676 cut-off events. For 1899/1917 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5988 event pairs, 22 based on Foata normal form. 10/647 useless extension candidates. Maximal degree in co-relation 2234. Up to 133 conditions per place. [2022-12-13 10:30:08,037 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 81 transitions, 763 flow [2022-12-13 10:30:08,038 INFO L226 LiptonReduction]: Number of co-enabled transitions 752 [2022-12-13 10:30:08,133 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:08,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 10:30:08,134 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 81 transitions, 773 flow [2022-12-13 10:30:08,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:08,134 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:08,134 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 10:30:08,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 10:30:08,134 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 10:30:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1233355000, now seen corresponding path program 1 times [2022-12-13 10:30:08,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:08,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109982043] [2022-12-13 10:30:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:09,156 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 10:30:09,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:09,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109982043] [2022-12-13 10:30:09,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109982043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:09,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:09,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 10:30:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907890593] [2022-12-13 10:30:09,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:09,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:30:09,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:09,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:30:09,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:30:09,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 10:30:09,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 81 transitions, 773 flow. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 10:30:09,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:09,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 10:30:09,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:10,329 INFO L130 PetriNetUnfolder]: 2455/4559 cut-off events. [2022-12-13 10:30:10,329 INFO L131 PetriNetUnfolder]: For 16752/16752 co-relation queries the response was YES. [2022-12-13 10:30:10,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19213 conditions, 4559 events. 2455/4559 cut-off events. For 16752/16752 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 30283 event pairs, 702 based on Foata normal form. 4/4563 useless extension candidates. Maximal degree in co-relation 19146. Up to 1902 conditions per place. [2022-12-13 10:30:10,357 INFO L137 encePairwiseOnDemand]: 28/44 looper letters, 182 selfloop transitions, 22 changer transitions 33/237 dead transitions. [2022-12-13 10:30:10,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 237 transitions, 2224 flow [2022-12-13 10:30:10,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:30:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:30:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2022-12-13 10:30:10,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4068181818181818 [2022-12-13 10:30:10,358 INFO L175 Difference]: Start difference. First operand has 105 places, 81 transitions, 773 flow. Second operand 10 states and 179 transitions. [2022-12-13 10:30:10,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 237 transitions, 2224 flow [2022-12-13 10:30:10,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 237 transitions, 2074 flow, removed 28 selfloop flow, removed 16 redundant places. [2022-12-13 10:30:10,422 INFO L231 Difference]: Finished difference. Result has 103 places, 87 transitions, 782 flow [2022-12-13 10:30:10,422 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=782, PETRI_PLACES=103, PETRI_TRANSITIONS=87} [2022-12-13 10:30:10,423 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2022-12-13 10:30:10,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:10,423 INFO L89 Accepts]: Start accepts. Operand has 103 places, 87 transitions, 782 flow [2022-12-13 10:30:10,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:10,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:10,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 87 transitions, 782 flow [2022-12-13 10:30:10,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 87 transitions, 782 flow [2022-12-13 10:30:10,469 INFO L130 PetriNetUnfolder]: 92/775 cut-off events. [2022-12-13 10:30:10,469 INFO L131 PetriNetUnfolder]: For 2167/2188 co-relation queries the response was YES. [2022-12-13 10:30:10,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2536 conditions, 775 events. 92/775 cut-off events. For 2167/2188 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7233 event pairs, 25 based on Foata normal form. 3/731 useless extension candidates. Maximal degree in co-relation 2482. Up to 149 conditions per place. [2022-12-13 10:30:10,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 87 transitions, 782 flow [2022-12-13 10:30:10,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 786 [2022-12-13 10:30:10,480 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:10,481 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 10:30:10,481 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 87 transitions, 782 flow [2022-12-13 10:30:10,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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 10:30:10,481 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:10,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, 1, 1, 1, 1, 1] [2022-12-13 10:30:10,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 10:30:10,482 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 10:30:10,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:10,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2072505561, now seen corresponding path program 2 times [2022-12-13 10:30:10,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:10,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853390776] [2022-12-13 10:30:10,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:10,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:10,849 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 10:30:10,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:10,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853390776] [2022-12-13 10:30:10,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853390776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:10,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:10,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:30:10,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288188527] [2022-12-13 10:30:10,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:10,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:30:10,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:10,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:30:10,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:30:10,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 10:30:10,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 87 transitions, 782 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 10:30:10,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:10,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 10:30:10,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:11,710 INFO L130 PetriNetUnfolder]: 2495/4652 cut-off events. [2022-12-13 10:30:11,711 INFO L131 PetriNetUnfolder]: For 14912/14912 co-relation queries the response was YES. [2022-12-13 10:30:11,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19194 conditions, 4652 events. 2495/4652 cut-off events. For 14912/14912 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 30845 event pairs, 690 based on Foata normal form. 5/4657 useless extension candidates. Maximal degree in co-relation 19129. Up to 1551 conditions per place. [2022-12-13 10:30:11,737 INFO L137 encePairwiseOnDemand]: 29/44 looper letters, 156 selfloop transitions, 26 changer transitions 61/243 dead transitions. [2022-12-13 10:30:11,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 243 transitions, 2254 flow [2022-12-13 10:30:11,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:30:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:30:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2022-12-13 10:30:11,738 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.378099173553719 [2022-12-13 10:30:11,738 INFO L175 Difference]: Start difference. First operand has 101 places, 87 transitions, 782 flow. Second operand 11 states and 183 transitions. [2022-12-13 10:30:11,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 243 transitions, 2254 flow [2022-12-13 10:30:11,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 243 transitions, 2185 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-13 10:30:11,790 INFO L231 Difference]: Finished difference. Result has 112 places, 92 transitions, 875 flow [2022-12-13 10:30:11,791 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=875, PETRI_PLACES=112, PETRI_TRANSITIONS=92} [2022-12-13 10:30:11,791 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2022-12-13 10:30:11,791 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:11,791 INFO L89 Accepts]: Start accepts. Operand has 112 places, 92 transitions, 875 flow [2022-12-13 10:30:11,792 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:11,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:11,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 92 transitions, 875 flow [2022-12-13 10:30:11,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 92 transitions, 875 flow [2022-12-13 10:30:11,840 INFO L130 PetriNetUnfolder]: 94/788 cut-off events. [2022-12-13 10:30:11,840 INFO L131 PetriNetUnfolder]: For 2488/2516 co-relation queries the response was YES. [2022-12-13 10:30:11,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2662 conditions, 788 events. 94/788 cut-off events. For 2488/2516 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7304 event pairs, 28 based on Foata normal form. 6/746 useless extension candidates. Maximal degree in co-relation 2604. Up to 141 conditions per place. [2022-12-13 10:30:11,846 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 92 transitions, 875 flow [2022-12-13 10:30:11,846 INFO L226 LiptonReduction]: Number of co-enabled transitions 808 [2022-12-13 10:30:11,874 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 [706] L59-->L68: Formula: (and (not (= (ite (= (mod v_~e2~0_204 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128| (ite (or (= v_~n2~0_257 0) (<= v_~n1~0_247 v_~n2~0_257)) 1 0)) (= v_~i1~0_114 v_~i~0_251) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128| 0))) InVars {~n2~0=v_~n2~0_257, ~i~0=v_~i~0_251, ~n1~0=v_~n1~0_247, ~e2~0=v_~e2~0_204} OutVars{~n2~0=v_~n2~0_257, ~i~0=v_~i~0_251, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_128|, ~n1~0=v_~n1~0_247, ~i1~0=v_~i1~0_114, ~e2~0=v_~e2~0_204, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_128|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~i1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 10:30:11,944 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 10:30:11,982 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:11,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 192 [2022-12-13 10:30:11,983 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 91 transitions, 882 flow [2022-12-13 10:30:11,983 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 10:30:11,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:11,983 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 10:30:11,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 10:30:11,984 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 10:30:11,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:11,984 INFO L85 PathProgramCache]: Analyzing trace with hash -639284528, now seen corresponding path program 1 times [2022-12-13 10:30:11,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:11,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111741034] [2022-12-13 10:30:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:11,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:12,042 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 10:30:12,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:12,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111741034] [2022-12-13 10:30:12,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111741034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:12,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:12,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:12,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730722482] [2022-12-13 10:30:12,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:12,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:30:12,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:12,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:30:12,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:30:12,043 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-13 10:30:12,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 91 transitions, 882 flow. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:12,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:12,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-13 10:30:12,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:12,426 INFO L130 PetriNetUnfolder]: 1388/2810 cut-off events. [2022-12-13 10:30:12,426 INFO L131 PetriNetUnfolder]: For 12011/12119 co-relation queries the response was YES. [2022-12-13 10:30:12,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11976 conditions, 2810 events. 1388/2810 cut-off events. For 12011/12119 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18856 event pairs, 253 based on Foata normal form. 115/2923 useless extension candidates. Maximal degree in co-relation 11916. Up to 761 conditions per place. [2022-12-13 10:30:12,441 INFO L137 encePairwiseOnDemand]: 25/46 looper letters, 109 selfloop transitions, 29 changer transitions 23/162 dead transitions. [2022-12-13 10:30:12,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 162 transitions, 1620 flow [2022-12-13 10:30:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2022-12-13 10:30:12,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3140096618357488 [2022-12-13 10:30:12,442 INFO L175 Difference]: Start difference. First operand has 109 places, 91 transitions, 882 flow. Second operand 9 states and 130 transitions. [2022-12-13 10:30:12,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 162 transitions, 1620 flow [2022-12-13 10:30:12,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 162 transitions, 1364 flow, removed 77 selfloop flow, removed 13 redundant places. [2022-12-13 10:30:12,472 INFO L231 Difference]: Finished difference. Result has 105 places, 66 transitions, 545 flow [2022-12-13 10:30:12,472 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=545, PETRI_PLACES=105, PETRI_TRANSITIONS=66} [2022-12-13 10:30:12,472 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2022-12-13 10:30:12,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:12,473 INFO L89 Accepts]: Start accepts. Operand has 105 places, 66 transitions, 545 flow [2022-12-13 10:30:12,473 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:12,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:12,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 66 transitions, 545 flow [2022-12-13 10:30:12,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 66 transitions, 545 flow [2022-12-13 10:30:12,491 INFO L130 PetriNetUnfolder]: 32/301 cut-off events. [2022-12-13 10:30:12,491 INFO L131 PetriNetUnfolder]: For 622/639 co-relation queries the response was YES. [2022-12-13 10:30:12,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 301 events. 32/301 cut-off events. For 622/639 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1922 event pairs, 13 based on Foata normal form. 5/291 useless extension candidates. Maximal degree in co-relation 865. Up to 47 conditions per place. [2022-12-13 10:30:12,493 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 66 transitions, 545 flow [2022-12-13 10:30:12,494 INFO L226 LiptonReduction]: Number of co-enabled transitions 516 [2022-12-13 10:30:12,496 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 [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] [2022-12-13 10:30:12,915 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 [744] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_53| 0) (= v_~n2~0_464 0) (= v_~e1~0_262 1) (= |v_thread2Thread1of1ForFork2_#res#1.offset_53| 0) (= v_~n2~0_465 v_~tmp1~0_231)) InVars {~n2~0=v_~n2~0_465} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_53|, ~n2~0=v_~n2~0_464, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_53|, ~tmp1~0=v_~tmp1~0_231, ~e1~0=v_~e1~0_262} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] [2022-12-13 10:30:13,294 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [745] $Ultimate##0-->L59: Formula: (and (= v_~n1~0_456 (+ v_~tmp1~0_233 1)) (= v_~n2~0_468 v_~tmp1~0_233) (= v_~e1~0_264 0)) InVars {~n2~0=v_~n2~0_468} OutVars{~n2~0=v_~n2~0_468, ~n1~0=v_~n1~0_456, ~tmp1~0=v_~tmp1~0_233, ~e1~0=v_~e1~0_264} AuxVars[] AssignedVars[~n1~0, ~tmp1~0, ~e1~0] and [754] L106-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_203| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_203|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_55| 0) (= v_~n2~0_488 0) (= (ite (and (<= 0 v_~i~0_487) (< v_~i~0_487 v_~n~0_228)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_203|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_203| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.base_55| 0)) InVars {~i~0=v_~i~0_487, ~n~0=v_~n~0_228} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_203|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_55|, ~n2~0=v_~n2~0_488, ~i~0=v_~i~0_487, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_203|, ~n~0=v_~n~0_228, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_55|} 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 10:30:13,340 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 10:30:13,341 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 869 [2022-12-13 10:30:13,341 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 63 transitions, 601 flow [2022-12-13 10:30:13,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:13,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:13,341 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] [2022-12-13 10:30:13,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 10:30:13,342 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 10:30:13,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash -685694606, now seen corresponding path program 1 times [2022-12-13 10:30:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:13,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524538438] [2022-12-13 10:30:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:14,013 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 10:30:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524538438] [2022-12-13 10:30:14,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524538438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738457006] [2022-12-13 10:30:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:14,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:14,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:14,017 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 10:30:14,047 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 10:30:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:14,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 10:30:14,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:14,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:30:14,286 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 10:30:14,296 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 10:30:14,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:30:14,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738457006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:14,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:30:14,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-12-13 10:30:14,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840412669] [2022-12-13 10:30:14,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:14,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:30:14,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:14,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:30:14,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:30:14,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:30:14,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 63 transitions, 601 flow. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:14,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:14,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:30:14,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:14,804 INFO L130 PetriNetUnfolder]: 982/1898 cut-off events. [2022-12-13 10:30:14,804 INFO L131 PetriNetUnfolder]: For 11197/11197 co-relation queries the response was YES. [2022-12-13 10:30:14,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8582 conditions, 1898 events. 982/1898 cut-off events. For 11197/11197 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11332 event pairs, 175 based on Foata normal form. 4/1902 useless extension candidates. Maximal degree in co-relation 8244. Up to 1143 conditions per place. [2022-12-13 10:30:14,817 INFO L137 encePairwiseOnDemand]: 41/51 looper letters, 92 selfloop transitions, 12 changer transitions 30/134 dead transitions. [2022-12-13 10:30:14,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 134 transitions, 1474 flow [2022-12-13 10:30:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:30:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:30:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2022-12-13 10:30:14,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34173669467787116 [2022-12-13 10:30:14,827 INFO L175 Difference]: Start difference. First operand has 92 places, 63 transitions, 601 flow. Second operand 7 states and 122 transitions. [2022-12-13 10:30:14,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 134 transitions, 1474 flow [2022-12-13 10:30:14,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 134 transitions, 1225 flow, removed 81 selfloop flow, removed 15 redundant places. [2022-12-13 10:30:14,846 INFO L231 Difference]: Finished difference. Result has 86 places, 67 transitions, 544 flow [2022-12-13 10:30:14,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=544, PETRI_PLACES=86, PETRI_TRANSITIONS=67} [2022-12-13 10:30:14,847 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2022-12-13 10:30:14,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:14,847 INFO L89 Accepts]: Start accepts. Operand has 86 places, 67 transitions, 544 flow [2022-12-13 10:30:14,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:14,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:14,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 67 transitions, 544 flow [2022-12-13 10:30:14,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 67 transitions, 544 flow [2022-12-13 10:30:14,885 INFO L130 PetriNetUnfolder]: 52/353 cut-off events. [2022-12-13 10:30:14,885 INFO L131 PetriNetUnfolder]: For 877/882 co-relation queries the response was YES. [2022-12-13 10:30:14,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 353 events. 52/353 cut-off events. For 877/882 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2533 event pairs, 11 based on Foata normal form. 3/339 useless extension candidates. Maximal degree in co-relation 1145. Up to 73 conditions per place. [2022-12-13 10:30:14,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 67 transitions, 544 flow [2022-12-13 10:30:14,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 10:30:14,893 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 10:30:15,090 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:30:15,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-13 10:30:15,091 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 66 transitions, 556 flow [2022-12-13 10:30:15,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:30:15,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:15,091 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 10:30:15,106 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 10:30:15,291 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,SelfDestructingSolverStorable27 [2022-12-13 10:30:15,292 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 10:30:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash 877603966, now seen corresponding path program 1 times [2022-12-13 10:30:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:15,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107511873] [2022-12-13 10:30:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:15,701 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 10:30:15,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:15,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107511873] [2022-12-13 10:30:15,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107511873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:15,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:15,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:30:15,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438658142] [2022-12-13 10:30:15,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:15,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:15,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:15,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:30:15,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 66 transitions, 556 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 10:30:15,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:15,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:30:15,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:16,188 INFO L130 PetriNetUnfolder]: 820/1619 cut-off events. [2022-12-13 10:30:16,189 INFO L131 PetriNetUnfolder]: For 6835/6835 co-relation queries the response was YES. [2022-12-13 10:30:16,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7010 conditions, 1619 events. 820/1619 cut-off events. For 6835/6835 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9520 event pairs, 278 based on Foata normal form. 2/1621 useless extension candidates. Maximal degree in co-relation 6962. Up to 1105 conditions per place. [2022-12-13 10:30:16,196 INFO L137 encePairwiseOnDemand]: 40/51 looper letters, 113 selfloop transitions, 12 changer transitions 30/155 dead transitions. [2022-12-13 10:30:16,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 155 transitions, 1488 flow [2022-12-13 10:30:16,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2022-12-13 10:30:16,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3093681917211329 [2022-12-13 10:30:16,197 INFO L175 Difference]: Start difference. First operand has 82 places, 66 transitions, 556 flow. Second operand 9 states and 142 transitions. [2022-12-13 10:30:16,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 155 transitions, 1488 flow [2022-12-13 10:30:16,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 155 transitions, 1416 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-12-13 10:30:16,209 INFO L231 Difference]: Finished difference. Result has 89 places, 68 transitions, 569 flow [2022-12-13 10:30:16,209 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=569, PETRI_PLACES=89, PETRI_TRANSITIONS=68} [2022-12-13 10:30:16,209 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places. [2022-12-13 10:30:16,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:16,209 INFO L89 Accepts]: Start accepts. Operand has 89 places, 68 transitions, 569 flow [2022-12-13 10:30:16,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:16,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:16,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 68 transitions, 569 flow [2022-12-13 10:30:16,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 68 transitions, 569 flow [2022-12-13 10:30:16,232 INFO L130 PetriNetUnfolder]: 60/378 cut-off events. [2022-12-13 10:30:16,233 INFO L131 PetriNetUnfolder]: For 847/862 co-relation queries the response was YES. [2022-12-13 10:30:16,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 378 events. 60/378 cut-off events. For 847/862 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2777 event pairs, 11 based on Foata normal form. 9/370 useless extension candidates. Maximal degree in co-relation 1189. Up to 55 conditions per place. [2022-12-13 10:30:16,235 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 68 transitions, 569 flow [2022-12-13 10:30:16,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-13 10:30:16,249 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:16,250 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 10:30:16,250 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 569 flow [2022-12-13 10:30:16,250 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 10:30:16,250 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:16,250 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 10:30:16,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 10:30:16,251 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 10:30:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2012675931, now seen corresponding path program 1 times [2022-12-13 10:30:16,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:16,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111132328] [2022-12-13 10:30:16,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:16,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:16,630 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 10:30:16,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:16,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111132328] [2022-12-13 10:30:16,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111132328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:16,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:16,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:16,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798061468] [2022-12-13 10:30:16,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:16,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:16,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:16,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:16,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:16,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:30:16,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 569 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 10:30:16,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:16,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:30:16,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:17,108 INFO L130 PetriNetUnfolder]: 734/1468 cut-off events. [2022-12-13 10:30:17,108 INFO L131 PetriNetUnfolder]: For 5839/5839 co-relation queries the response was YES. [2022-12-13 10:30:17,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6389 conditions, 1468 events. 734/1468 cut-off events. For 5839/5839 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8455 event pairs, 275 based on Foata normal form. 2/1470 useless extension candidates. Maximal degree in co-relation 6340. Up to 1006 conditions per place. [2022-12-13 10:30:17,114 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 118 selfloop transitions, 20 changer transitions 25/163 dead transitions. [2022-12-13 10:30:17,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 163 transitions, 1525 flow [2022-12-13 10:30:17,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:30:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:30:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 151 transitions. [2022-12-13 10:30:17,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3081632653061224 [2022-12-13 10:30:17,115 INFO L175 Difference]: Start difference. First operand has 86 places, 68 transitions, 569 flow. Second operand 10 states and 151 transitions. [2022-12-13 10:30:17,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 163 transitions, 1525 flow [2022-12-13 10:30:17,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 163 transitions, 1489 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 10:30:17,123 INFO L231 Difference]: Finished difference. Result has 93 places, 74 transitions, 651 flow [2022-12-13 10:30:17,123 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=651, PETRI_PLACES=93, PETRI_TRANSITIONS=74} [2022-12-13 10:30:17,124 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2022-12-13 10:30:17,124 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:17,124 INFO L89 Accepts]: Start accepts. Operand has 93 places, 74 transitions, 651 flow [2022-12-13 10:30:17,124 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:17,124 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:17,125 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 74 transitions, 651 flow [2022-12-13 10:30:17,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 74 transitions, 651 flow [2022-12-13 10:30:17,146 INFO L130 PetriNetUnfolder]: 62/387 cut-off events. [2022-12-13 10:30:17,146 INFO L131 PetriNetUnfolder]: For 928/942 co-relation queries the response was YES. [2022-12-13 10:30:17,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1297 conditions, 387 events. 62/387 cut-off events. For 928/942 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2812 event pairs, 11 based on Foata normal form. 8/378 useless extension candidates. Maximal degree in co-relation 1150. Up to 53 conditions per place. [2022-12-13 10:30:17,149 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 74 transitions, 651 flow [2022-12-13 10:30:17,149 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 10:30:17,203 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 [764] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| 0)) (= (+ v_~tmp1~0_252 1) v_~n1~0_510) (= v_~n2~0_528 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_69| 0) (= v_~e1~0_292 0) (= (ite (and (< v_~i~0_512 v_~n~0_242) (<= 0 v_~i~0_512)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_69| 0) (= v_~n2~0_529 v_~tmp1~0_252)) InVars {~n2~0=v_~n2~0_529, ~i~0=v_~i~0_512, ~n~0=v_~n~0_242} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_69|, ~n2~0=v_~n2~0_528, ~i~0=v_~i~0_512, ~n1~0=v_~n1~0_510, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|, ~n~0=v_~n~0_242, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_69|, ~tmp1~0=v_~tmp1~0_252, ~e1~0=v_~e1~0_292} 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 10:30:17,253 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 10:30:17,307 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 [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 10:30:17,345 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:17,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 221 [2022-12-13 10:30:17,345 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 73 transitions, 685 flow [2022-12-13 10:30:17,346 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 10:30:17,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:17,346 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 10:30:17,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 10:30:17,346 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 10:30:17,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1967296788, now seen corresponding path program 1 times [2022-12-13 10:30:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:17,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450259116] [2022-12-13 10:30:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:17,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:17,869 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 10:30:17,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:17,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450259116] [2022-12-13 10:30:17,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450259116] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:17,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127745645] [2022-12-13 10:30:17,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:17,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:17,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:17,870 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 10:30:17,871 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 10:30:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:17,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 10:30:17,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:18,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:30:18,016 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 10:30:18,029 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 10:30:18,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:30:18,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127745645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:18,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:30:18,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2022-12-13 10:30:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729101862] [2022-12-13 10:30:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:18,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:30:18,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:30:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:30:18,031 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 10:30:18,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 73 transitions, 685 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 10:30:18,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:18,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 10:30:18,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:18,290 INFO L130 PetriNetUnfolder]: 772/1576 cut-off events. [2022-12-13 10:30:18,290 INFO L131 PetriNetUnfolder]: For 6744/6744 co-relation queries the response was YES. [2022-12-13 10:30:18,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6964 conditions, 1576 events. 772/1576 cut-off events. For 6744/6744 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9417 event pairs, 154 based on Foata normal form. 4/1580 useless extension candidates. Maximal degree in co-relation 5996. Up to 1072 conditions per place. [2022-12-13 10:30:18,297 INFO L137 encePairwiseOnDemand]: 37/54 looper letters, 101 selfloop transitions, 20 changer transitions 10/131 dead transitions. [2022-12-13 10:30:18,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 131 transitions, 1357 flow [2022-12-13 10:30:18,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:30:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:30:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2022-12-13 10:30:18,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35802469135802467 [2022-12-13 10:30:18,298 INFO L175 Difference]: Start difference. First operand has 92 places, 73 transitions, 685 flow. Second operand 6 states and 116 transitions. [2022-12-13 10:30:18,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 131 transitions, 1357 flow [2022-12-13 10:30:18,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 131 transitions, 1287 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-12-13 10:30:18,308 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 753 flow [2022-12-13 10:30:18,308 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=753, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2022-12-13 10:30:18,308 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2022-12-13 10:30:18,308 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:18,309 INFO L89 Accepts]: Start accepts. Operand has 91 places, 79 transitions, 753 flow [2022-12-13 10:30:18,309 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:18,309 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:18,309 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 79 transitions, 753 flow [2022-12-13 10:30:18,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 79 transitions, 753 flow [2022-12-13 10:30:18,333 INFO L130 PetriNetUnfolder]: 59/408 cut-off events. [2022-12-13 10:30:18,333 INFO L131 PetriNetUnfolder]: For 1314/1345 co-relation queries the response was YES. [2022-12-13 10:30:18,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 408 events. 59/408 cut-off events. For 1314/1345 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3112 event pairs, 3 based on Foata normal form. 9/406 useless extension candidates. Maximal degree in co-relation 1285. Up to 57 conditions per place. [2022-12-13 10:30:18,352 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 79 transitions, 753 flow [2022-12-13 10:30:18,353 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 10:30:18,416 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:18,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 10:30:18,417 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 760 flow [2022-12-13 10:30:18,417 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 10:30:18,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:18,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, 1] [2022-12-13 10:30:18,422 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 10:30:18,622 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,SelfDestructingSolverStorable30 [2022-12-13 10:30:18,622 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 10:30:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:18,622 INFO L85 PathProgramCache]: Analyzing trace with hash -105769327, now seen corresponding path program 1 times [2022-12-13 10:30:18,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:18,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738643563] [2022-12-13 10:30:18,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:18,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:18,935 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 10:30:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:18,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738643563] [2022-12-13 10:30:18,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738643563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:18,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:18,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:30:18,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144841346] [2022-12-13 10:30:18,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:18,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:18,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:18,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:18,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:18,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:30:18,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 760 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 10:30:18,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:18,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:30:18,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:19,365 INFO L130 PetriNetUnfolder]: 760/1554 cut-off events. [2022-12-13 10:30:19,365 INFO L131 PetriNetUnfolder]: For 7784/7784 co-relation queries the response was YES. [2022-12-13 10:30:19,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7245 conditions, 1554 events. 760/1554 cut-off events. For 7784/7784 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9266 event pairs, 325 based on Foata normal form. 2/1556 useless extension candidates. Maximal degree in co-relation 6395. Up to 1096 conditions per place. [2022-12-13 10:30:19,373 INFO L137 encePairwiseOnDemand]: 37/53 looper letters, 113 selfloop transitions, 16 changer transitions 36/165 dead transitions. [2022-12-13 10:30:19,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 165 transitions, 1691 flow [2022-12-13 10:30:19,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:30:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:30:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2022-12-13 10:30:19,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27358490566037735 [2022-12-13 10:30:19,374 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 760 flow. Second operand 10 states and 145 transitions. [2022-12-13 10:30:19,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 165 transitions, 1691 flow [2022-12-13 10:30:19,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 165 transitions, 1616 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-13 10:30:19,384 INFO L231 Difference]: Finished difference. Result has 98 places, 77 transitions, 704 flow [2022-12-13 10:30:19,384 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=704, PETRI_PLACES=98, PETRI_TRANSITIONS=77} [2022-12-13 10:30:19,384 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2022-12-13 10:30:19,384 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:19,384 INFO L89 Accepts]: Start accepts. Operand has 98 places, 77 transitions, 704 flow [2022-12-13 10:30:19,385 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:19,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:19,385 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 77 transitions, 704 flow [2022-12-13 10:30:19,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 77 transitions, 704 flow [2022-12-13 10:30:19,408 INFO L130 PetriNetUnfolder]: 60/394 cut-off events. [2022-12-13 10:30:19,408 INFO L131 PetriNetUnfolder]: For 1249/1269 co-relation queries the response was YES. [2022-12-13 10:30:19,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 394 events. 60/394 cut-off events. For 1249/1269 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2913 event pairs, 3 based on Foata normal form. 8/386 useless extension candidates. Maximal degree in co-relation 1349. Up to 53 conditions per place. [2022-12-13 10:30:19,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 77 transitions, 704 flow [2022-12-13 10:30:19,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-13 10:30:19,414 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:19,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 10:30:19,415 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 77 transitions, 704 flow [2022-12-13 10:30:19,415 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 10:30:19,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:19,415 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 10:30:19,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 10:30:19,415 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 10:30:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1570445673, now seen corresponding path program 1 times [2022-12-13 10:30:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:19,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985040067] [2022-12-13 10:30:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:20,425 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 10:30:20,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:20,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985040067] [2022-12-13 10:30:20,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985040067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:20,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:20,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:20,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890067069] [2022-12-13 10:30:20,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:20,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:20,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:20,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:20,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:20,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:30:20,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 77 transitions, 704 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 10:30:20,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:20,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:30:20,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:21,161 INFO L130 PetriNetUnfolder]: 763/1570 cut-off events. [2022-12-13 10:30:21,161 INFO L131 PetriNetUnfolder]: For 7271/7271 co-relation queries the response was YES. [2022-12-13 10:30:21,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7008 conditions, 1570 events. 763/1570 cut-off events. For 7271/7271 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9507 event pairs, 328 based on Foata normal form. 2/1572 useless extension candidates. Maximal degree in co-relation 6956. Up to 1096 conditions per place. [2022-12-13 10:30:21,170 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 109 selfloop transitions, 16 changer transitions 26/151 dead transitions. [2022-12-13 10:30:21,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 151 transitions, 1533 flow [2022-12-13 10:30:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2022-12-13 10:30:21,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-13 10:30:21,171 INFO L175 Difference]: Start difference. First operand has 96 places, 77 transitions, 704 flow. Second operand 9 states and 130 transitions. [2022-12-13 10:30:21,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 151 transitions, 1533 flow [2022-12-13 10:30:21,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 151 transitions, 1487 flow, removed 5 selfloop flow, removed 9 redundant places. [2022-12-13 10:30:21,184 INFO L231 Difference]: Finished difference. Result has 99 places, 82 transitions, 765 flow [2022-12-13 10:30:21,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=765, PETRI_PLACES=99, PETRI_TRANSITIONS=82} [2022-12-13 10:30:21,184 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-12-13 10:30:21,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:21,184 INFO L89 Accepts]: Start accepts. Operand has 99 places, 82 transitions, 765 flow [2022-12-13 10:30:21,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:21,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:21,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 82 transitions, 765 flow [2022-12-13 10:30:21,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 82 transitions, 765 flow [2022-12-13 10:30:21,214 INFO L130 PetriNetUnfolder]: 60/370 cut-off events. [2022-12-13 10:30:21,214 INFO L131 PetriNetUnfolder]: For 1266/1286 co-relation queries the response was YES. [2022-12-13 10:30:21,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 370 events. 60/370 cut-off events. For 1266/1286 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2719 event pairs, 3 based on Foata normal form. 8/358 useless extension candidates. Maximal degree in co-relation 1306. Up to 53 conditions per place. [2022-12-13 10:30:21,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 82 transitions, 765 flow [2022-12-13 10:30:21,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-13 10:30:21,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [764] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| 0)) (= (+ v_~tmp1~0_252 1) v_~n1~0_510) (= v_~n2~0_528 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_69| 0) (= v_~e1~0_292 0) (= (ite (and (< v_~i~0_512 v_~n~0_242) (<= 0 v_~i~0_512)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_69| 0) (= v_~n2~0_529 v_~tmp1~0_252)) InVars {~n2~0=v_~n2~0_529, ~i~0=v_~i~0_512, ~n~0=v_~n~0_242} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_69|, ~n2~0=v_~n2~0_528, ~i~0=v_~i~0_512, ~n1~0=v_~n1~0_510, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|, ~n~0=v_~n~0_242, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_69|, ~tmp1~0=v_~tmp1~0_252, ~e1~0=v_~e1~0_292} 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] and [752] L59-->L71: Formula: (and (= v_~i1~0_223 v_~i~0_480) (= (select (select |v_#memory_int_366| v_~f~0.base_286) (+ v_~f~0.offset_284 (* v_~i1~0_223 4))) v_~i~0_479) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_233| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_233|) (not (= (ite (= (mod v_~e2~0_339 256) 0) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_233| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_233| (ite (or (= v_~n2~0_484 0) (<= v_~n1~0_478 v_~n2~0_484)) 1 0))) InVars {~n2~0=v_~n2~0_484, ~i~0=v_~i~0_480, ~f~0.base=v_~f~0.base_286, ~n1~0=v_~n1~0_478, #memory_int=|v_#memory_int_366|, ~f~0.offset=v_~f~0.offset_284, ~e2~0=v_~e2~0_339} OutVars{~n2~0=v_~n2~0_484, ~i~0=v_~i~0_479, ~f~0.base=v_~f~0.base_286, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_233|, ~n1~0=v_~n1~0_478, #memory_int=|v_#memory_int_366|, ~i1~0=v_~i1~0_223, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_96|, ~f~0.offset=v_~f~0.offset_284, ~e2~0=v_~e2~0_339, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_233|} 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 10:30:21,375 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] L94-->L155-3: Formula: (and (= v_~i2~0_185 v_~i~0_554) (= |v_ULTIMATE.start_main_#t~pre17#1_73| |v_#pthreadsForks_119|) (= |v_#memory_int_396| (store |v_#memory_int_397| |v_ULTIMATE.start_main_~#t3~0#1.base_107| (store (select |v_#memory_int_397| |v_ULTIMATE.start_main_~#t3~0#1.base_107|) |v_ULTIMATE.start_main_~#t3~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre17#1_73|))) (= |v_#pthreadsForks_118| (+ |v_#pthreadsForks_119| 1)) (= (ite (or (< v_~n2~0_566 v_~n1~0_532) (= v_~n1~0_532 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_264|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_264| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_264| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_264|) (not (= (ite (= (mod v_~e1~0_313 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_397| v_~f~0.base_314) (+ v_~f~0.offset_312 (* v_~i2~0_185 4))) v_~i~0_553)) InVars {#pthreadsForks=|v_#pthreadsForks_119|, ~n2~0=v_~n2~0_566, ~i~0=v_~i~0_554, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_314, ~n1~0=v_~n1~0_532, #memory_int=|v_#memory_int_397|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_107|, ~f~0.offset=v_~f~0.offset_312, ~e1~0=v_~e1~0_313} OutVars{~n2~0=v_~n2~0_566, ~i~0=v_~i~0_553, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_314, ~n1~0=v_~n1~0_532, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_107|, ~i2~0=v_~i2~0_185, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_264|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_77|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_73|, ~f~0.offset=v_~f~0.offset_312, ~e1~0=v_~e1~0_313, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_63|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_95|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_264|, #pthreadsForks=|v_#pthreadsForks_118|, #memory_int=|v_#memory_int_396|} 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 [755] L106-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_205| 0)) (= (ite (and (<= 0 v_~i~0_489) (< v_~i~0_489 v_~n~0_230)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_57| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_205| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205|) (= |v_thread2Thread1of1ForFork2_#res#1.base_57| 0) (= v_~n2~0_490 0)) InVars {~i~0=v_~i~0_489, ~n~0=v_~n~0_230} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_205|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_57|, ~n2~0=v_~n2~0_490, ~i~0=v_~i~0_489, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205|, ~n~0=v_~n~0_230, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_57|} 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 10:30:21,469 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] L94-->L155-3: Formula: (and (= v_~i2~0_185 v_~i~0_554) (= |v_ULTIMATE.start_main_#t~pre17#1_73| |v_#pthreadsForks_119|) (= |v_#memory_int_396| (store |v_#memory_int_397| |v_ULTIMATE.start_main_~#t3~0#1.base_107| (store (select |v_#memory_int_397| |v_ULTIMATE.start_main_~#t3~0#1.base_107|) |v_ULTIMATE.start_main_~#t3~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre17#1_73|))) (= |v_#pthreadsForks_118| (+ |v_#pthreadsForks_119| 1)) (= (ite (or (< v_~n2~0_566 v_~n1~0_532) (= v_~n1~0_532 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_264|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_264| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_264| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_264|) (not (= (ite (= (mod v_~e1~0_313 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_397| v_~f~0.base_314) (+ v_~f~0.offset_312 (* v_~i2~0_185 4))) v_~i~0_553)) InVars {#pthreadsForks=|v_#pthreadsForks_119|, ~n2~0=v_~n2~0_566, ~i~0=v_~i~0_554, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_314, ~n1~0=v_~n1~0_532, #memory_int=|v_#memory_int_397|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_107|, ~f~0.offset=v_~f~0.offset_312, ~e1~0=v_~e1~0_313} OutVars{~n2~0=v_~n2~0_566, ~i~0=v_~i~0_553, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_314, ~n1~0=v_~n1~0_532, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_107|, ~i2~0=v_~i2~0_185, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_264|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_77|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_73|, ~f~0.offset=v_~f~0.offset_312, ~e1~0=v_~e1~0_313, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_63|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_95|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_264|, #pthreadsForks=|v_#pthreadsForks_118|, #memory_int=|v_#memory_int_396|} 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 [775] $Ultimate##0-->L71: Formula: (let ((.cse0 (= v_~n2~0_574 0))) (and .cse0 (= |v_thread2Thread1of1ForFork2_#res#1.base_77| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_77| 0) (not (= (ite (= (mod v_~e2~0_371 256) 0) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_269| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_269|) (= v_~e1~0_318 0) (= v_~i1~0_242 v_~i~0_564) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252| (ite (or .cse0 (<= v_~n1~0_538 v_~n2~0_574)) 1 0)) (= (ite (and (< v_~i~0_564 v_~n~0_254) (<= 0 v_~i~0_564)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_269|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|) (= v_~n2~0_575 v_~tmp1~0_266) (= (select (select |v_#memory_int_403| v_~f~0.base_319) (+ v_~f~0.offset_317 (* v_~i1~0_242 4))) v_~i~0_563) (= v_~n1~0_538 (+ v_~tmp1~0_266 1)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_269| 0)))) InVars {~n2~0=v_~n2~0_575, ~i~0=v_~i~0_564, ~f~0.base=v_~f~0.base_319, #memory_int=|v_#memory_int_403|, ~n~0=v_~n~0_254, ~f~0.offset=v_~f~0.offset_317, ~e2~0=v_~e2~0_371} OutVars{~n2~0=v_~n2~0_574, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_77|, ~i~0=v_~i~0_563, ~f~0.base=v_~f~0.base_319, ~n1~0=v_~n1~0_538, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_269|, ~i1~0=v_~i1~0_242, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_77|, ~f~0.offset=v_~f~0.offset_317, ~e2~0=v_~e2~0_371, ~e1~0=v_~e1~0_318, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_269|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_252|, #memory_int=|v_#memory_int_403|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_115|, ~n~0=v_~n~0_254, ~tmp1~0=v_~tmp1~0_266, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_252|} AuxVars[] AssignedVars[~n2~0, thread2Thread1of1ForFork2_#res#1.offset, ~i~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i1~0, thread2Thread1of1ForFork2_#res#1.base, ~e1~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, ~tmp1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 10:30:21,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [774] L94-->L155-3: Formula: (and (= v_~i2~0_185 v_~i~0_554) (= |v_ULTIMATE.start_main_#t~pre17#1_73| |v_#pthreadsForks_119|) (= |v_#memory_int_396| (store |v_#memory_int_397| |v_ULTIMATE.start_main_~#t3~0#1.base_107| (store (select |v_#memory_int_397| |v_ULTIMATE.start_main_~#t3~0#1.base_107|) |v_ULTIMATE.start_main_~#t3~0#1.offset_69| |v_ULTIMATE.start_main_#t~pre17#1_73|))) (= |v_#pthreadsForks_118| (+ |v_#pthreadsForks_119| 1)) (= (ite (or (< v_~n2~0_566 v_~n1~0_532) (= v_~n1~0_532 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_264|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_264| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_264| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_264|) (not (= (ite (= (mod v_~e1~0_313 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_397| v_~f~0.base_314) (+ v_~f~0.offset_312 (* v_~i2~0_185 4))) v_~i~0_553)) InVars {#pthreadsForks=|v_#pthreadsForks_119|, ~n2~0=v_~n2~0_566, ~i~0=v_~i~0_554, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_314, ~n1~0=v_~n1~0_532, #memory_int=|v_#memory_int_397|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_107|, ~f~0.offset=v_~f~0.offset_312, ~e1~0=v_~e1~0_313} OutVars{~n2~0=v_~n2~0_566, ~i~0=v_~i~0_553, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_69|, ~f~0.base=v_~f~0.base_314, ~n1~0=v_~n1~0_532, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_107|, ~i2~0=v_~i2~0_185, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_264|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_77|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_73|, ~f~0.offset=v_~f~0.offset_312, ~e1~0=v_~e1~0_313, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_63|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_95|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_264|, #pthreadsForks=|v_#pthreadsForks_118|, #memory_int=|v_#memory_int_396|} 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] L106-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_207| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_59| 0) (= v_~n2~0_492 0) (= (ite (and (<= 0 v_~i~0_491) (< v_~i~0_491 v_~n~0_232)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_207|) (= v_~n2~0_493 v_~tmp1~0_239) (= |v_thread2Thread1of1ForFork2_#res#1.base_59| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_207| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_207|) (= v_~e1~0_274 1)) InVars {~n2~0=v_~n2~0_493, ~i~0=v_~i~0_491, ~n~0=v_~n~0_232} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_207|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_59|, ~n2~0=v_~n2~0_492, ~i~0=v_~i~0_491, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_207|, ~n~0=v_~n~0_232, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_59|, ~tmp1~0=v_~tmp1~0_239, ~e1~0=v_~e1~0_274} 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 10:30:21,780 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:30:21,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 597 [2022-12-13 10:30:21,781 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 82 transitions, 823 flow [2022-12-13 10:30:21,781 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 10:30:21,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:21,781 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 10:30:21,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 10:30:21,781 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 10:30:21,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash -550180631, now seen corresponding path program 1 times [2022-12-13 10:30:21,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:21,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9420655] [2022-12-13 10:30:21,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:21,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:22,102 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 10:30:22,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:22,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9420655] [2022-12-13 10:30:22,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9420655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:22,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:22,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:30:22,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009770671] [2022-12-13 10:30:22,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:22,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:30:22,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:22,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:30:22,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:30:22,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 10:30:22,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 82 transitions, 823 flow. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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 10:30:22,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:22,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 10:30:22,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:22,406 INFO L130 PetriNetUnfolder]: 754/1553 cut-off events. [2022-12-13 10:30:22,406 INFO L131 PetriNetUnfolder]: For 7468/7468 co-relation queries the response was YES. [2022-12-13 10:30:22,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6969 conditions, 1553 events. 754/1553 cut-off events. For 7468/7468 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9332 event pairs, 354 based on Foata normal form. 1/1554 useless extension candidates. Maximal degree in co-relation 6915. Up to 1096 conditions per place. [2022-12-13 10:30:22,413 INFO L137 encePairwiseOnDemand]: 41/55 looper letters, 104 selfloop transitions, 13 changer transitions 29/146 dead transitions. [2022-12-13 10:30:22,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 146 transitions, 1548 flow [2022-12-13 10:30:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:30:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:30:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-12-13 10:30:22,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3246753246753247 [2022-12-13 10:30:22,414 INFO L175 Difference]: Start difference. First operand has 97 places, 82 transitions, 823 flow. Second operand 7 states and 125 transitions. [2022-12-13 10:30:22,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 146 transitions, 1548 flow [2022-12-13 10:30:22,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 146 transitions, 1499 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-13 10:30:22,427 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 783 flow [2022-12-13 10:30:22,428 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=783, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2022-12-13 10:30:22,428 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-12-13 10:30:22,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:22,428 INFO L89 Accepts]: Start accepts. Operand has 99 places, 81 transitions, 783 flow [2022-12-13 10:30:22,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:22,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:22,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 81 transitions, 783 flow [2022-12-13 10:30:22,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 81 transitions, 783 flow [2022-12-13 10:30:22,453 INFO L130 PetriNetUnfolder]: 62/408 cut-off events. [2022-12-13 10:30:22,454 INFO L131 PetriNetUnfolder]: For 1460/1484 co-relation queries the response was YES. [2022-12-13 10:30:22,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 408 events. 62/408 cut-off events. For 1460/1484 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3074 event pairs, 3 based on Foata normal form. 8/400 useless extension candidates. Maximal degree in co-relation 1418. Up to 55 conditions per place. [2022-12-13 10:30:22,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 81 transitions, 783 flow [2022-12-13 10:30:22,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-13 10:30:22,457 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:22,458 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 10:30:22,458 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 81 transitions, 783 flow [2022-12-13 10:30:22,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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 10:30:22,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:22,458 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 10:30:22,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 10:30:22,458 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 10:30:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash -188824247, now seen corresponding path program 2 times [2022-12-13 10:30:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:22,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367890523] [2022-12-13 10:30:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:22,845 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 10:30:22,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:22,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367890523] [2022-12-13 10:30:22,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367890523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:22,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:22,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:30:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086798171] [2022-12-13 10:30:22,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:22,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:22,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 10:30:22,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 81 transitions, 783 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 10:30:22,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:22,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 10:30:22,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:23,250 INFO L130 PetriNetUnfolder]: 746/1553 cut-off events. [2022-12-13 10:30:23,250 INFO L131 PetriNetUnfolder]: For 7373/7373 co-relation queries the response was YES. [2022-12-13 10:30:23,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6937 conditions, 1553 events. 746/1553 cut-off events. For 7373/7373 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9430 event pairs, 343 based on Foata normal form. 2/1555 useless extension candidates. Maximal degree in co-relation 6883. Up to 1096 conditions per place. [2022-12-13 10:30:23,257 INFO L137 encePairwiseOnDemand]: 39/54 looper letters, 104 selfloop transitions, 13 changer transitions 30/147 dead transitions. [2022-12-13 10:30:23,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 147 transitions, 1551 flow [2022-12-13 10:30:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:30:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:30:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2022-12-13 10:30:23,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-13 10:30:23,257 INFO L175 Difference]: Start difference. First operand has 97 places, 81 transitions, 783 flow. Second operand 8 states and 126 transitions. [2022-12-13 10:30:23,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 147 transitions, 1551 flow [2022-12-13 10:30:23,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 147 transitions, 1519 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 10:30:23,269 INFO L231 Difference]: Finished difference. Result has 100 places, 79 transitions, 753 flow [2022-12-13 10:30:23,269 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=753, PETRI_PLACES=100, PETRI_TRANSITIONS=79} [2022-12-13 10:30:23,269 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2022-12-13 10:30:23,269 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:23,270 INFO L89 Accepts]: Start accepts. Operand has 100 places, 79 transitions, 753 flow [2022-12-13 10:30:23,270 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:23,270 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:23,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 79 transitions, 753 flow [2022-12-13 10:30:23,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 79 transitions, 753 flow [2022-12-13 10:30:23,294 INFO L130 PetriNetUnfolder]: 58/392 cut-off events. [2022-12-13 10:30:23,294 INFO L131 PetriNetUnfolder]: For 1385/1407 co-relation queries the response was YES. [2022-12-13 10:30:23,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 392 events. 58/392 cut-off events. For 1385/1407 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2924 event pairs, 3 based on Foata normal form. 8/384 useless extension candidates. Maximal degree in co-relation 1363. Up to 54 conditions per place. [2022-12-13 10:30:23,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 79 transitions, 753 flow [2022-12-13 10:30:23,297 INFO L226 LiptonReduction]: Number of co-enabled transitions 490 [2022-12-13 10:30:23,299 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:23,300 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 10:30:23,300 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 79 transitions, 753 flow [2022-12-13 10:30:23,300 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 10:30:23,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:23,300 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 10:30:23,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 10:30:23,300 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 10:30:23,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1543905913, now seen corresponding path program 1 times [2022-12-13 10:30:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:23,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257208653] [2022-12-13 10:30:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:23,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:23,569 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 10:30:23,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:23,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257208653] [2022-12-13 10:30:23,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257208653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:23,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:23,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:30:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929554061] [2022-12-13 10:30:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:23,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:30:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:30:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:30:23,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:30:23,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 79 transitions, 753 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 10:30:23,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:23,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:30:23,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:23,923 INFO L130 PetriNetUnfolder]: 760/1578 cut-off events. [2022-12-13 10:30:23,924 INFO L131 PetriNetUnfolder]: For 7392/7392 co-relation queries the response was YES. [2022-12-13 10:30:23,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6990 conditions, 1578 events. 760/1578 cut-off events. For 7392/7392 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9659 event pairs, 361 based on Foata normal form. 2/1580 useless extension candidates. Maximal degree in co-relation 6936. Up to 1096 conditions per place. [2022-12-13 10:30:23,931 INFO L137 encePairwiseOnDemand]: 40/53 looper letters, 99 selfloop transitions, 10 changer transitions 38/147 dead transitions. [2022-12-13 10:30:23,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 147 transitions, 1498 flow [2022-12-13 10:30:23,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:30:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:30:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2022-12-13 10:30:23,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29952830188679247 [2022-12-13 10:30:23,934 INFO L175 Difference]: Start difference. First operand has 97 places, 79 transitions, 753 flow. Second operand 8 states and 127 transitions. [2022-12-13 10:30:23,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 147 transitions, 1498 flow [2022-12-13 10:30:23,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 147 transitions, 1456 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-12-13 10:30:23,945 INFO L231 Difference]: Finished difference. Result has 98 places, 76 transitions, 676 flow [2022-12-13 10:30:23,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=676, PETRI_PLACES=98, PETRI_TRANSITIONS=76} [2022-12-13 10:30:23,946 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2022-12-13 10:30:23,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:23,946 INFO L89 Accepts]: Start accepts. Operand has 98 places, 76 transitions, 676 flow [2022-12-13 10:30:23,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:23,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:23,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 76 transitions, 676 flow [2022-12-13 10:30:23,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 76 transitions, 676 flow [2022-12-13 10:30:23,970 INFO L130 PetriNetUnfolder]: 53/364 cut-off events. [2022-12-13 10:30:23,970 INFO L131 PetriNetUnfolder]: For 1097/1115 co-relation queries the response was YES. [2022-12-13 10:30:23,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 364 events. 53/364 cut-off events. For 1097/1115 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2671 event pairs, 3 based on Foata normal form. 8/352 useless extension candidates. Maximal degree in co-relation 1218. Up to 52 conditions per place. [2022-12-13 10:30:23,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 76 transitions, 676 flow [2022-12-13 10:30:23,973 INFO L226 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-13 10:30:23,975 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:23,978 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 10:30:23,979 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 676 flow [2022-12-13 10:30:23,979 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 10:30:23,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:23,979 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 10:30:23,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 10:30:23,979 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 10:30:23,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:23,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1901101758, now seen corresponding path program 1 times [2022-12-13 10:30:23,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:23,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127677331] [2022-12-13 10:30:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:23,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:30:24,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:24,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127677331] [2022-12-13 10:30:24,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127677331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:24,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:24,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:24,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698148784] [2022-12-13 10:30:24,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:24,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:24,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:24,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:24,307 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:30:24,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 676 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 10:30:24,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:24,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:30:24,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:24,718 INFO L130 PetriNetUnfolder]: 722/1499 cut-off events. [2022-12-13 10:30:24,719 INFO L131 PetriNetUnfolder]: For 6934/6934 co-relation queries the response was YES. [2022-12-13 10:30:24,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6638 conditions, 1499 events. 722/1499 cut-off events. For 6934/6934 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8974 event pairs, 309 based on Foata normal form. 2/1501 useless extension candidates. Maximal degree in co-relation 6585. Up to 1096 conditions per place. [2022-12-13 10:30:24,725 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 97 selfloop transitions, 12 changer transitions 35/144 dead transitions. [2022-12-13 10:30:24,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 144 transitions, 1417 flow [2022-12-13 10:30:24,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:30:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:30:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2022-12-13 10:30:24,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3088235294117647 [2022-12-13 10:30:24,726 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 676 flow. Second operand 8 states and 126 transitions. [2022-12-13 10:30:24,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 144 transitions, 1417 flow [2022-12-13 10:30:24,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 144 transitions, 1387 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 10:30:24,739 INFO L231 Difference]: Finished difference. Result has 95 places, 72 transitions, 652 flow [2022-12-13 10:30:24,739 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=652, PETRI_PLACES=95, PETRI_TRANSITIONS=72} [2022-12-13 10:30:24,740 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2022-12-13 10:30:24,740 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:24,740 INFO L89 Accepts]: Start accepts. Operand has 95 places, 72 transitions, 652 flow [2022-12-13 10:30:24,741 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:24,741 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:24,741 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 72 transitions, 652 flow [2022-12-13 10:30:24,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 72 transitions, 652 flow [2022-12-13 10:30:24,768 INFO L130 PetriNetUnfolder]: 52/355 cut-off events. [2022-12-13 10:30:24,769 INFO L131 PetriNetUnfolder]: For 1119/1137 co-relation queries the response was YES. [2022-12-13 10:30:24,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 355 events. 52/355 cut-off events. For 1119/1137 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2546 event pairs, 3 based on Foata normal form. 8/347 useless extension candidates. Maximal degree in co-relation 1100. Up to 52 conditions per place. [2022-12-13 10:30:24,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 72 transitions, 652 flow [2022-12-13 10:30:24,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 10:30:24,776 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:24,777 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 10:30:24,777 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 72 transitions, 652 flow [2022-12-13 10:30:24,777 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 10:30:24,777 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:24,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] [2022-12-13 10:30:24,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 10:30:24,777 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 10:30:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1915025501, now seen corresponding path program 2 times [2022-12-13 10:30:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:24,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738334251] [2022-12-13 10:30:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:25,126 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 10:30:25,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:25,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738334251] [2022-12-13 10:30:25,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738334251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:25,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:25,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930672489] [2022-12-13 10:30:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:25,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:25,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:25,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:25,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:25,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:30:25,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 72 transitions, 652 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 10:30:25,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:25,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:30:25,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:25,497 INFO L130 PetriNetUnfolder]: 670/1365 cut-off events. [2022-12-13 10:30:25,497 INFO L131 PetriNetUnfolder]: For 6553/6553 co-relation queries the response was YES. [2022-12-13 10:30:25,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6176 conditions, 1365 events. 670/1365 cut-off events. For 6553/6553 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7781 event pairs, 309 based on Foata normal form. 2/1367 useless extension candidates. Maximal degree in co-relation 5641. Up to 1096 conditions per place. [2022-12-13 10:30:25,504 INFO L137 encePairwiseOnDemand]: 38/50 looper letters, 73 selfloop transitions, 6 changer transitions 44/123 dead transitions. [2022-12-13 10:30:25,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 123 transitions, 1275 flow [2022-12-13 10:30:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-12-13 10:30:25,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23555555555555555 [2022-12-13 10:30:25,505 INFO L175 Difference]: Start difference. First operand has 93 places, 72 transitions, 652 flow. Second operand 9 states and 106 transitions. [2022-12-13 10:30:25,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 123 transitions, 1275 flow [2022-12-13 10:30:25,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 123 transitions, 1243 flow, removed 1 selfloop flow, removed 8 redundant places. [2022-12-13 10:30:25,514 INFO L231 Difference]: Finished difference. Result has 95 places, 65 transitions, 552 flow [2022-12-13 10:30:25,514 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=552, PETRI_PLACES=95, PETRI_TRANSITIONS=65} [2022-12-13 10:30:25,515 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 54 predicate places. [2022-12-13 10:30:25,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:25,515 INFO L89 Accepts]: Start accepts. Operand has 95 places, 65 transitions, 552 flow [2022-12-13 10:30:25,516 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:25,516 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:25,516 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 65 transitions, 552 flow [2022-12-13 10:30:25,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 65 transitions, 552 flow [2022-12-13 10:30:25,535 INFO L130 PetriNetUnfolder]: 49/292 cut-off events. [2022-12-13 10:30:25,535 INFO L131 PetriNetUnfolder]: For 808/821 co-relation queries the response was YES. [2022-12-13 10:30:25,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 292 events. 49/292 cut-off events. For 808/821 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2012 event pairs, 2 based on Foata normal form. 5/282 useless extension candidates. Maximal degree in co-relation 986. Up to 44 conditions per place. [2022-12-13 10:30:25,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 65 transitions, 552 flow [2022-12-13 10:30:25,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-13 10:30:27,221 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:27,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1707 [2022-12-13 10:30:27,222 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 544 flow [2022-12-13 10:30:27,222 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 10:30:27,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:27,222 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 10:30:27,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 10:30:27,222 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 10:30:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1899785942, now seen corresponding path program 1 times [2022-12-13 10:30:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:27,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217331628] [2022-12-13 10:30:27,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:27,331 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 10:30:27,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:27,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217331628] [2022-12-13 10:30:27,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217331628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:27,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:27,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:30:27,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770727362] [2022-12-13 10:30:27,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:27,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:30:27,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:27,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:30:27,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:30:27,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 10:30:27,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 544 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 10:30:27,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:27,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 10:30:27,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:27,582 INFO L130 PetriNetUnfolder]: 606/1228 cut-off events. [2022-12-13 10:30:27,582 INFO L131 PetriNetUnfolder]: For 5677/5677 co-relation queries the response was YES. [2022-12-13 10:30:27,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5442 conditions, 1228 events. 606/1228 cut-off events. For 5677/5677 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6983 event pairs, 213 based on Foata normal form. 4/1232 useless extension candidates. Maximal degree in co-relation 5399. Up to 781 conditions per place. [2022-12-13 10:30:27,587 INFO L137 encePairwiseOnDemand]: 36/47 looper letters, 78 selfloop transitions, 13 changer transitions 24/115 dead transitions. [2022-12-13 10:30:27,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 115 transitions, 1117 flow [2022-12-13 10:30:27,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:30:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:30:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-13 10:30:27,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38652482269503546 [2022-12-13 10:30:27,588 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 544 flow. Second operand 6 states and 109 transitions. [2022-12-13 10:30:27,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 115 transitions, 1117 flow [2022-12-13 10:30:27,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 115 transitions, 1085 flow, removed 12 selfloop flow, removed 8 redundant places. [2022-12-13 10:30:27,595 INFO L231 Difference]: Finished difference. Result has 81 places, 63 transitions, 544 flow [2022-12-13 10:30:27,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=544, PETRI_PLACES=81, PETRI_TRANSITIONS=63} [2022-12-13 10:30:27,596 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 40 predicate places. [2022-12-13 10:30:27,596 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:27,596 INFO L89 Accepts]: Start accepts. Operand has 81 places, 63 transitions, 544 flow [2022-12-13 10:30:27,596 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:27,596 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:27,597 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 63 transitions, 544 flow [2022-12-13 10:30:27,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 63 transitions, 544 flow [2022-12-13 10:30:27,612 INFO L130 PetriNetUnfolder]: 42/264 cut-off events. [2022-12-13 10:30:27,612 INFO L131 PetriNetUnfolder]: For 748/761 co-relation queries the response was YES. [2022-12-13 10:30:27,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 264 events. 42/264 cut-off events. For 748/761 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1762 event pairs, 6 based on Foata normal form. 5/250 useless extension candidates. Maximal degree in co-relation 791. Up to 44 conditions per place. [2022-12-13 10:30:27,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 63 transitions, 544 flow [2022-12-13 10:30:27,614 INFO L226 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-13 10:30:27,620 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:27,621 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 10:30:27,621 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 63 transitions, 544 flow [2022-12-13 10:30:27,621 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 10:30:27,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:27,621 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 10:30:27,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 10:30:27,621 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 10:30:27,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash -19521710, now seen corresponding path program 2 times [2022-12-13 10:30:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:27,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517296733] [2022-12-13 10:30:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:28,182 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 10:30:28,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:28,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517296733] [2022-12-13 10:30:28,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517296733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:28,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:28,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:30:28,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753882072] [2022-12-13 10:30:28,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:28,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:30:28,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:28,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:30:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:30:28,184 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 10:30:28,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 63 transitions, 544 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 10:30:28,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:28,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 10:30:28,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:28,739 INFO L130 PetriNetUnfolder]: 1257/2579 cut-off events. [2022-12-13 10:30:28,740 INFO L131 PetriNetUnfolder]: For 11990/11990 co-relation queries the response was YES. [2022-12-13 10:30:28,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11591 conditions, 2579 events. 1257/2579 cut-off events. For 11990/11990 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17741 event pairs, 459 based on Foata normal form. 4/2583 useless extension candidates. Maximal degree in co-relation 9776. Up to 1056 conditions per place. [2022-12-13 10:30:28,750 INFO L137 encePairwiseOnDemand]: 31/47 looper letters, 163 selfloop transitions, 20 changer transitions 28/211 dead transitions. [2022-12-13 10:30:28,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 211 transitions, 2156 flow [2022-12-13 10:30:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:30:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:30:28,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2022-12-13 10:30:28,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3893617021276596 [2022-12-13 10:30:28,751 INFO L175 Difference]: Start difference. First operand has 81 places, 63 transitions, 544 flow. Second operand 10 states and 183 transitions. [2022-12-13 10:30:28,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 211 transitions, 2156 flow [2022-12-13 10:30:28,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 211 transitions, 2072 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-13 10:30:28,768 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 708 flow [2022-12-13 10:30:28,768 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=708, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2022-12-13 10:30:28,768 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 48 predicate places. [2022-12-13 10:30:28,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:28,768 INFO L89 Accepts]: Start accepts. Operand has 89 places, 78 transitions, 708 flow [2022-12-13 10:30:28,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:28,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:28,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 78 transitions, 708 flow [2022-12-13 10:30:28,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 78 transitions, 708 flow [2022-12-13 10:30:28,805 INFO L130 PetriNetUnfolder]: 94/618 cut-off events. [2022-12-13 10:30:28,806 INFO L131 PetriNetUnfolder]: For 2387/2436 co-relation queries the response was YES. [2022-12-13 10:30:28,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2318 conditions, 618 events. 94/618 cut-off events. For 2387/2436 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5582 event pairs, 16 based on Foata normal form. 14/595 useless extension candidates. Maximal degree in co-relation 2270. Up to 113 conditions per place. [2022-12-13 10:30:28,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 78 transitions, 708 flow [2022-12-13 10:30:28,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 504 [2022-12-13 10:30:28,813 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 10:30:28,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [753] L59-->L71: Formula: (and (not (= 0 (ite (= (mod v_~e2~0_341 256) 0) 1 0))) (= (select (select |v_#memory_int_368| v_~f~0.base_288) (+ v_~f~0.offset_286 (* v_~i1~0_225 4))) v_~i~0_483) (= v_~i1~0_225 v_~i~0_484) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| (ite (or (<= v_~n1~0_480 v_~n2~0_486) (= v_~n2~0_486 0)) 1 0))) InVars {~n2~0=v_~n2~0_486, ~i~0=v_~i~0_484, ~f~0.base=v_~f~0.base_288, ~n1~0=v_~n1~0_480, #memory_int=|v_#memory_int_368|, ~f~0.offset=v_~f~0.offset_286, ~e2~0=v_~e2~0_341} OutVars{~n2~0=v_~n2~0_486, ~i~0=v_~i~0_483, ~f~0.base=v_~f~0.base_288, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235|, ~n1~0=v_~n1~0_480, #memory_int=|v_#memory_int_368|, ~i1~0=v_~i1~0_225, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_98|, ~f~0.offset=v_~f~0.offset_286, ~e2~0=v_~e2~0_341, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|} 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 10:30:28,982 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:30:28,982 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-13 10:30:28,983 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 716 flow [2022-12-13 10:30:28,983 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 10:30:28,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:28,983 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 10:30:28,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 10:30:28,984 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 10:30:28,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash -10538420, now seen corresponding path program 1 times [2022-12-13 10:30:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:28,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770555370] [2022-12-13 10:30:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:28,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:29,419 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 10:30:29,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:29,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770555370] [2022-12-13 10:30:29,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770555370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:29,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:29,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:29,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29108306] [2022-12-13 10:30:29,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:29,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:29,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:29,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:29,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:29,421 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:30:29,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 716 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 10:30:29,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:29,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:30:29,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:30,107 INFO L130 PetriNetUnfolder]: 1159/2425 cut-off events. [2022-12-13 10:30:30,107 INFO L131 PetriNetUnfolder]: For 14960/14960 co-relation queries the response was YES. [2022-12-13 10:30:30,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11599 conditions, 2425 events. 1159/2425 cut-off events. For 14960/14960 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16763 event pairs, 495 based on Foata normal form. 4/2429 useless extension candidates. Maximal degree in co-relation 11540. Up to 1056 conditions per place. [2022-12-13 10:30:30,120 INFO L137 encePairwiseOnDemand]: 34/50 looper letters, 152 selfloop transitions, 23 changer transitions 47/222 dead transitions. [2022-12-13 10:30:30,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 222 transitions, 2285 flow [2022-12-13 10:30:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:30:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:30:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2022-12-13 10:30:30,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35454545454545455 [2022-12-13 10:30:30,121 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 716 flow. Second operand 11 states and 195 transitions. [2022-12-13 10:30:30,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 222 transitions, 2285 flow [2022-12-13 10:30:30,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 222 transitions, 2201 flow, removed 37 selfloop flow, removed 4 redundant places. [2022-12-13 10:30:30,150 INFO L231 Difference]: Finished difference. Result has 99 places, 86 transitions, 853 flow [2022-12-13 10:30:30,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=853, PETRI_PLACES=99, PETRI_TRANSITIONS=86} [2022-12-13 10:30:30,150 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 58 predicate places. [2022-12-13 10:30:30,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:30,151 INFO L89 Accepts]: Start accepts. Operand has 99 places, 86 transitions, 853 flow [2022-12-13 10:30:30,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:30,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:30,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 86 transitions, 853 flow [2022-12-13 10:30:30,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 86 transitions, 853 flow [2022-12-13 10:30:30,193 INFO L130 PetriNetUnfolder]: 94/632 cut-off events. [2022-12-13 10:30:30,193 INFO L131 PetriNetUnfolder]: For 2716/2768 co-relation queries the response was YES. [2022-12-13 10:30:30,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 632 events. 94/632 cut-off events. For 2716/2768 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5715 event pairs, 19 based on Foata normal form. 15/604 useless extension candidates. Maximal degree in co-relation 2370. Up to 105 conditions per place. [2022-12-13 10:30:30,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 86 transitions, 853 flow [2022-12-13 10:30:30,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-13 10:30:30,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:30,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 10:30:30,320 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 85 transitions, 865 flow [2022-12-13 10:30:30,320 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 10:30:30,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:30,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, 1] [2022-12-13 10:30:30,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 10:30:30,321 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 10:30:30,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:30,321 INFO L85 PathProgramCache]: Analyzing trace with hash 685503034, now seen corresponding path program 1 times [2022-12-13 10:30:30,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:30,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515323129] [2022-12-13 10:30:30,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:30,778 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 10:30:30,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:30,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515323129] [2022-12-13 10:30:30,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515323129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:30,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:30,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:30:30,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013933311] [2022-12-13 10:30:30,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:30,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:30,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:30,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:30,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:30,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:30:30,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 85 transitions, 865 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 10:30:30,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:30,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:30:30,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:31,247 INFO L130 PetriNetUnfolder]: 1114/2336 cut-off events. [2022-12-13 10:30:31,247 INFO L131 PetriNetUnfolder]: For 16156/16156 co-relation queries the response was YES. [2022-12-13 10:30:31,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11624 conditions, 2336 events. 1114/2336 cut-off events. For 16156/16156 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15826 event pairs, 556 based on Foata normal form. 2/2338 useless extension candidates. Maximal degree in co-relation 11550. Up to 1056 conditions per place. [2022-12-13 10:30:31,255 INFO L137 encePairwiseOnDemand]: 40/53 looper letters, 146 selfloop transitions, 13 changer transitions 31/190 dead transitions. [2022-12-13 10:30:31,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 190 transitions, 2071 flow [2022-12-13 10:30:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:30:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:30:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2022-12-13 10:30:31,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37735849056603776 [2022-12-13 10:30:31,256 INFO L175 Difference]: Start difference. First operand has 97 places, 85 transitions, 865 flow. Second operand 8 states and 160 transitions. [2022-12-13 10:30:31,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 190 transitions, 2071 flow [2022-12-13 10:30:31,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 190 transitions, 2031 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 10:30:31,278 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 793 flow [2022-12-13 10:30:31,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=92, 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=8, PETRI_FLOW=793, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2022-12-13 10:30:31,278 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2022-12-13 10:30:31,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:31,278 INFO L89 Accepts]: Start accepts. Operand has 101 places, 82 transitions, 793 flow [2022-12-13 10:30:31,279 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:31,279 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:31,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 82 transitions, 793 flow [2022-12-13 10:30:31,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 82 transitions, 793 flow [2022-12-13 10:30:31,313 INFO L130 PetriNetUnfolder]: 86/584 cut-off events. [2022-12-13 10:30:31,314 INFO L131 PetriNetUnfolder]: For 2487/2538 co-relation queries the response was YES. [2022-12-13 10:30:31,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2248 conditions, 584 events. 86/584 cut-off events. For 2487/2538 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5116 event pairs, 14 based on Foata normal form. 14/554 useless extension candidates. Maximal degree in co-relation 2195. Up to 103 conditions per place. [2022-12-13 10:30:31,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 82 transitions, 793 flow [2022-12-13 10:30:31,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-13 10:30:31,320 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:31,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 10:30:31,321 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 82 transitions, 793 flow [2022-12-13 10:30:31,321 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 10:30:31,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:31,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, 1] [2022-12-13 10:30:31,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 10:30:31,321 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 10:30:31,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:31,321 INFO L85 PathProgramCache]: Analyzing trace with hash -342626107, now seen corresponding path program 1 times [2022-12-13 10:30:31,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:31,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528176988] [2022-12-13 10:30:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:31,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:31,749 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 10:30:31,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:31,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528176988] [2022-12-13 10:30:31,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528176988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:31,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:31,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:31,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544065694] [2022-12-13 10:30:31,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:31,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:31,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:31,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:31,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:31,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:30:31,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 82 transitions, 793 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 10:30:31,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:31,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:30:31,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:32,236 INFO L130 PetriNetUnfolder]: 1088/2282 cut-off events. [2022-12-13 10:30:32,237 INFO L131 PetriNetUnfolder]: For 15017/15017 co-relation queries the response was YES. [2022-12-13 10:30:32,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11260 conditions, 2282 events. 1088/2282 cut-off events. For 15017/15017 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15474 event pairs, 480 based on Foata normal form. 2/2284 useless extension candidates. Maximal degree in co-relation 11196. Up to 1056 conditions per place. [2022-12-13 10:30:32,247 INFO L137 encePairwiseOnDemand]: 36/50 looper letters, 156 selfloop transitions, 21 changer transitions 15/192 dead transitions. [2022-12-13 10:30:32,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 192 transitions, 2032 flow [2022-12-13 10:30:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:32,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2022-12-13 10:30:32,250 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2022-12-13 10:30:32,250 INFO L175 Difference]: Start difference. First operand has 99 places, 82 transitions, 793 flow. Second operand 9 states and 168 transitions. [2022-12-13 10:30:32,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 192 transitions, 2032 flow [2022-12-13 10:30:32,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 192 transitions, 1996 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 10:30:32,271 INFO L231 Difference]: Finished difference. Result has 103 places, 84 transitions, 848 flow [2022-12-13 10:30:32,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=848, PETRI_PLACES=103, PETRI_TRANSITIONS=84} [2022-12-13 10:30:32,272 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2022-12-13 10:30:32,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:32,272 INFO L89 Accepts]: Start accepts. Operand has 103 places, 84 transitions, 848 flow [2022-12-13 10:30:32,273 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:32,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:32,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 84 transitions, 848 flow [2022-12-13 10:30:32,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 84 transitions, 848 flow [2022-12-13 10:30:32,308 INFO L130 PetriNetUnfolder]: 83/588 cut-off events. [2022-12-13 10:30:32,309 INFO L131 PetriNetUnfolder]: For 2671/2722 co-relation queries the response was YES. [2022-12-13 10:30:32,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2294 conditions, 588 events. 83/588 cut-off events. For 2671/2722 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5223 event pairs, 18 based on Foata normal form. 14/559 useless extension candidates. Maximal degree in co-relation 2240. Up to 105 conditions per place. [2022-12-13 10:30:32,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 84 transitions, 848 flow [2022-12-13 10:30:32,312 INFO L226 LiptonReduction]: Number of co-enabled transitions 532 [2022-12-13 10:30:32,315 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:32,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 10:30:32,316 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 84 transitions, 848 flow [2022-12-13 10:30:32,316 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 10:30:32,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:32,317 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 10:30:32,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 10:30:32,317 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 10:30:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash -653315278, now seen corresponding path program 2 times [2022-12-13 10:30:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:32,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646168970] [2022-12-13 10:30:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:32,740 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 10:30:32,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:32,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646168970] [2022-12-13 10:30:32,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646168970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:32,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:32,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:32,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918627699] [2022-12-13 10:30:32,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:32,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:32,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:32,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:30:32,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 84 transitions, 848 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 10:30:32,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:32,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:30:32,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:33,342 INFO L130 PetriNetUnfolder]: 1189/2486 cut-off events. [2022-12-13 10:30:33,342 INFO L131 PetriNetUnfolder]: For 17939/17939 co-relation queries the response was YES. [2022-12-13 10:30:33,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12467 conditions, 2486 events. 1189/2486 cut-off events. For 17939/17939 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17160 event pairs, 448 based on Foata normal form. 2/2488 useless extension candidates. Maximal degree in co-relation 12396. Up to 1056 conditions per place. [2022-12-13 10:30:33,353 INFO L137 encePairwiseOnDemand]: 35/49 looper letters, 186 selfloop transitions, 31 changer transitions 19/236 dead transitions. [2022-12-13 10:30:33,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 236 transitions, 2514 flow [2022-12-13 10:30:33,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:30:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:30:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 202 transitions. [2022-12-13 10:30:33,354 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3435374149659864 [2022-12-13 10:30:33,354 INFO L175 Difference]: Start difference. First operand has 102 places, 84 transitions, 848 flow. Second operand 12 states and 202 transitions. [2022-12-13 10:30:33,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 236 transitions, 2514 flow [2022-12-13 10:30:33,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 236 transitions, 2449 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-13 10:30:33,381 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 1090 flow [2022-12-13 10:30:33,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1090, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2022-12-13 10:30:33,381 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2022-12-13 10:30:33,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:33,381 INFO L89 Accepts]: Start accepts. Operand has 113 places, 97 transitions, 1090 flow [2022-12-13 10:30:33,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:33,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:33,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 97 transitions, 1090 flow [2022-12-13 10:30:33,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 97 transitions, 1090 flow [2022-12-13 10:30:33,423 INFO L130 PetriNetUnfolder]: 100/646 cut-off events. [2022-12-13 10:30:33,423 INFO L131 PetriNetUnfolder]: For 5081/5171 co-relation queries the response was YES. [2022-12-13 10:30:33,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 646 events. 100/646 cut-off events. For 5081/5171 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5810 event pairs, 20 based on Foata normal form. 16/619 useless extension candidates. Maximal degree in co-relation 2765. Up to 116 conditions per place. [2022-12-13 10:30:33,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 97 transitions, 1090 flow [2022-12-13 10:30:33,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 602 [2022-12-13 10:30:33,459 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:33,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 10:30:33,460 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 97 transitions, 1098 flow [2022-12-13 10:30:33,460 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 10:30:33,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:33,460 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 10:30:33,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 10:30:33,460 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 10:30:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:33,460 INFO L85 PathProgramCache]: Analyzing trace with hash 718876484, now seen corresponding path program 3 times [2022-12-13 10:30:33,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:33,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963809561] [2022-12-13 10:30:33,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:33,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 10:30:33,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:33,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963809561] [2022-12-13 10:30:33,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963809561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:33,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:33,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:33,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755458078] [2022-12-13 10:30:33,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:33,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:33,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:33,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:33,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:33,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:30:33,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 97 transitions, 1098 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 10:30:33,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:33,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:30:33,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:34,408 INFO L130 PetriNetUnfolder]: 1199/2516 cut-off events. [2022-12-13 10:30:34,408 INFO L131 PetriNetUnfolder]: For 28211/28211 co-relation queries the response was YES. [2022-12-13 10:30:34,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14033 conditions, 2516 events. 1199/2516 cut-off events. For 28211/28211 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17426 event pairs, 552 based on Foata normal form. 2/2518 useless extension candidates. Maximal degree in co-relation 13956. Up to 1056 conditions per place. [2022-12-13 10:30:34,419 INFO L137 encePairwiseOnDemand]: 36/50 looper letters, 172 selfloop transitions, 20 changer transitions 29/221 dead transitions. [2022-12-13 10:30:34,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 221 transitions, 2582 flow [2022-12-13 10:30:34,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:30:34,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:30:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2022-12-13 10:30:34,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.366 [2022-12-13 10:30:34,420 INFO L175 Difference]: Start difference. First operand has 112 places, 97 transitions, 1098 flow. Second operand 10 states and 183 transitions. [2022-12-13 10:30:34,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 221 transitions, 2582 flow [2022-12-13 10:30:34,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 221 transitions, 2497 flow, removed 34 selfloop flow, removed 5 redundant places. [2022-12-13 10:30:34,459 INFO L231 Difference]: Finished difference. Result has 119 places, 96 transitions, 1058 flow [2022-12-13 10:30:34,459 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1058, PETRI_PLACES=119, PETRI_TRANSITIONS=96} [2022-12-13 10:30:34,459 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 10:30:34,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:34,460 INFO L89 Accepts]: Start accepts. Operand has 119 places, 96 transitions, 1058 flow [2022-12-13 10:30:34,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:34,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:34,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 96 transitions, 1058 flow [2022-12-13 10:30:34,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 96 transitions, 1058 flow [2022-12-13 10:30:34,503 INFO L130 PetriNetUnfolder]: 99/655 cut-off events. [2022-12-13 10:30:34,503 INFO L131 PetriNetUnfolder]: For 5152/5232 co-relation queries the response was YES. [2022-12-13 10:30:34,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 655 events. 99/655 cut-off events. For 5152/5232 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5973 event pairs, 23 based on Foata normal form. 17/628 useless extension candidates. Maximal degree in co-relation 2804. Up to 107 conditions per place. [2022-12-13 10:30:34,508 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 96 transitions, 1058 flow [2022-12-13 10:30:34,508 INFO L226 LiptonReduction]: Number of co-enabled transitions 586 [2022-12-13 10:30:34,511 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:34,512 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 10:30:34,512 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 96 transitions, 1058 flow [2022-12-13 10:30:34,512 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 10:30:34,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:34,512 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 10:30:34,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 10:30:34,512 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 10:30:34,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash 427769422, now seen corresponding path program 4 times [2022-12-13 10:30:34,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:34,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221905756] [2022-12-13 10:30:34,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:34,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:34,935 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 10:30:34,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:34,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221905756] [2022-12-13 10:30:34,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221905756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:34,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:34,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:34,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717858483] [2022-12-13 10:30:34,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:34,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:34,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:34,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:34,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:34,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:30:34,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 96 transitions, 1058 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 10:30:34,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:34,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:30:34,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:35,461 INFO L130 PetriNetUnfolder]: 1153/2422 cut-off events. [2022-12-13 10:30:35,462 INFO L131 PetriNetUnfolder]: For 26643/26643 co-relation queries the response was YES. [2022-12-13 10:30:35,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13507 conditions, 2422 events. 1153/2422 cut-off events. For 26643/26643 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16620 event pairs, 581 based on Foata normal form. 2/2424 useless extension candidates. Maximal degree in co-relation 13435. Up to 1056 conditions per place. [2022-12-13 10:30:35,475 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 163 selfloop transitions, 17 changer transitions 26/206 dead transitions. [2022-12-13 10:30:35,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 206 transitions, 2374 flow [2022-12-13 10:30:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions. [2022-12-13 10:30:35,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 10:30:35,476 INFO L175 Difference]: Start difference. First operand has 116 places, 96 transitions, 1058 flow. Second operand 9 states and 165 transitions. [2022-12-13 10:30:35,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 206 transitions, 2374 flow [2022-12-13 10:30:35,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 206 transitions, 2314 flow, removed 10 selfloop flow, removed 9 redundant places. [2022-12-13 10:30:35,513 INFO L231 Difference]: Finished difference. Result has 117 places, 96 transitions, 1047 flow [2022-12-13 10:30:35,513 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1047, PETRI_PLACES=117, PETRI_TRANSITIONS=96} [2022-12-13 10:30:35,514 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2022-12-13 10:30:35,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:35,514 INFO L89 Accepts]: Start accepts. Operand has 117 places, 96 transitions, 1047 flow [2022-12-13 10:30:35,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:35,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:35,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 96 transitions, 1047 flow [2022-12-13 10:30:35,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 96 transitions, 1047 flow [2022-12-13 10:30:35,557 INFO L130 PetriNetUnfolder]: 99/648 cut-off events. [2022-12-13 10:30:35,557 INFO L131 PetriNetUnfolder]: For 4903/4983 co-relation queries the response was YES. [2022-12-13 10:30:35,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 648 events. 99/648 cut-off events. For 4903/4983 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5917 event pairs, 25 based on Foata normal form. 17/621 useless extension candidates. Maximal degree in co-relation 2772. Up to 107 conditions per place. [2022-12-13 10:30:35,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 96 transitions, 1047 flow [2022-12-13 10:30:35,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 576 [2022-12-13 10:30:35,565 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:35,566 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 10:30:35,566 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 96 transitions, 1047 flow [2022-12-13 10:30:35,566 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 10:30:35,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:35,566 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 10:30:35,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 10:30:35,566 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 10:30:35,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1620965577, now seen corresponding path program 1 times [2022-12-13 10:30:35,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:35,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005631029] [2022-12-13 10:30:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:35,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:35,740 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 10:30:35,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:35,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005631029] [2022-12-13 10:30:35,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005631029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:35,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:35,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:35,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031713640] [2022-12-13 10:30:35,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:35,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:35,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:35,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:35,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:35,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:30:35,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 96 transitions, 1047 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 10:30:35,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:35,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:30:35,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:36,291 INFO L130 PetriNetUnfolder]: 1236/2669 cut-off events. [2022-12-13 10:30:36,291 INFO L131 PetriNetUnfolder]: For 27487/27487 co-relation queries the response was YES. [2022-12-13 10:30:36,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14523 conditions, 2669 events. 1236/2669 cut-off events. For 27487/27487 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 19169 event pairs, 342 based on Foata normal form. 6/2675 useless extension candidates. Maximal degree in co-relation 14452. Up to 1312 conditions per place. [2022-12-13 10:30:36,303 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 114 selfloop transitions, 20 changer transitions 27/161 dead transitions. [2022-12-13 10:30:36,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 161 transitions, 1966 flow [2022-12-13 10:30:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:30:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:30:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2022-12-13 10:30:36,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29 [2022-12-13 10:30:36,304 INFO L175 Difference]: Start difference. First operand has 115 places, 96 transitions, 1047 flow. Second operand 8 states and 116 transitions. [2022-12-13 10:30:36,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 161 transitions, 1966 flow [2022-12-13 10:30:36,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 161 transitions, 1935 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 10:30:36,342 INFO L231 Difference]: Finished difference. Result has 119 places, 99 transitions, 1128 flow [2022-12-13 10:30:36,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1128, PETRI_PLACES=119, PETRI_TRANSITIONS=99} [2022-12-13 10:30:36,343 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 10:30:36,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:36,343 INFO L89 Accepts]: Start accepts. Operand has 119 places, 99 transitions, 1128 flow [2022-12-13 10:30:36,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:36,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:36,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 99 transitions, 1128 flow [2022-12-13 10:30:36,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 99 transitions, 1128 flow [2022-12-13 10:30:36,388 INFO L130 PetriNetUnfolder]: 92/681 cut-off events. [2022-12-13 10:30:36,388 INFO L131 PetriNetUnfolder]: For 5910/5988 co-relation queries the response was YES. [2022-12-13 10:30:36,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 681 events. 92/681 cut-off events. For 5910/5988 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6363 event pairs, 17 based on Foata normal form. 15/651 useless extension candidates. Maximal degree in co-relation 3028. Up to 113 conditions per place. [2022-12-13 10:30:36,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 99 transitions, 1128 flow [2022-12-13 10:30:36,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 592 [2022-12-13 10:30:36,398 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 10:30:36,435 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:36,435 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 10:30:36,435 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 98 transitions, 1120 flow [2022-12-13 10:30:36,436 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 10:30:36,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:36,436 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 10:30:36,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 10:30:36,436 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 10:30:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:36,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1898347565, now seen corresponding path program 1 times [2022-12-13 10:30:36,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:36,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524664694] [2022-12-13 10:30:36,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:36,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30: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 10:30:36,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:36,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524664694] [2022-12-13 10:30:36,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524664694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:36,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:36,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:30:36,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568640808] [2022-12-13 10:30:36,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:36,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:36,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:36,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:36,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:36,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:30:36,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 98 transitions, 1120 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 10:30:36,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:36,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:30:36,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:37,418 INFO L130 PetriNetUnfolder]: 1087/2380 cut-off events. [2022-12-13 10:30:37,419 INFO L131 PetriNetUnfolder]: For 27197/27197 co-relation queries the response was YES. [2022-12-13 10:30:37,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13396 conditions, 2380 events. 1087/2380 cut-off events. For 27197/27197 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17088 event pairs, 314 based on Foata normal form. 2/2382 useless extension candidates. Maximal degree in co-relation 13323. Up to 1008 conditions per place. [2022-12-13 10:30:37,432 INFO L137 encePairwiseOnDemand]: 35/51 looper letters, 168 selfloop transitions, 35 changer transitions 12/215 dead transitions. [2022-12-13 10:30:37,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 215 transitions, 2620 flow [2022-12-13 10:30:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2022-12-13 10:30:37,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3790849673202614 [2022-12-13 10:30:37,433 INFO L175 Difference]: Start difference. First operand has 116 places, 98 transitions, 1120 flow. Second operand 9 states and 174 transitions. [2022-12-13 10:30:37,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 215 transitions, 2620 flow [2022-12-13 10:30:37,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 215 transitions, 2551 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-12-13 10:30:37,484 INFO L231 Difference]: Finished difference. Result has 124 places, 103 transitions, 1312 flow [2022-12-13 10:30:37,484 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1312, PETRI_PLACES=124, PETRI_TRANSITIONS=103} [2022-12-13 10:30:37,485 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places. [2022-12-13 10:30:37,485 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:37,485 INFO L89 Accepts]: Start accepts. Operand has 124 places, 103 transitions, 1312 flow [2022-12-13 10:30:37,485 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:37,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:37,486 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 103 transitions, 1312 flow [2022-12-13 10:30:37,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 103 transitions, 1312 flow [2022-12-13 10:30:37,529 INFO L130 PetriNetUnfolder]: 83/645 cut-off events. [2022-12-13 10:30:37,529 INFO L131 PetriNetUnfolder]: For 6014/6089 co-relation queries the response was YES. [2022-12-13 10:30:37,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 645 events. 83/645 cut-off events. For 6014/6089 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5996 event pairs, 5 based on Foata normal form. 12/621 useless extension candidates. Maximal degree in co-relation 2888. Up to 81 conditions per place. [2022-12-13 10:30:37,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 103 transitions, 1312 flow [2022-12-13 10:30:37,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 622 [2022-12-13 10:30:37,538 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:37,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 10:30:37,538 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 103 transitions, 1312 flow [2022-12-13 10:30:37,539 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 10:30:37,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:37,539 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 10:30:37,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 10:30:37,539 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 10:30:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash 106965506, now seen corresponding path program 1 times [2022-12-13 10:30:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:37,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288063252] [2022-12-13 10:30:37,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:38,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 10:30:38,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:38,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288063252] [2022-12-13 10:30:38,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288063252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:38,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:38,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:38,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982079953] [2022-12-13 10:30:38,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:38,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:38,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:38,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:38,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:30:38,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 103 transitions, 1312 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 10:30:38,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:38,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:30:38,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:38,562 INFO L130 PetriNetUnfolder]: 1094/2402 cut-off events. [2022-12-13 10:30:38,562 INFO L131 PetriNetUnfolder]: For 30605/30605 co-relation queries the response was YES. [2022-12-13 10:30:38,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13896 conditions, 2402 events. 1094/2402 cut-off events. For 30605/30605 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 17281 event pairs, 449 based on Foata normal form. 1/2403 useless extension candidates. Maximal degree in co-relation 13821. Up to 1008 conditions per place. [2022-12-13 10:30:38,576 INFO L137 encePairwiseOnDemand]: 41/51 looper letters, 169 selfloop transitions, 13 changer transitions 25/207 dead transitions. [2022-12-13 10:30:38,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 207 transitions, 2609 flow [2022-12-13 10:30:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:30:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:30:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2022-12-13 10:30:38,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3897058823529412 [2022-12-13 10:30:38,579 INFO L175 Difference]: Start difference. First operand has 123 places, 103 transitions, 1312 flow. Second operand 8 states and 159 transitions. [2022-12-13 10:30:38,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 207 transitions, 2609 flow [2022-12-13 10:30:38,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 207 transitions, 2543 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-12-13 10:30:38,638 INFO L231 Difference]: Finished difference. Result has 126 places, 102 transitions, 1249 flow [2022-12-13 10:30:38,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1249, PETRI_PLACES=126, PETRI_TRANSITIONS=102} [2022-12-13 10:30:38,638 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 85 predicate places. [2022-12-13 10:30:38,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:38,638 INFO L89 Accepts]: Start accepts. Operand has 126 places, 102 transitions, 1249 flow [2022-12-13 10:30:38,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:38,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:38,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 102 transitions, 1249 flow [2022-12-13 10:30:38,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 102 transitions, 1249 flow [2022-12-13 10:30:38,683 INFO L130 PetriNetUnfolder]: 81/643 cut-off events. [2022-12-13 10:30:38,683 INFO L131 PetriNetUnfolder]: For 5813/5886 co-relation queries the response was YES. [2022-12-13 10:30:38,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 643 events. 81/643 cut-off events. For 5813/5886 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5986 event pairs, 5 based on Foata normal form. 12/620 useless extension candidates. Maximal degree in co-relation 2836. Up to 79 conditions per place. [2022-12-13 10:30:38,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 102 transitions, 1249 flow [2022-12-13 10:30:38,688 INFO L226 LiptonReduction]: Number of co-enabled transitions 614 [2022-12-13 10:30:38,691 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:38,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 10:30:38,692 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 102 transitions, 1249 flow [2022-12-13 10:30:38,692 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 10:30:38,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:38,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] [2022-12-13 10:30:38,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 10:30:38,692 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 10:30:38,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:38,693 INFO L85 PathProgramCache]: Analyzing trace with hash 117228955, now seen corresponding path program 2 times [2022-12-13 10:30:38,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:38,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673639332] [2022-12-13 10:30:38,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:39,211 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 10:30:39,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:39,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673639332] [2022-12-13 10:30:39,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673639332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:39,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:39,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:39,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535371082] [2022-12-13 10:30:39,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:39,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:39,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:39,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:39,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:39,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:30:39,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 102 transitions, 1249 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 10:30:39,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:39,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:30:39,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:39,790 INFO L130 PetriNetUnfolder]: 1077/2392 cut-off events. [2022-12-13 10:30:39,790 INFO L131 PetriNetUnfolder]: For 27729/27729 co-relation queries the response was YES. [2022-12-13 10:30:39,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13505 conditions, 2392 events. 1077/2392 cut-off events. For 27729/27729 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17298 event pairs, 330 based on Foata normal form. 4/2396 useless extension candidates. Maximal degree in co-relation 13429. Up to 1008 conditions per place. [2022-12-13 10:30:39,803 INFO L137 encePairwiseOnDemand]: 36/50 looper letters, 150 selfloop transitions, 25 changer transitions 40/215 dead transitions. [2022-12-13 10:30:39,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 215 transitions, 2629 flow [2022-12-13 10:30:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2022-12-13 10:30:39,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38666666666666666 [2022-12-13 10:30:39,804 INFO L175 Difference]: Start difference. First operand has 124 places, 102 transitions, 1249 flow. Second operand 9 states and 174 transitions. [2022-12-13 10:30:39,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 215 transitions, 2629 flow [2022-12-13 10:30:39,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 215 transitions, 2592 flow, removed 4 selfloop flow, removed 8 redundant places. [2022-12-13 10:30:39,855 INFO L231 Difference]: Finished difference. Result has 125 places, 89 transitions, 1080 flow [2022-12-13 10:30:39,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1080, PETRI_PLACES=125, PETRI_TRANSITIONS=89} [2022-12-13 10:30:39,855 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 84 predicate places. [2022-12-13 10:30:39,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:39,855 INFO L89 Accepts]: Start accepts. Operand has 125 places, 89 transitions, 1080 flow [2022-12-13 10:30:39,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:39,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:39,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 89 transitions, 1080 flow [2022-12-13 10:30:39,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 89 transitions, 1080 flow [2022-12-13 10:30:39,895 INFO L130 PetriNetUnfolder]: 71/586 cut-off events. [2022-12-13 10:30:39,895 INFO L131 PetriNetUnfolder]: For 5277/5347 co-relation queries the response was YES. [2022-12-13 10:30:39,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 586 events. 71/586 cut-off events. For 5277/5347 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5255 event pairs, 5 based on Foata normal form. 9/562 useless extension candidates. Maximal degree in co-relation 2614. Up to 79 conditions per place. [2022-12-13 10:30:39,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 89 transitions, 1080 flow [2022-12-13 10:30:39,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 510 [2022-12-13 10:30:40,298 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [721] $Ultimate##0-->L97: Formula: (and (= v_~n2~0_321 v_~tmp1~0_183) (= v_~n2~0_320 (+ v_~tmp2~0_162 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_116| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_116|) (= (ite (= (mod v_~e1~0_187 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_116|) (= v_~e2~0_233 0) (= v_~e1~0_187 0) (= v_~n1~0_336 (+ v_~tmp1~0_183 1))) InVars {~n2~0=v_~n2~0_321, ~tmp2~0=v_~tmp2~0_162} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_116|, ~n2~0=v_~n2~0_320, ~n1~0=v_~n1~0_336, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_116|, ~tmp2~0=v_~tmp2~0_162, ~tmp1~0=v_~tmp1~0_183, ~e2~0=v_~e2~0_233, ~e1~0=v_~e1~0_187} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~tmp1~0, ~e2~0, ~e1~0] and [793] L59-->thread1EXIT: Formula: (and (not (= 0 (ite (or (<= v_~n1~0_649 v_~n2~0_728) (= v_~n2~0_728 0)) 1 0))) (= v_~n1~0_648 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_43| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_319| 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_43| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_319| (ite (and (<= 0 v_~i~0_760) (< v_~i~0_760 v_~n~0_306)) 1 0)) (= v_~i1~0_309 v_~i~0_761) (not (= (ite (= (mod v_~e2~0_467 256) 0) 1 0) 0)) (= (select (select |v_#memory_int_508| v_~f~0.base_423) (+ v_~f~0.offset_420 (* v_~i1~0_309 4))) v_~i~0_760) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_319| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_319|)) InVars {~n2~0=v_~n2~0_728, ~i~0=v_~i~0_761, ~f~0.base=v_~f~0.base_423, ~n1~0=v_~n1~0_649, #memory_int=|v_#memory_int_508|, ~n~0=v_~n~0_306, ~f~0.offset=v_~f~0.offset_420, ~e2~0=v_~e2~0_467} OutVars{~n2~0=v_~n2~0_728, ~i~0=v_~i~0_760, ~n1~0=v_~n1~0_648, ~f~0.base=v_~f~0.base_423, ~i1~0=v_~i1~0_309, ~f~0.offset=v_~f~0.offset_420, ~e2~0=v_~e2~0_467, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_319|, #memory_int=|v_#memory_int_508|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_43|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_43|, ~n~0=v_~n~0_306, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_180|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_319|} 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 10:30:40,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] L53-->L97: Formula: (and (= v_~e2~0_219 0) (= (ite (= (mod v_~e1~0_162 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|) (= v_~e1~0_162 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|) (= (+ v_~tmp1~0_165 1) v_~n1~0_313) (= v_~n2~0_296 (+ v_~tmp2~0_149 1))) InVars {~tmp2~0=v_~tmp2~0_149, ~tmp1~0=v_~tmp1~0_165} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|, ~n2~0=v_~n2~0_296, ~n1~0=v_~n1~0_313, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|, ~tmp2~0=v_~tmp2~0_149, ~e2~0=v_~e2~0_219, ~tmp1~0=v_~tmp1~0_165, ~e1~0=v_~e1~0_162} 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 [794] L59-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_45| 0) (= v_~n1~0_652 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_323| (ite (and (< v_~i~0_764 v_~n~0_308) (<= 0 v_~i~0_764)) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.base_45| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_323| 0)) (not (= (ite (= (mod v_~e2~0_469 256) 0) 1 0) 0)) (not (= (ite (or (<= v_~n1~0_653 v_~n2~0_730) (= v_~n2~0_730 0)) 1 0) 0)) (= v_~i1~0_311 v_~i~0_765) (= (select (select |v_#memory_int_510| v_~f~0.base_425) (+ v_~f~0.offset_422 (* v_~i1~0_311 4))) v_~i~0_764) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_323| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_323|)) InVars {~n2~0=v_~n2~0_730, ~i~0=v_~i~0_765, ~f~0.base=v_~f~0.base_425, ~n1~0=v_~n1~0_653, #memory_int=|v_#memory_int_510|, ~n~0=v_~n~0_308, ~f~0.offset=v_~f~0.offset_422, ~e2~0=v_~e2~0_469} OutVars{~n2~0=v_~n2~0_730, ~i~0=v_~i~0_764, ~n1~0=v_~n1~0_652, ~f~0.base=v_~f~0.base_425, ~i1~0=v_~i1~0_311, ~f~0.offset=v_~f~0.offset_422, ~e2~0=v_~e2~0_469, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_323|, #memory_int=|v_#memory_int_510|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_45|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_45|, ~n~0=v_~n~0_308, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_182|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_323|} 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 10:30:40,718 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 10:30:40,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 864 [2022-12-13 10:30:40,719 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 87 transitions, 1167 flow [2022-12-13 10:30:40,719 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 10:30:40,719 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:40,720 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 10:30:40,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 10:30:40,720 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 10:30:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -152663824, now seen corresponding path program 5 times [2022-12-13 10:30:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:40,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502250585] [2022-12-13 10:30:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:41,210 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 10:30:41,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:41,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502250585] [2022-12-13 10:30:41,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502250585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:41,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:41,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 10:30:41,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365747910] [2022-12-13 10:30:41,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:41,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 10:30:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:41,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 10:30:41,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:30:41,212 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-13 10:30:41,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 87 transitions, 1167 flow. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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 10:30:41,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:41,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-13 10:30:41,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:42,080 INFO L130 PetriNetUnfolder]: 970/2180 cut-off events. [2022-12-13 10:30:42,080 INFO L131 PetriNetUnfolder]: For 27579/27579 co-relation queries the response was YES. [2022-12-13 10:30:42,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12567 conditions, 2180 events. 970/2180 cut-off events. For 27579/27579 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15653 event pairs, 334 based on Foata normal form. 3/2183 useless extension candidates. Maximal degree in co-relation 12492. Up to 974 conditions per place. [2022-12-13 10:30:42,091 INFO L137 encePairwiseOnDemand]: 37/58 looper letters, 135 selfloop transitions, 35 changer transitions 46/216 dead transitions. [2022-12-13 10:30:42,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 216 transitions, 2695 flow [2022-12-13 10:30:42,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 10:30:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 10:30:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 195 transitions. [2022-12-13 10:30:42,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25862068965517243 [2022-12-13 10:30:42,092 INFO L175 Difference]: Start difference. First operand has 121 places, 87 transitions, 1167 flow. Second operand 13 states and 195 transitions. [2022-12-13 10:30:42,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 216 transitions, 2695 flow [2022-12-13 10:30:42,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 216 transitions, 2519 flow, removed 33 selfloop flow, removed 16 redundant places. [2022-12-13 10:30:42,147 INFO L231 Difference]: Finished difference. Result has 119 places, 93 transitions, 1105 flow [2022-12-13 10:30:42,147 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1105, PETRI_PLACES=119, PETRI_TRANSITIONS=93} [2022-12-13 10:30:42,147 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 10:30:42,147 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:42,148 INFO L89 Accepts]: Start accepts. Operand has 119 places, 93 transitions, 1105 flow [2022-12-13 10:30:42,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:42,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:42,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 93 transitions, 1105 flow [2022-12-13 10:30:42,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 93 transitions, 1105 flow [2022-12-13 10:30:42,181 INFO L130 PetriNetUnfolder]: 71/492 cut-off events. [2022-12-13 10:30:42,182 INFO L131 PetriNetUnfolder]: For 4240/4319 co-relation queries the response was YES. [2022-12-13 10:30:42,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 492 events. 71/492 cut-off events. For 4240/4319 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4036 event pairs, 3 based on Foata normal form. 12/486 useless extension candidates. Maximal degree in co-relation 2161. Up to 71 conditions per place. [2022-12-13 10:30:42,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 93 transitions, 1105 flow [2022-12-13 10:30:42,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-13 10:30:42,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [796] $Ultimate##0-->thread1EXIT: Formula: (and (= v_~e1~0_399 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_331| (ite (and (<= 0 v_~i~0_772) (< v_~i~0_772 v_~n~0_312)) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_358| (ite (= (mod v_~e1~0_399 256) 0) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_49| 0) (= v_~n2~0_735 v_~tmp1~0_312) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_331| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_331|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_331| 0)) (= (+ v_~tmp2~0_313 1) v_~n2~0_734) (= v_~n1~0_660 0) (= v_~e2~0_473 0) (= (select (select |v_#memory_int_514| v_~f~0.base_429) (+ v_~f~0.offset_426 (* v_~i1~0_315 4))) v_~i~0_772) (= v_~i1~0_315 v_~i~0_773) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_358| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_358|) (= |v_thread1Thread1of1ForFork1_#res#1.base_49| 0) (not (= (ite (or (= v_~n2~0_734 0) (<= (+ v_~tmp1~0_312 1) v_~n2~0_734)) 1 0) 0))) InVars {~n2~0=v_~n2~0_735, ~i~0=v_~i~0_773, ~f~0.base=v_~f~0.base_429, #memory_int=|v_#memory_int_514|, ~n~0=v_~n~0_312, ~tmp2~0=v_~tmp2~0_313, ~f~0.offset=v_~f~0.offset_426} OutVars{~n2~0=v_~n2~0_734, ~i~0=v_~i~0_772, ~n1~0=v_~n1~0_660, ~f~0.base=v_~f~0.base_429, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_358|, ~i1~0=v_~i1~0_315, ~f~0.offset=v_~f~0.offset_426, ~e2~0=v_~e2~0_473, ~e1~0=v_~e1~0_399, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_358|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_331|, #memory_int=|v_#memory_int_514|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_49|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_49|, ~n~0=v_~n~0_312, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_186|, ~tmp2~0=v_~tmp2~0_313, ~tmp1~0=v_~tmp1~0_312, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_331|} AuxVars[] AssignedVars[~n2~0, ~i~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i1~0, ~e2~0, ~e1~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, ~tmp1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [789] L97-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_347| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_347|) (= v_~i2~0_209 v_~i~0_738) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_347| (ite (or (= v_~n1~0_636 0) (< v_~n2~0_714 v_~n1~0_636)) 1 0)) (= v_~i~0_737 (select (select |v_#memory_int_497| v_~f~0.base_411) (+ v_~f~0.offset_408 (* v_~i2~0_209 4)))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_347| 0))) InVars {~n2~0=v_~n2~0_714, ~i~0=v_~i~0_738, ~f~0.base=v_~f~0.base_411, ~n1~0=v_~n1~0_636, #memory_int=|v_#memory_int_497|, ~f~0.offset=v_~f~0.offset_408} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_117|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_347|, ~n2~0=v_~n2~0_714, ~i~0=v_~i~0_737, ~f~0.base=v_~f~0.base_411, ~n1~0=v_~n1~0_636, #memory_int=|v_#memory_int_497|, ~i2~0=v_~i2~0_209, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_347|, ~f~0.offset=v_~f~0.offset_408} 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] [2022-12-13 10:30:42,396 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [797] L53-->thread1EXIT: Formula: (and (= v_~n1~0_664 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_51| 0) (= (ite (= (mod v_~e1~0_401 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_360|) (not (= (ite (or (= v_~n2~0_738 0) (<= (+ v_~tmp1~0_314 1) v_~n2~0_738)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_360| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_360|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_333| 0)) (= v_~e2~0_475 0) (= v_~n2~0_738 (+ v_~tmp2~0_315 1)) (= (select (select |v_#memory_int_516| v_~f~0.base_431) (+ v_~f~0.offset_428 (* v_~i1~0_317 4))) v_~i~0_776) (= |v_thread1Thread1of1ForFork1_#res#1.base_51| 0) (= v_~e1~0_401 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_333| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_333|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_333| (ite (and (< v_~i~0_776 v_~n~0_314) (<= 0 v_~i~0_776)) 1 0)) (= v_~i1~0_317 v_~i~0_777)) InVars {~i~0=v_~i~0_777, ~f~0.base=v_~f~0.base_431, #memory_int=|v_#memory_int_516|, ~n~0=v_~n~0_314, ~tmp2~0=v_~tmp2~0_315, ~f~0.offset=v_~f~0.offset_428, ~tmp1~0=v_~tmp1~0_314} OutVars{~n2~0=v_~n2~0_738, ~i~0=v_~i~0_776, ~n1~0=v_~n1~0_664, ~f~0.base=v_~f~0.base_431, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_360|, ~i1~0=v_~i1~0_317, ~f~0.offset=v_~f~0.offset_428, ~e2~0=v_~e2~0_475, ~e1~0=v_~e1~0_401, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_360|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_333|, #memory_int=|v_#memory_int_516|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_51|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_51|, ~n~0=v_~n~0_314, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_188|, ~tmp2~0=v_~tmp2~0_315, ~tmp1~0=v_~tmp1~0_314, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_333|} AuxVars[] AssignedVars[~n2~0, ~i~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i1~0, ~e2~0, ~e1~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [789] L97-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_347| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_347|) (= v_~i2~0_209 v_~i~0_738) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_347| (ite (or (= v_~n1~0_636 0) (< v_~n2~0_714 v_~n1~0_636)) 1 0)) (= v_~i~0_737 (select (select |v_#memory_int_497| v_~f~0.base_411) (+ v_~f~0.offset_408 (* v_~i2~0_209 4)))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_347| 0))) InVars {~n2~0=v_~n2~0_714, ~i~0=v_~i~0_738, ~f~0.base=v_~f~0.base_411, ~n1~0=v_~n1~0_636, #memory_int=|v_#memory_int_497|, ~f~0.offset=v_~f~0.offset_408} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_117|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_347|, ~n2~0=v_~n2~0_714, ~i~0=v_~i~0_737, ~f~0.base=v_~f~0.base_411, ~n1~0=v_~n1~0_636, #memory_int=|v_#memory_int_497|, ~i2~0=v_~i2~0_209, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_347|, ~f~0.offset=v_~f~0.offset_408} 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] [2022-12-13 10:30:42,591 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [723] $Ultimate##0-->L88: Formula: (and (= v_~tmp2~0_164 v_~n1~0_340) (= v_~e1~0_195 1) (= v_~n2~0_326 v_~tmp1~0_187) (= v_~e2~0_235 1)) InVars {~n2~0=v_~n2~0_326, ~n1~0=v_~n1~0_340} OutVars{~n2~0=v_~n2~0_326, ~n1~0=v_~n1~0_340, ~tmp2~0=v_~tmp2~0_164, ~e2~0=v_~e2~0_235, ~tmp1~0=v_~tmp1~0_187, ~e1~0=v_~e1~0_195} AuxVars[] AssignedVars[~tmp2~0, ~e2~0, ~tmp1~0, ~e1~0] and [716] L53-->L97: Formula: (and (= v_~e2~0_219 0) (= (ite (= (mod v_~e1~0_162 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|) (= v_~e1~0_162 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|) (= (+ v_~tmp1~0_165 1) v_~n1~0_313) (= v_~n2~0_296 (+ v_~tmp2~0_149 1))) InVars {~tmp2~0=v_~tmp2~0_149, ~tmp1~0=v_~tmp1~0_165} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|, ~n2~0=v_~n2~0_296, ~n1~0=v_~n1~0_313, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|, ~tmp2~0=v_~tmp2~0_149, ~e2~0=v_~e2~0_219, ~tmp1~0=v_~tmp1~0_165, ~e1~0=v_~e1~0_162} 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 10:30:42,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [723] $Ultimate##0-->L88: Formula: (and (= v_~tmp2~0_164 v_~n1~0_340) (= v_~e1~0_195 1) (= v_~n2~0_326 v_~tmp1~0_187) (= v_~e2~0_235 1)) InVars {~n2~0=v_~n2~0_326, ~n1~0=v_~n1~0_340} OutVars{~n2~0=v_~n2~0_326, ~n1~0=v_~n1~0_340, ~tmp2~0=v_~tmp2~0_164, ~e2~0=v_~e2~0_235, ~tmp1~0=v_~tmp1~0_187, ~e1~0=v_~e1~0_195} AuxVars[] AssignedVars[~tmp2~0, ~e2~0, ~tmp1~0, ~e1~0] and [800] L53-->L106: Formula: (let ((.cse2 (select |v_#memory_int_522| v_~f~0.base_437))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_434 (* v_~i1~0_323 4)))) (.cse0 (= v_~n1~0_674 0))) (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_339| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_339|) (= v_~e2~0_481 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_57| 0) .cse0 (not (= (ite (or (= v_~n2~0_746 0) (<= (+ v_~tmp1~0_320 1) v_~n2~0_746)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_366| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_366|) (= v_~e1~0_407 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_339| (ite (and (< .cse1 v_~n~0_320) (<= 0 .cse1)) 1 0)) (= (select .cse2 (+ v_~f~0.offset_434 (* v_~i2~0_219 4))) v_~i~0_790) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_339| 0)) (= .cse1 v_~i2~0_219) (= |v_thread1Thread1of1ForFork1_#res#1.offset_57| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_366| (ite (or .cse0 (< v_~n2~0_746 v_~n1~0_674)) 1 0)) (= v_~i1~0_323 v_~i~0_792) (= v_~n2~0_746 (+ v_~tmp2~0_319 1))))) InVars {~i~0=v_~i~0_792, ~f~0.base=v_~f~0.base_437, #memory_int=|v_#memory_int_522|, ~n~0=v_~n~0_320, ~tmp2~0=v_~tmp2~0_319, ~f~0.offset=v_~f~0.offset_434, ~tmp1~0=v_~tmp1~0_320} OutVars{~n2~0=v_~n2~0_746, ~i~0=v_~i~0_790, ~f~0.base=v_~f~0.base_437, ~n1~0=v_~n1~0_674, ~i2~0=v_~i2~0_219, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_366|, ~i1~0=v_~i1~0_323, ~f~0.offset=v_~f~0.offset_434, ~e2~0=v_~e2~0_481, ~e1~0=v_~e1~0_407, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_127|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_366|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_339|, #memory_int=|v_#memory_int_522|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_57|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_57|, ~n~0=v_~n~0_320, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_194|, ~tmp2~0=v_~tmp2~0_319, ~tmp1~0=v_~tmp1~0_320, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_339|} AuxVars[] AssignedVars[~n2~0, ~i~0, ~n1~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i1~0, ~e2~0, ~e1~0, thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 10:30:42,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [723] $Ultimate##0-->L88: Formula: (and (= v_~tmp2~0_164 v_~n1~0_340) (= v_~e1~0_195 1) (= v_~n2~0_326 v_~tmp1~0_187) (= v_~e2~0_235 1)) InVars {~n2~0=v_~n2~0_326, ~n1~0=v_~n1~0_340} OutVars{~n2~0=v_~n2~0_326, ~n1~0=v_~n1~0_340, ~tmp2~0=v_~tmp2~0_164, ~e2~0=v_~e2~0_235, ~tmp1~0=v_~tmp1~0_187, ~e1~0=v_~e1~0_195} AuxVars[] AssignedVars[~tmp2~0, ~e2~0, ~tmp1~0, ~e1~0] and [716] L53-->L97: Formula: (and (= v_~e2~0_219 0) (= (ite (= (mod v_~e1~0_162 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|) (= v_~e1~0_162 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|) (= (+ v_~tmp1~0_165 1) v_~n1~0_313) (= v_~n2~0_296 (+ v_~tmp2~0_149 1))) InVars {~tmp2~0=v_~tmp2~0_149, ~tmp1~0=v_~tmp1~0_165} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|, ~n2~0=v_~n2~0_296, ~n1~0=v_~n1~0_313, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|, ~tmp2~0=v_~tmp2~0_149, ~e2~0=v_~e2~0_219, ~tmp1~0=v_~tmp1~0_165, ~e1~0=v_~e1~0_162} 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 10:30:43,000 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:30:43,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 854 [2022-12-13 10:30:43,001 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 1181 flow [2022-12-13 10:30:43,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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 10:30:43,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:43,001 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 10:30:43,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 10:30:43,002 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 10:30:43,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash 386105949, now seen corresponding path program 1 times [2022-12-13 10:30:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:43,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743343225] [2022-12-13 10:30:43,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:43,365 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 10:30:43,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:43,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743343225] [2022-12-13 10:30:43,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743343225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:43,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:43,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:30:43,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528019331] [2022-12-13 10:30:43,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:43,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:30:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:43,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:30:43,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:30:43,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:30:43,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 1181 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 10:30:43,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:43,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:30:43,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:43,724 INFO L130 PetriNetUnfolder]: 791/1743 cut-off events. [2022-12-13 10:30:43,724 INFO L131 PetriNetUnfolder]: For 21924/21924 co-relation queries the response was YES. [2022-12-13 10:30:43,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9900 conditions, 1743 events. 791/1743 cut-off events. For 21924/21924 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11689 event pairs, 277 based on Foata normal form. 2/1745 useless extension candidates. Maximal degree in co-relation 9827. Up to 1008 conditions per place. [2022-12-13 10:30:43,733 INFO L137 encePairwiseOnDemand]: 46/57 looper letters, 140 selfloop transitions, 12 changer transitions 19/171 dead transitions. [2022-12-13 10:30:43,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 171 transitions, 2169 flow [2022-12-13 10:30:43,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:30:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:30:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2022-12-13 10:30:43,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37092731829573933 [2022-12-13 10:30:43,734 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 1181 flow. Second operand 7 states and 148 transitions. [2022-12-13 10:30:43,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 171 transitions, 2169 flow [2022-12-13 10:30:43,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 171 transitions, 1938 flow, removed 98 selfloop flow, removed 12 redundant places. [2022-12-13 10:30:43,767 INFO L231 Difference]: Finished difference. Result has 106 places, 89 transitions, 916 flow [2022-12-13 10:30:43,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=916, PETRI_PLACES=106, PETRI_TRANSITIONS=89} [2022-12-13 10:30:43,767 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 10:30:43,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:43,767 INFO L89 Accepts]: Start accepts. Operand has 106 places, 89 transitions, 916 flow [2022-12-13 10:30:43,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:43,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:43,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 89 transitions, 916 flow [2022-12-13 10:30:43,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 89 transitions, 916 flow [2022-12-13 10:30:43,797 INFO L130 PetriNetUnfolder]: 69/462 cut-off events. [2022-12-13 10:30:43,797 INFO L131 PetriNetUnfolder]: For 2651/2720 co-relation queries the response was YES. [2022-12-13 10:30:43,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 462 events. 69/462 cut-off events. For 2651/2720 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3714 event pairs, 3 based on Foata normal form. 11/455 useless extension candidates. Maximal degree in co-relation 1825. Up to 65 conditions per place. [2022-12-13 10:30:43,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 89 transitions, 916 flow [2022-12-13 10:30:43,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-13 10:30:43,803 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [791] L97-->L106: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_351| 0)) (= v_~i~0_745 (select (select |v_#memory_int_501| v_~f~0.base_415) (+ v_~f~0.offset_412 (* v_~i2~0_213 4)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_351| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_351|) (= v_~i2~0_213 v_~i~0_746) (= (ite (or (< v_~n2~0_718 v_~n1~0_640) (= v_~n1~0_640 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_351|)) InVars {~n2~0=v_~n2~0_718, ~i~0=v_~i~0_746, ~f~0.base=v_~f~0.base_415, ~n1~0=v_~n1~0_640, #memory_int=|v_#memory_int_501|, ~f~0.offset=v_~f~0.offset_412} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_121|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_351|, ~n2~0=v_~n2~0_718, ~i~0=v_~i~0_745, ~f~0.base=v_~f~0.base_415, ~n1~0=v_~n1~0_640, #memory_int=|v_#memory_int_501|, ~i2~0=v_~i2~0_213, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_351|, ~f~0.offset=v_~f~0.offset_412} 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 10:30:43,845 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [790] L88-->L106: Formula: (and (= v_~i2~0_211 v_~i~0_742) (= (ite (or (< v_~n2~0_716 v_~n1~0_638) (= v_~n1~0_638 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_349|) (not (= 0 (ite (= (mod v_~e1~0_392 256) 0) 1 0))) (= v_~n2~0_716 (+ v_~tmp2~0_306 1)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_349| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_349| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_349|) (= v_~e2~0_458 0) (= (select (select |v_#memory_int_499| v_~f~0.base_413) (+ v_~f~0.offset_410 (* v_~i2~0_211 4))) v_~i~0_741)) InVars {~i~0=v_~i~0_742, ~f~0.base=v_~f~0.base_413, ~n1~0=v_~n1~0_638, #memory_int=|v_#memory_int_499|, ~tmp2~0=v_~tmp2~0_306, ~f~0.offset=v_~f~0.offset_410, ~e1~0=v_~e1~0_392} OutVars{~n2~0=v_~n2~0_716, ~i~0=v_~i~0_741, ~f~0.base=v_~f~0.base_413, ~n1~0=v_~n1~0_638, ~i2~0=v_~i2~0_211, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_349|, ~f~0.offset=v_~f~0.offset_410, ~e2~0=v_~e2~0_458, ~e1~0=v_~e1~0_392, 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_349|, #memory_int=|v_#memory_int_499|, ~tmp2~0=v_~tmp2~0_306} 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 10:30:43,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] L88-->L106: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_353| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_353|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_353| 0)) (= v_~i2~0_215 v_~i~0_750) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_353| (ite (or (= v_~n1~0_642 0) (< v_~n2~0_720 v_~n1~0_642)) 1 0)) (= (select (select |v_#memory_int_503| v_~f~0.base_417) (+ v_~f~0.offset_414 (* v_~i2~0_215 4))) v_~i~0_749) (= (+ v_~tmp2~0_308 1) v_~n2~0_720) (not (= (ite (= (mod v_~e1~0_394 256) 0) 1 0) 0)) (= v_~e2~0_460 0)) InVars {~i~0=v_~i~0_750, ~f~0.base=v_~f~0.base_417, ~n1~0=v_~n1~0_642, #memory_int=|v_#memory_int_503|, ~tmp2~0=v_~tmp2~0_308, ~f~0.offset=v_~f~0.offset_414, ~e1~0=v_~e1~0_394} OutVars{~n2~0=v_~n2~0_720, ~i~0=v_~i~0_749, ~f~0.base=v_~f~0.base_417, ~n1~0=v_~n1~0_642, ~i2~0=v_~i2~0_215, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_353|, ~f~0.offset=v_~f~0.offset_414, ~e2~0=v_~e2~0_460, ~e1~0=v_~e1~0_394, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_123|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_353|, #memory_int=|v_#memory_int_503|, ~tmp2~0=v_~tmp2~0_308} 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 10:30:43,981 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] L53-->L97: Formula: (and (= v_~e2~0_219 0) (= (ite (= (mod v_~e1~0_162 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|) (= v_~e1~0_162 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|) (= (+ v_~tmp1~0_165 1) v_~n1~0_313) (= v_~n2~0_296 (+ v_~tmp2~0_149 1))) InVars {~tmp2~0=v_~tmp2~0_149, ~tmp1~0=v_~tmp1~0_165} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|, ~n2~0=v_~n2~0_296, ~n1~0=v_~n1~0_313, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|, ~tmp2~0=v_~tmp2~0_149, ~e2~0=v_~e2~0_219, ~tmp1~0=v_~tmp1~0_165, ~e1~0=v_~e1~0_162} 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 [747] L71-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_35| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_35| 0) (= v_~n1~0_460 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_217| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_217|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_217| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_217| (ite (and (< v_~i~0_461 v_~n~0_220) (<= 0 v_~i~0_461)) 1 0))) InVars {~i~0=v_~i~0_461, ~n~0=v_~n~0_220} OutVars{~i~0=v_~i~0_461, ~n1~0=v_~n1~0_460, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_217|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_35|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_35|, ~n~0=v_~n~0_220, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_217|} 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 10:30:44,041 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] L53-->L97: Formula: (and (= v_~e2~0_219 0) (= (ite (= (mod v_~e1~0_162 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|) (= v_~e1~0_162 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|) (= (+ v_~tmp1~0_165 1) v_~n1~0_313) (= v_~n2~0_296 (+ v_~tmp2~0_149 1))) InVars {~tmp2~0=v_~tmp2~0_149, ~tmp1~0=v_~tmp1~0_165} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_99|, ~n2~0=v_~n2~0_296, ~n1~0=v_~n1~0_313, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_99|, ~tmp2~0=v_~tmp2~0_149, ~e2~0=v_~e2~0_219, ~tmp1~0=v_~tmp1~0_165, ~e1~0=v_~e1~0_162} 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 [747] L71-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.base_35| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_35| 0) (= v_~n1~0_460 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_217| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_217|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_217| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_217| (ite (and (< v_~i~0_461 v_~n~0_220) (<= 0 v_~i~0_461)) 1 0))) InVars {~i~0=v_~i~0_461, ~n~0=v_~n~0_220} OutVars{~i~0=v_~i~0_461, ~n1~0=v_~n1~0_460, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_217|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_35|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_35|, ~n~0=v_~n~0_220, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_217|} 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 10:30:44,108 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 [748] L71-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_219| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| (ite (and (< v_~i~0_463 v_~n~0_222) (<= 0 v_~i~0_463)) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_37| 0) (= v_~n1~0_462 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_219|) (= |v_thread1Thread1of1ForFork1_#res#1.base_37| 0)) InVars {~i~0=v_~i~0_463, ~n~0=v_~n~0_222} OutVars{~i~0=v_~i~0_463, ~n1~0=v_~n1~0_462, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_37|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_37|, ~n~0=v_~n~0_222, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_219|} 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 10:30:44,142 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 [748] L71-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_219| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| (ite (and (< v_~i~0_463 v_~n~0_222) (<= 0 v_~i~0_463)) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_37| 0) (= v_~n1~0_462 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_219|) (= |v_thread1Thread1of1ForFork1_#res#1.base_37| 0)) InVars {~i~0=v_~i~0_463, ~n~0=v_~n~0_222} OutVars{~i~0=v_~i~0_463, ~n1~0=v_~n1~0_462, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_37|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_37|, ~n~0=v_~n~0_222, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_219|} 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 10:30:44,179 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:30:44,180 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 413 [2022-12-13 10:30:44,180 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 88 transitions, 960 flow [2022-12-13 10:30:44,180 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 10:30:44,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:44,180 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 10:30:44,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 10:30:44,180 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 10:30:44,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1095523992, now seen corresponding path program 1 times [2022-12-13 10:30:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:44,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042489784] [2022-12-13 10:30:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:44,367 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 10:30:44,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:44,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042489784] [2022-12-13 10:30:44,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042489784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:44,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:44,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:30:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140582283] [2022-12-13 10:30:44,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:44,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:30:44,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:44,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:30:44,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:30:44,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 57 [2022-12-13 10:30:44,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 88 transitions, 960 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 10:30:44,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:44,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 57 [2022-12-13 10:30:44,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:44,689 INFO L130 PetriNetUnfolder]: 804/1749 cut-off events. [2022-12-13 10:30:44,689 INFO L131 PetriNetUnfolder]: For 14117/14117 co-relation queries the response was YES. [2022-12-13 10:30:44,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9070 conditions, 1749 events. 804/1749 cut-off events. For 14117/14117 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11590 event pairs, 226 based on Foata normal form. 2/1751 useless extension candidates. Maximal degree in co-relation 9003. Up to 1148 conditions per place. [2022-12-13 10:30:44,698 INFO L137 encePairwiseOnDemand]: 45/57 looper letters, 94 selfloop transitions, 12 changer transitions 26/132 dead transitions. [2022-12-13 10:30:44,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 132 transitions, 1504 flow [2022-12-13 10:30:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:30:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:30:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-12-13 10:30:44,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2656641604010025 [2022-12-13 10:30:44,699 INFO L175 Difference]: Start difference. First operand has 101 places, 88 transitions, 960 flow. Second operand 7 states and 106 transitions. [2022-12-13 10:30:44,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 132 transitions, 1504 flow [2022-12-13 10:30:44,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 132 transitions, 1426 flow, removed 20 selfloop flow, removed 12 redundant places. [2022-12-13 10:30:44,717 INFO L231 Difference]: Finished difference. Result has 98 places, 78 transitions, 758 flow [2022-12-13 10:30:44,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=758, PETRI_PLACES=98, PETRI_TRANSITIONS=78} [2022-12-13 10:30:44,717 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2022-12-13 10:30:44,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:44,717 INFO L89 Accepts]: Start accepts. Operand has 98 places, 78 transitions, 758 flow [2022-12-13 10:30:44,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:44,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:44,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 78 transitions, 758 flow [2022-12-13 10:30:44,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 78 transitions, 758 flow [2022-12-13 10:30:44,746 INFO L130 PetriNetUnfolder]: 57/444 cut-off events. [2022-12-13 10:30:44,747 INFO L131 PetriNetUnfolder]: For 1974/2019 co-relation queries the response was YES. [2022-12-13 10:30:44,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1710 conditions, 444 events. 57/444 cut-off events. For 1974/2019 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3651 event pairs, 5 based on Foata normal form. 9/436 useless extension candidates. Maximal degree in co-relation 1659. Up to 60 conditions per place. [2022-12-13 10:30:44,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 78 transitions, 758 flow [2022-12-13 10:30:44,750 INFO L226 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-13 10:30:44,794 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [813] $Ultimate##0-->L94: Formula: (and (= v_~e2~0_517 0) (= v_~tmp2~0_345 v_~n1~0_722) (= v_~n2~0_793 v_~tmp1~0_344) (= v_~n2~0_792 (+ v_~tmp2~0_345 1)) (= v_~e1~0_443 1)) InVars {~n2~0=v_~n2~0_793, ~n1~0=v_~n1~0_722} OutVars{~n2~0=v_~n2~0_792, ~n1~0=v_~n1~0_722, ~tmp2~0=v_~tmp2~0_345, ~e2~0=v_~e2~0_517, ~tmp1~0=v_~tmp1~0_344, ~e1~0=v_~e1~0_443} AuxVars[] AssignedVars[~n2~0, ~tmp2~0, ~e2~0, ~tmp1~0, ~e1~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 10:30:44,822 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 [721] $Ultimate##0-->L97: Formula: (and (= v_~n2~0_321 v_~tmp1~0_183) (= v_~n2~0_320 (+ v_~tmp2~0_162 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_116| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_116|) (= (ite (= (mod v_~e1~0_187 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_116|) (= v_~e2~0_233 0) (= v_~e1~0_187 0) (= v_~n1~0_336 (+ v_~tmp1~0_183 1))) InVars {~n2~0=v_~n2~0_321, ~tmp2~0=v_~tmp2~0_162} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_116|, ~n2~0=v_~n2~0_320, ~n1~0=v_~n1~0_336, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_116|, ~tmp2~0=v_~tmp2~0_162, ~tmp1~0=v_~tmp1~0_183, ~e2~0=v_~e2~0_233, ~e1~0=v_~e1~0_187} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~tmp1~0, ~e2~0, ~e1~0] [2022-12-13 10:30:44,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [812] $Ultimate##0-->L94: Formula: (and (= v_~n2~0_789 v_~tmp1~0_342) (= v_~tmp2~0_343 v_~n1~0_720) (= v_~e2~0_513 0) (= v_~e1~0_441 1) (= (+ v_~tmp2~0_343 1) v_~n2~0_788)) InVars {~n2~0=v_~n2~0_789, ~n1~0=v_~n1~0_720} OutVars{~n2~0=v_~n2~0_788, ~n1~0=v_~n1~0_720, ~tmp2~0=v_~tmp2~0_343, ~e2~0=v_~e2~0_513, ~tmp1~0=v_~tmp1~0_342, ~e1~0=v_~e1~0_441} AuxVars[] AssignedVars[~n2~0, ~tmp2~0, ~e2~0, ~tmp1~0, ~e1~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 10:30:44,918 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:30:44,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 202 [2022-12-13 10:30:44,919 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 744 flow [2022-12-13 10:30:44,919 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 10:30:44,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:44,919 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 10:30:44,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 10:30:44,919 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 10:30:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1527700767, now seen corresponding path program 1 times [2022-12-13 10:30:44,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:44,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259220655] [2022-12-13 10:30:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:45,542 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 10:30:45,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:45,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259220655] [2022-12-13 10:30:45,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259220655] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:30:45,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274393915] [2022-12-13 10:30:45,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:45,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:45,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:30:45,544 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 10:30:45,545 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 10:30:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:45,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:30:45,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:30:45,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:30:45,740 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 10:30:45,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:30:45,772 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 10:30:45,780 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 10:30:45,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:30:45,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274393915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:45,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:30:45,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-12-13 10:30:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245236700] [2022-12-13 10:30:45,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:45,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:45,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:45,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:45,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:30:45,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:30:45,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 744 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 10:30:45,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:45,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:30:45,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:46,112 INFO L130 PetriNetUnfolder]: 792/1736 cut-off events. [2022-12-13 10:30:46,112 INFO L131 PetriNetUnfolder]: For 11398/11398 co-relation queries the response was YES. [2022-12-13 10:30:46,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8576 conditions, 1736 events. 792/1736 cut-off events. For 11398/11398 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11582 event pairs, 173 based on Foata normal form. 4/1740 useless extension candidates. Maximal degree in co-relation 8514. Up to 1034 conditions per place. [2022-12-13 10:30:46,120 INFO L137 encePairwiseOnDemand]: 38/51 looper letters, 94 selfloop transitions, 21 changer transitions 10/125 dead transitions. [2022-12-13 10:30:46,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 125 transitions, 1350 flow [2022-12-13 10:30:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:30:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:30:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-12-13 10:30:46,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30532212885154064 [2022-12-13 10:30:46,121 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 744 flow. Second operand 7 states and 109 transitions. [2022-12-13 10:30:46,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 125 transitions, 1350 flow [2022-12-13 10:30:46,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 125 transitions, 1233 flow, removed 41 selfloop flow, removed 8 redundant places. [2022-12-13 10:30:46,135 INFO L231 Difference]: Finished difference. Result has 93 places, 78 transitions, 760 flow [2022-12-13 10:30:46,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=760, PETRI_PLACES=93, PETRI_TRANSITIONS=78} [2022-12-13 10:30:46,135 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2022-12-13 10:30:46,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:46,135 INFO L89 Accepts]: Start accepts. Operand has 93 places, 78 transitions, 760 flow [2022-12-13 10:30:46,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:46,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:46,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 78 transitions, 760 flow [2022-12-13 10:30:46,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 78 transitions, 760 flow [2022-12-13 10:30:46,166 INFO L130 PetriNetUnfolder]: 54/459 cut-off events. [2022-12-13 10:30:46,166 INFO L131 PetriNetUnfolder]: For 1770/1804 co-relation queries the response was YES. [2022-12-13 10:30:46,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 459 events. 54/459 cut-off events. For 1770/1804 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3847 event pairs, 5 based on Foata normal form. 6/444 useless extension candidates. Maximal degree in co-relation 1516. Up to 64 conditions per place. [2022-12-13 10:30:46,170 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 78 transitions, 760 flow [2022-12-13 10:30:46,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 10:30:46,172 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:46,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 10:30:46,173 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 78 transitions, 760 flow [2022-12-13 10:30:46,173 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 10:30:46,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:46,173 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 10:30:46,180 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 10:30:46,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:30:46,374 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 10:30:46,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1514260902, now seen corresponding path program 1 times [2022-12-13 10:30:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:46,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436024175] [2022-12-13 10:30:46,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:46,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 10:30:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:46,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436024175] [2022-12-13 10:30:46,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436024175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:46,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:46,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:30:46,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599440538] [2022-12-13 10:30:46,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:46,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:30:46,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:46,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:30:46,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:30:46,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:30:46,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 78 transitions, 760 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 10:30:46,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:46,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:30:46,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:47,414 INFO L130 PetriNetUnfolder]: 767/1671 cut-off events. [2022-12-13 10:30:47,414 INFO L131 PetriNetUnfolder]: For 9900/9900 co-relation queries the response was YES. [2022-12-13 10:30:47,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8221 conditions, 1671 events. 767/1671 cut-off events. For 9900/9900 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10891 event pairs, 321 based on Foata normal form. 4/1667 useless extension candidates. Maximal degree in co-relation 7367. Up to 1164 conditions per place. [2022-12-13 10:30:47,422 INFO L137 encePairwiseOnDemand]: 34/50 looper letters, 102 selfloop transitions, 10 changer transitions 42/154 dead transitions. [2022-12-13 10:30:47,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 154 transitions, 1583 flow [2022-12-13 10:30:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:30:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:30:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2022-12-13 10:30:47,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.272 [2022-12-13 10:30:47,423 INFO L175 Difference]: Start difference. First operand has 93 places, 78 transitions, 760 flow. Second operand 10 states and 136 transitions. [2022-12-13 10:30:47,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 154 transitions, 1583 flow [2022-12-13 10:30:47,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 154 transitions, 1504 flow, removed 21 selfloop flow, removed 6 redundant places. [2022-12-13 10:30:47,438 INFO L231 Difference]: Finished difference. Result has 101 places, 77 transitions, 725 flow [2022-12-13 10:30:47,438 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=725, PETRI_PLACES=101, PETRI_TRANSITIONS=77} [2022-12-13 10:30:47,439 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places. [2022-12-13 10:30:47,439 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:47,439 INFO L89 Accepts]: Start accepts. Operand has 101 places, 77 transitions, 725 flow [2022-12-13 10:30:47,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:47,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:47,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 77 transitions, 725 flow [2022-12-13 10:30:47,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 77 transitions, 725 flow [2022-12-13 10:30:47,464 INFO L130 PetriNetUnfolder]: 48/378 cut-off events. [2022-12-13 10:30:47,464 INFO L131 PetriNetUnfolder]: For 1511/1551 co-relation queries the response was YES. [2022-12-13 10:30:47,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 378 events. 48/378 cut-off events. For 1511/1551 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2919 event pairs, 13 based on Foata normal form. 8/370 useless extension candidates. Maximal degree in co-relation 1394. Up to 50 conditions per place. [2022-12-13 10:30:47,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 77 transitions, 725 flow [2022-12-13 10:30:47,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-13 10:30:47,468 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 10:30:47,509 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:47,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 10:30:47,510 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 76 transitions, 719 flow [2022-12-13 10:30:47,510 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 10:30:47,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:47,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] [2022-12-13 10:30:47,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 10:30:47,511 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 10:30:47,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash -708920198, now seen corresponding path program 1 times [2022-12-13 10:30:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:47,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798919028] [2022-12-13 10:30:47,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:47,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:47,642 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 10:30:47,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:47,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798919028] [2022-12-13 10:30:47,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798919028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:47,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:47,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:30:47,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938170017] [2022-12-13 10:30:47,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:47,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:30:47,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:47,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:30:47,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:30:47,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:30:47,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 76 transitions, 719 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 10:30:47,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:47,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:30:47,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:47,998 INFO L130 PetriNetUnfolder]: 797/1709 cut-off events. [2022-12-13 10:30:47,998 INFO L131 PetriNetUnfolder]: For 10164/10164 co-relation queries the response was YES. [2022-12-13 10:30:48,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8362 conditions, 1709 events. 797/1709 cut-off events. For 10164/10164 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11075 event pairs, 205 based on Foata normal form. 4/1709 useless extension candidates. Maximal degree in co-relation 8306. Up to 1000 conditions per place. [2022-12-13 10:30:48,007 INFO L137 encePairwiseOnDemand]: 38/49 looper letters, 118 selfloop transitions, 19 changer transitions 21/158 dead transitions. [2022-12-13 10:30:48,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 158 transitions, 1605 flow [2022-12-13 10:30:48,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2022-12-13 10:30:48,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2947845804988662 [2022-12-13 10:30:48,008 INFO L175 Difference]: Start difference. First operand has 96 places, 76 transitions, 719 flow. Second operand 9 states and 130 transitions. [2022-12-13 10:30:48,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 158 transitions, 1605 flow [2022-12-13 10:30:48,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 158 transitions, 1539 flow, removed 23 selfloop flow, removed 9 redundant places. [2022-12-13 10:30:48,026 INFO L231 Difference]: Finished difference. Result has 98 places, 83 transitions, 804 flow [2022-12-13 10:30:48,026 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=804, PETRI_PLACES=98, PETRI_TRANSITIONS=83} [2022-12-13 10:30:48,027 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 57 predicate places. [2022-12-13 10:30:48,027 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:48,027 INFO L89 Accepts]: Start accepts. Operand has 98 places, 83 transitions, 804 flow [2022-12-13 10:30:48,027 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:48,027 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:48,027 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 83 transitions, 804 flow [2022-12-13 10:30:48,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 83 transitions, 804 flow [2022-12-13 10:30:48,056 INFO L130 PetriNetUnfolder]: 57/465 cut-off events. [2022-12-13 10:30:48,057 INFO L131 PetriNetUnfolder]: For 1625/1637 co-relation queries the response was YES. [2022-12-13 10:30:48,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 465 events. 57/465 cut-off events. For 1625/1637 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3839 event pairs, 7 based on Foata normal form. 7/452 useless extension candidates. Maximal degree in co-relation 1508. Up to 60 conditions per place. [2022-12-13 10:30:48,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 83 transitions, 804 flow [2022-12-13 10:30:48,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-13 10:30:48,063 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:48,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 10:30:48,064 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 83 transitions, 804 flow [2022-12-13 10:30:48,064 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 10:30:48,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:48,064 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 10:30:48,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 10:30:48,064 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 10:30:48,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1755890800, now seen corresponding path program 1 times [2022-12-13 10:30:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:48,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975247063] [2022-12-13 10:30:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:48,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 10:30:48,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:48,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975247063] [2022-12-13 10:30:48,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975247063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:48,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:48,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:30:48,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006729004] [2022-12-13 10:30:48,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:48,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:48,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:48,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:48,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:48,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:30:48,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 83 transitions, 804 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 10:30:48,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:48,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:30:48,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:48,776 INFO L130 PetriNetUnfolder]: 765/1667 cut-off events. [2022-12-13 10:30:48,776 INFO L131 PetriNetUnfolder]: For 10128/10128 co-relation queries the response was YES. [2022-12-13 10:30:48,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8228 conditions, 1667 events. 765/1667 cut-off events. For 10128/10128 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10894 event pairs, 305 based on Foata normal form. 2/1665 useless extension candidates. Maximal degree in co-relation 7151. Up to 1257 conditions per place. [2022-12-13 10:30:48,784 INFO L137 encePairwiseOnDemand]: 38/49 looper letters, 116 selfloop transitions, 13 changer transitions 27/156 dead transitions. [2022-12-13 10:30:48,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 156 transitions, 1606 flow [2022-12-13 10:30:48,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2022-12-13 10:30:48,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2947845804988662 [2022-12-13 10:30:48,785 INFO L175 Difference]: Start difference. First operand has 98 places, 83 transitions, 804 flow. Second operand 9 states and 130 transitions. [2022-12-13 10:30:48,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 156 transitions, 1606 flow [2022-12-13 10:30:48,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 156 transitions, 1516 flow, removed 42 selfloop flow, removed 2 redundant places. [2022-12-13 10:30:48,802 INFO L231 Difference]: Finished difference. Result has 108 places, 86 transitions, 810 flow [2022-12-13 10:30:48,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=810, PETRI_PLACES=108, PETRI_TRANSITIONS=86} [2022-12-13 10:30:48,802 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 10:30:48,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:48,802 INFO L89 Accepts]: Start accepts. Operand has 108 places, 86 transitions, 810 flow [2022-12-13 10:30:48,802 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:48,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:48,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 86 transitions, 810 flow [2022-12-13 10:30:48,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 86 transitions, 810 flow [2022-12-13 10:30:48,832 INFO L130 PetriNetUnfolder]: 55/463 cut-off events. [2022-12-13 10:30:48,832 INFO L131 PetriNetUnfolder]: For 1495/1502 co-relation queries the response was YES. [2022-12-13 10:30:48,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 463 events. 55/463 cut-off events. For 1495/1502 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3805 event pairs, 5 based on Foata normal form. 5/451 useless extension candidates. Maximal degree in co-relation 1626. Up to 60 conditions per place. [2022-12-13 10:30:48,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 86 transitions, 810 flow [2022-12-13 10:30:48,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-13 10:30:48,838 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:48,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-13 10:30:48,839 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 86 transitions, 810 flow [2022-12-13 10:30:48,839 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 10:30:48,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:48,840 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 10:30:48,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 10:30:48,840 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 10:30:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1544720144, now seen corresponding path program 2 times [2022-12-13 10:30:48,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:48,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762154916] [2022-12-13 10:30:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:48,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:49,260 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 10:30:49,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:49,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762154916] [2022-12-13 10:30:49,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762154916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:49,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:49,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:30:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775309286] [2022-12-13 10:30:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:49,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:30:49,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:49,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:30:49,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:30:49,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 10:30:49,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 86 transitions, 810 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 10:30:49,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:49,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 10:30:49,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:49,790 INFO L130 PetriNetUnfolder]: 763/1665 cut-off events. [2022-12-13 10:30:49,790 INFO L131 PetriNetUnfolder]: For 8130/8130 co-relation queries the response was YES. [2022-12-13 10:30:49,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7840 conditions, 1665 events. 763/1665 cut-off events. For 8130/8130 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10899 event pairs, 357 based on Foata normal form. 2/1663 useless extension candidates. Maximal degree in co-relation 7782. Up to 1257 conditions per place. [2022-12-13 10:30:49,800 INFO L137 encePairwiseOnDemand]: 35/48 looper letters, 104 selfloop transitions, 17 changer transitions 40/161 dead transitions. [2022-12-13 10:30:49,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 161 transitions, 1588 flow [2022-12-13 10:30:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:30:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:30:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2022-12-13 10:30:49,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25757575757575757 [2022-12-13 10:30:49,802 INFO L175 Difference]: Start difference. First operand has 106 places, 86 transitions, 810 flow. Second operand 11 states and 136 transitions. [2022-12-13 10:30:49,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 161 transitions, 1588 flow [2022-12-13 10:30:49,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 161 transitions, 1562 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 10:30:49,817 INFO L231 Difference]: Finished difference. Result has 115 places, 90 transitions, 880 flow [2022-12-13 10:30:49,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=880, PETRI_PLACES=115, PETRI_TRANSITIONS=90} [2022-12-13 10:30:49,818 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2022-12-13 10:30:49,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:49,818 INFO L89 Accepts]: Start accepts. Operand has 115 places, 90 transitions, 880 flow [2022-12-13 10:30:49,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:49,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:49,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 90 transitions, 880 flow [2022-12-13 10:30:49,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 90 transitions, 880 flow [2022-12-13 10:30:49,848 INFO L130 PetriNetUnfolder]: 58/451 cut-off events. [2022-12-13 10:30:49,848 INFO L131 PetriNetUnfolder]: For 1518/1527 co-relation queries the response was YES. [2022-12-13 10:30:49,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1717 conditions, 451 events. 58/451 cut-off events. For 1518/1527 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3683 event pairs, 9 based on Foata normal form. 5/439 useless extension candidates. Maximal degree in co-relation 1665. Up to 58 conditions per place. [2022-12-13 10:30:49,852 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 90 transitions, 880 flow [2022-12-13 10:30:49,852 INFO L226 LiptonReduction]: Number of co-enabled transitions 510 [2022-12-13 10:30:49,904 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 [764] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| 0)) (= (+ v_~tmp1~0_252 1) v_~n1~0_510) (= v_~n2~0_528 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_69| 0) (= v_~e1~0_292 0) (= (ite (and (< v_~i~0_512 v_~n~0_242) (<= 0 v_~i~0_512)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_69| 0) (= v_~n2~0_529 v_~tmp1~0_252)) InVars {~n2~0=v_~n2~0_529, ~i~0=v_~i~0_512, ~n~0=v_~n~0_242} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_69|, ~n2~0=v_~n2~0_528, ~i~0=v_~i~0_512, ~n1~0=v_~n1~0_510, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|, ~n~0=v_~n~0_242, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_69|, ~tmp1~0=v_~tmp1~0_252, ~e1~0=v_~e1~0_292} 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 10:30:49,986 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 10:30:50,012 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 [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 10:30:50,066 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:30:50,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-13 10:30:50,067 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 89 transitions, 914 flow [2022-12-13 10:30:50,067 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 10:30:50,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:50,067 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 10:30:50,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 10:30:50,067 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 10:30:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1303008486, now seen corresponding path program 1 times [2022-12-13 10:30:50,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:50,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096074568] [2022-12-13 10:30:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:50,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:50,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 10:30:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:50,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096074568] [2022-12-13 10:30:50,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096074568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:50,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:50,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:50,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34157718] [2022-12-13 10:30:50,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:50,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:50,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:50,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:50,518 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 53 [2022-12-13 10:30:50,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 89 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 10:30:50,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:50,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 53 [2022-12-13 10:30:50,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:51,076 INFO L130 PetriNetUnfolder]: 734/1620 cut-off events. [2022-12-13 10:30:51,076 INFO L131 PetriNetUnfolder]: For 8446/8446 co-relation queries the response was YES. [2022-12-13 10:30:51,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7766 conditions, 1620 events. 734/1620 cut-off events. For 8446/8446 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10656 event pairs, 303 based on Foata normal form. 2/1618 useless extension candidates. Maximal degree in co-relation 7706. Up to 1257 conditions per place. [2022-12-13 10:30:51,085 INFO L137 encePairwiseOnDemand]: 40/53 looper letters, 107 selfloop transitions, 16 changer transitions 29/152 dead transitions. [2022-12-13 10:30:51,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 152 transitions, 1592 flow [2022-12-13 10:30:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:30:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:30:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2022-12-13 10:30:51,086 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23962264150943396 [2022-12-13 10:30:51,086 INFO L175 Difference]: Start difference. First operand has 112 places, 89 transitions, 914 flow. Second operand 10 states and 127 transitions. [2022-12-13 10:30:51,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 152 transitions, 1592 flow [2022-12-13 10:30:51,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 152 transitions, 1528 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-12-13 10:30:51,101 INFO L231 Difference]: Finished difference. Result has 116 places, 90 transitions, 914 flow [2022-12-13 10:30:51,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=914, PETRI_PLACES=116, PETRI_TRANSITIONS=90} [2022-12-13 10:30:51,101 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2022-12-13 10:30:51,101 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:51,101 INFO L89 Accepts]: Start accepts. Operand has 116 places, 90 transitions, 914 flow [2022-12-13 10:30:51,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:51,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:51,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 90 transitions, 914 flow [2022-12-13 10:30:51,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 90 transitions, 914 flow [2022-12-13 10:30:51,132 INFO L130 PetriNetUnfolder]: 53/449 cut-off events. [2022-12-13 10:30:51,132 INFO L131 PetriNetUnfolder]: For 1765/1774 co-relation queries the response was YES. [2022-12-13 10:30:51,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1743 conditions, 449 events. 53/449 cut-off events. For 1765/1774 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3688 event pairs, 7 based on Foata normal form. 5/438 useless extension candidates. Maximal degree in co-relation 1690. Up to 58 conditions per place. [2022-12-13 10:30:51,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 90 transitions, 914 flow [2022-12-13 10:30:51,135 INFO L226 LiptonReduction]: Number of co-enabled transitions 510 [2022-12-13 10:30:51,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [821] L103-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.base_89| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_409| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_409|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_89| 0) (= v_~e1~0_466 0) (= (select (select |v_#memory_int_560| v_~f~0.base_468) (+ v_~f~0.offset_465 (* v_~i2~0_235 4))) v_~i~0_862) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_409| 0)) (= v_~n2~0_835 v_~tmp1~0_360) (= (+ v_~tmp1~0_360 1) v_~n1~0_752) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_409| (ite (and (<= 0 v_~i~0_862) (< v_~i~0_862 v_~n~0_338)) 1 0)) (= v_~n2~0_834 0)) InVars {~n2~0=v_~n2~0_835, ~f~0.base=v_~f~0.base_468, #memory_int=|v_#memory_int_560|, ~i2~0=v_~i2~0_235, ~n~0=v_~n~0_338, ~f~0.offset=v_~f~0.offset_465} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_89|, ~n2~0=v_~n2~0_834, ~i~0=v_~i~0_862, ~n1~0=v_~n1~0_752, ~f~0.base=v_~f~0.base_468, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_409|, ~i2~0=v_~i2~0_235, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_89|, ~f~0.offset=v_~f~0.offset_465, ~e1~0=v_~e1~0_466, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_143|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_409|, #memory_int=|v_#memory_int_560|, ~n~0=v_~n~0_338, ~tmp1~0=v_~tmp1~0_360} 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, thread2Thread1of1ForFork2_#res#1.base, ~tmp1~0, ~e1~0] and [751] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|) (not (= (ite (= (mod v_~e2~0_337 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| (ite (or (<= v_~n1~0_476 v_~n2~0_482) (= v_~n2~0_482 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_231| 0)) (= v_~i1~0_221 v_~i~0_476) (= v_~i~0_475 (select (select |v_#memory_int_364| v_~f~0.base_284) (+ v_~f~0.offset_282 (* v_~i1~0_221 4))))) InVars {~n2~0=v_~n2~0_482, ~i~0=v_~i~0_476, ~f~0.base=v_~f~0.base_284, ~n1~0=v_~n1~0_476, #memory_int=|v_#memory_int_364|, ~f~0.offset=v_~f~0.offset_282, ~e2~0=v_~e2~0_337} OutVars{~n2~0=v_~n2~0_482, ~i~0=v_~i~0_475, ~f~0.base=v_~f~0.base_284, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231|, ~n1~0=v_~n1~0_476, #memory_int=|v_#memory_int_364|, ~i1~0=v_~i1~0_221, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_94|, ~f~0.offset=v_~f~0.offset_282, ~e2~0=v_~e2~0_337, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|} 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 10:30:51,343 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:30:51,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 243 [2022-12-13 10:30:51,344 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 90 transitions, 923 flow [2022-12-13 10:30:51,344 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 10:30:51,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:51,344 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 10:30:51,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 10:30:51,344 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 10:30:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash 703022504, now seen corresponding path program 1 times [2022-12-13 10:30:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:51,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596719689] [2022-12-13 10:30:51,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:51,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:51,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 10:30:51,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:51,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596719689] [2022-12-13 10:30:51,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596719689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:51,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:51,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:30:51,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947749989] [2022-12-13 10:30:51,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:51,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:51,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:51,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:51,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:30:51,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 90 transitions, 923 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 10:30:51,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:51,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:30:51,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:52,277 INFO L130 PetriNetUnfolder]: 738/1638 cut-off events. [2022-12-13 10:30:52,277 INFO L131 PetriNetUnfolder]: For 9083/9083 co-relation queries the response was YES. [2022-12-13 10:30:52,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7955 conditions, 1638 events. 738/1638 cut-off events. For 9083/9083 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10849 event pairs, 340 based on Foata normal form. 2/1636 useless extension candidates. Maximal degree in co-relation 7894. Up to 1257 conditions per place. [2022-12-13 10:30:52,284 INFO L137 encePairwiseOnDemand]: 40/52 looper letters, 98 selfloop transitions, 11 changer transitions 36/145 dead transitions. [2022-12-13 10:30:52,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 145 transitions, 1527 flow [2022-12-13 10:30:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:30:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:30:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-13 10:30:52,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29086538461538464 [2022-12-13 10:30:52,284 INFO L175 Difference]: Start difference. First operand has 114 places, 90 transitions, 923 flow. Second operand 8 states and 121 transitions. [2022-12-13 10:30:52,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 145 transitions, 1527 flow [2022-12-13 10:30:52,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 145 transitions, 1487 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-13 10:30:52,300 INFO L231 Difference]: Finished difference. Result has 116 places, 87 transitions, 874 flow [2022-12-13 10:30:52,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=874, PETRI_PLACES=116, PETRI_TRANSITIONS=87} [2022-12-13 10:30:52,301 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2022-12-13 10:30:52,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:52,301 INFO L89 Accepts]: Start accepts. Operand has 116 places, 87 transitions, 874 flow [2022-12-13 10:30:52,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:52,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:52,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 87 transitions, 874 flow [2022-12-13 10:30:52,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 87 transitions, 874 flow [2022-12-13 10:30:52,335 INFO L130 PetriNetUnfolder]: 50/438 cut-off events. [2022-12-13 10:30:52,335 INFO L131 PetriNetUnfolder]: For 1710/1719 co-relation queries the response was YES. [2022-12-13 10:30:52,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 438 events. 50/438 cut-off events. For 1710/1719 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3587 event pairs, 7 based on Foata normal form. 5/425 useless extension candidates. Maximal degree in co-relation 1627. Up to 54 conditions per place. [2022-12-13 10:30:52,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 87 transitions, 874 flow [2022-12-13 10:30:52,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 10:30:52,341 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:52,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 10:30:52,342 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 87 transitions, 874 flow [2022-12-13 10:30:52,342 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 10:30:52,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:52,343 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 10:30:52,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 10:30:52,343 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 10:30:52,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash -958069682, now seen corresponding path program 1 times [2022-12-13 10:30:52,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:52,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415759126] [2022-12-13 10:30:52,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:52,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:53,225 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 10:30:53,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:53,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415759126] [2022-12-13 10:30:53,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415759126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:53,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:53,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:30:53,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586848809] [2022-12-13 10:30:53,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:53,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:53,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:53,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:53,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:53,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:30:53,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 87 transitions, 874 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 10:30:53,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:53,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:30:53,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:53,830 INFO L130 PetriNetUnfolder]: 710/1584 cut-off events. [2022-12-13 10:30:53,830 INFO L131 PetriNetUnfolder]: For 8670/8670 co-relation queries the response was YES. [2022-12-13 10:30:53,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7667 conditions, 1584 events. 710/1584 cut-off events. For 8670/8670 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10526 event pairs, 313 based on Foata normal form. 1/1581 useless extension candidates. Maximal degree in co-relation 7606. Up to 1257 conditions per place. [2022-12-13 10:30:53,839 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 98 selfloop transitions, 12 changer transitions 36/146 dead transitions. [2022-12-13 10:30:53,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 146 transitions, 1479 flow [2022-12-13 10:30:53,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:30:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:30:53,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2022-12-13 10:30:53,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2679738562091503 [2022-12-13 10:30:53,840 INFO L175 Difference]: Start difference. First operand has 113 places, 87 transitions, 874 flow. Second operand 9 states and 123 transitions. [2022-12-13 10:30:53,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 146 transitions, 1479 flow [2022-12-13 10:30:53,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 146 transitions, 1446 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-13 10:30:53,856 INFO L231 Difference]: Finished difference. Result has 116 places, 86 transitions, 849 flow [2022-12-13 10:30:53,857 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=106, 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=849, PETRI_PLACES=116, PETRI_TRANSITIONS=86} [2022-12-13 10:30:53,857 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2022-12-13 10:30:53,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:53,857 INFO L89 Accepts]: Start accepts. Operand has 116 places, 86 transitions, 849 flow [2022-12-13 10:30:53,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:53,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:53,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 86 transitions, 849 flow [2022-12-13 10:30:53,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 86 transitions, 849 flow [2022-12-13 10:30:53,897 INFO L130 PetriNetUnfolder]: 48/430 cut-off events. [2022-12-13 10:30:53,897 INFO L131 PetriNetUnfolder]: For 1592/1601 co-relation queries the response was YES. [2022-12-13 10:30:53,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 430 events. 48/430 cut-off events. For 1592/1601 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3532 event pairs, 7 based on Foata normal form. 5/417 useless extension candidates. Maximal degree in co-relation 1583. Up to 54 conditions per place. [2022-12-13 10:30:53,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 86 transitions, 849 flow [2022-12-13 10:30:53,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 498 [2022-12-13 10:30:53,903 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:53,904 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 10:30:53,904 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 86 transitions, 849 flow [2022-12-13 10:30:53,904 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 10:30:53,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:53,904 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 10:30:53,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-13 10:30:53,904 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 10:30:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash 208378670, now seen corresponding path program 1 times [2022-12-13 10:30:53,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:53,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108273799] [2022-12-13 10:30:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:53,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:54,338 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 10:30:54,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:54,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108273799] [2022-12-13 10:30:54,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108273799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:54,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:54,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:30:54,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081130397] [2022-12-13 10:30:54,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:54,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:30:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:54,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:30:54,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:30:54,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:30:54,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 86 transitions, 849 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 10:30:54,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:54,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:30:54,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:54,801 INFO L130 PetriNetUnfolder]: 687/1519 cut-off events. [2022-12-13 10:30:54,802 INFO L131 PetriNetUnfolder]: For 8293/8293 co-relation queries the response was YES. [2022-12-13 10:30:54,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7375 conditions, 1519 events. 687/1519 cut-off events. For 8293/8293 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9846 event pairs, 305 based on Foata normal form. 2/1517 useless extension candidates. Maximal degree in co-relation 7320. Up to 1257 conditions per place. [2022-12-13 10:30:54,811 INFO L137 encePairwiseOnDemand]: 39/50 looper letters, 77 selfloop transitions, 7 changer transitions 42/126 dead transitions. [2022-12-13 10:30:54,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 126 transitions, 1332 flow [2022-12-13 10:30:54,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:30:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:30:54,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-12-13 10:30:54,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2575 [2022-12-13 10:30:54,812 INFO L175 Difference]: Start difference. First operand has 114 places, 86 transitions, 849 flow. Second operand 8 states and 103 transitions. [2022-12-13 10:30:54,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 126 transitions, 1332 flow [2022-12-13 10:30:54,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 126 transitions, 1307 flow, removed 2 selfloop flow, removed 7 redundant places. [2022-12-13 10:30:54,828 INFO L231 Difference]: Finished difference. Result has 115 places, 76 transitions, 718 flow [2022-12-13 10:30:54,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=718, PETRI_PLACES=115, PETRI_TRANSITIONS=76} [2022-12-13 10:30:54,828 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2022-12-13 10:30:54,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:54,828 INFO L89 Accepts]: Start accepts. Operand has 115 places, 76 transitions, 718 flow [2022-12-13 10:30:54,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:54,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:54,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 76 transitions, 718 flow [2022-12-13 10:30:54,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 76 transitions, 718 flow [2022-12-13 10:30:54,854 INFO L130 PetriNetUnfolder]: 45/366 cut-off events. [2022-12-13 10:30:54,854 INFO L131 PetriNetUnfolder]: For 1269/1275 co-relation queries the response was YES. [2022-12-13 10:30:54,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 366 events. 45/366 cut-off events. For 1269/1275 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2866 event pairs, 4 based on Foata normal form. 4/355 useless extension candidates. Maximal degree in co-relation 1341. Up to 43 conditions per place. [2022-12-13 10:30:54,857 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 76 transitions, 718 flow [2022-12-13 10:30:54,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-13 10:30:56,484 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:30:56,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1657 [2022-12-13 10:30:56,485 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 75 transitions, 710 flow [2022-12-13 10:30:56,485 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 10:30:56,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:56,485 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 10:30:56,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 10:30:56,485 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 10:30:56,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:56,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1323883796, now seen corresponding path program 1 times [2022-12-13 10:30:56,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:56,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273568315] [2022-12-13 10:30:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:56,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:57,326 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 10:30:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:57,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273568315] [2022-12-13 10:30:57,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273568315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:57,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:57,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:30:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536281216] [2022-12-13 10:30:57,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:57,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:30:57,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:57,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:30:57,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:30:57,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 10:30:57,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 75 transitions, 710 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 10:30:57,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:57,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 10:30:57,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:58,047 INFO L130 PetriNetUnfolder]: 1235/2683 cut-off events. [2022-12-13 10:30:58,047 INFO L131 PetriNetUnfolder]: For 14454/14454 co-relation queries the response was YES. [2022-12-13 10:30:58,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12949 conditions, 2683 events. 1235/2683 cut-off events. For 14454/14454 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19711 event pairs, 420 based on Foata normal form. 4/2679 useless extension candidates. Maximal degree in co-relation 12880. Up to 1257 conditions per place. [2022-12-13 10:30:58,062 INFO L137 encePairwiseOnDemand]: 31/48 looper letters, 150 selfloop transitions, 24 changer transitions 35/209 dead transitions. [2022-12-13 10:30:58,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 209 transitions, 2195 flow [2022-12-13 10:30:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:30:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:30:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2022-12-13 10:30:58,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2022-12-13 10:30:58,063 INFO L175 Difference]: Start difference. First operand has 101 places, 75 transitions, 710 flow. Second operand 10 states and 172 transitions. [2022-12-13 10:30:58,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 209 transitions, 2195 flow [2022-12-13 10:30:58,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 209 transitions, 2129 flow, removed 23 selfloop flow, removed 9 redundant places. [2022-12-13 10:30:58,093 INFO L231 Difference]: Finished difference. Result has 107 places, 93 transitions, 987 flow [2022-12-13 10:30:58,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=987, PETRI_PLACES=107, PETRI_TRANSITIONS=93} [2022-12-13 10:30:58,093 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places. [2022-12-13 10:30:58,093 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:58,093 INFO L89 Accepts]: Start accepts. Operand has 107 places, 93 transitions, 987 flow [2022-12-13 10:30:58,094 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:58,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:58,094 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 93 transitions, 987 flow [2022-12-13 10:30:58,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 93 transitions, 987 flow [2022-12-13 10:30:58,139 INFO L130 PetriNetUnfolder]: 79/711 cut-off events. [2022-12-13 10:30:58,139 INFO L131 PetriNetUnfolder]: For 2757/2771 co-relation queries the response was YES. [2022-12-13 10:30:58,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2727 conditions, 711 events. 79/711 cut-off events. For 2757/2771 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6792 event pairs, 7 based on Foata normal form. 10/690 useless extension candidates. Maximal degree in co-relation 2670. Up to 85 conditions per place. [2022-12-13 10:30:58,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 93 transitions, 987 flow [2022-12-13 10:30:58,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-13 10:30:58,302 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [753] L59-->L71: Formula: (and (not (= 0 (ite (= (mod v_~e2~0_341 256) 0) 1 0))) (= (select (select |v_#memory_int_368| v_~f~0.base_288) (+ v_~f~0.offset_286 (* v_~i1~0_225 4))) v_~i~0_483) (= v_~i1~0_225 v_~i~0_484) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| (ite (or (<= v_~n1~0_480 v_~n2~0_486) (= v_~n2~0_486 0)) 1 0))) InVars {~n2~0=v_~n2~0_486, ~i~0=v_~i~0_484, ~f~0.base=v_~f~0.base_288, ~n1~0=v_~n1~0_480, #memory_int=|v_#memory_int_368|, ~f~0.offset=v_~f~0.offset_286, ~e2~0=v_~e2~0_341} OutVars{~n2~0=v_~n2~0_486, ~i~0=v_~i~0_483, ~f~0.base=v_~f~0.base_288, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235|, ~n1~0=v_~n1~0_480, #memory_int=|v_#memory_int_368|, ~i1~0=v_~i1~0_225, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_98|, ~f~0.offset=v_~f~0.offset_286, ~e2~0=v_~e2~0_341, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|} 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 10:30:58,440 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:30:58,441 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 348 [2022-12-13 10:30:58,441 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 92 transitions, 1038 flow [2022-12-13 10:30:58,441 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 10:30:58,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:58,441 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 10:30:58,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 10:30:58,441 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 10:30:58,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:58,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1542313041, now seen corresponding path program 1 times [2022-12-13 10:30:58,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:58,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145359785] [2022-12-13 10:30:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:58,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:58,602 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 10:30:58,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:58,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145359785] [2022-12-13 10:30:58,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145359785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:58,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:58,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:30:58,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259263536] [2022-12-13 10:30:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:58,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:58,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:58,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:58,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:58,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 10:30:58,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 92 transitions, 1038 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 10:30:58,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:58,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 10:30:58,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:30:58,981 INFO L130 PetriNetUnfolder]: 1128/2508 cut-off events. [2022-12-13 10:30:58,981 INFO L131 PetriNetUnfolder]: For 17937/17937 co-relation queries the response was YES. [2022-12-13 10:30:58,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12721 conditions, 2508 events. 1128/2508 cut-off events. For 17937/17937 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18397 event pairs, 407 based on Foata normal form. 4/2504 useless extension candidates. Maximal degree in co-relation 12653. Up to 1553 conditions per place. [2022-12-13 10:30:58,994 INFO L137 encePairwiseOnDemand]: 41/54 looper letters, 89 selfloop transitions, 16 changer transitions 29/134 dead transitions. [2022-12-13 10:30:58,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 134 transitions, 1601 flow [2022-12-13 10:30:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:30:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:30:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-13 10:30:58,995 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33024691358024694 [2022-12-13 10:30:58,995 INFO L175 Difference]: Start difference. First operand has 105 places, 92 transitions, 1038 flow. Second operand 6 states and 107 transitions. [2022-12-13 10:30:58,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 134 transitions, 1601 flow [2022-12-13 10:30:59,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 134 transitions, 1559 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 10:30:59,031 INFO L231 Difference]: Finished difference. Result has 110 places, 83 transitions, 874 flow [2022-12-13 10:30:59,031 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=874, PETRI_PLACES=110, PETRI_TRANSITIONS=83} [2022-12-13 10:30:59,032 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2022-12-13 10:30:59,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:30:59,032 INFO L89 Accepts]: Start accepts. Operand has 110 places, 83 transitions, 874 flow [2022-12-13 10:30:59,032 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:30:59,032 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:30:59,032 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 83 transitions, 874 flow [2022-12-13 10:30:59,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 83 transitions, 874 flow [2022-12-13 10:30:59,072 INFO L130 PetriNetUnfolder]: 71/620 cut-off events. [2022-12-13 10:30:59,072 INFO L131 PetriNetUnfolder]: For 2738/2752 co-relation queries the response was YES. [2022-12-13 10:30:59,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 620 events. 71/620 cut-off events. For 2738/2752 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5639 event pairs, 9 based on Foata normal form. 6/592 useless extension candidates. Maximal degree in co-relation 2303. Up to 78 conditions per place. [2022-12-13 10:30:59,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 83 transitions, 874 flow [2022-12-13 10:30:59,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-13 10:30:59,079 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:30:59,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 10:30:59,080 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 83 transitions, 874 flow [2022-12-13 10:30:59,080 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 10:30:59,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:30:59,080 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 10:30:59,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 10:30:59,080 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 10:30:59,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:30:59,081 INFO L85 PathProgramCache]: Analyzing trace with hash 534929406, now seen corresponding path program 1 times [2022-12-13 10:30:59,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:30:59,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979675407] [2022-12-13 10:30:59,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:30:59,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:30:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:30:59,620 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 10:30:59,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:30:59,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979675407] [2022-12-13 10:30:59,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979675407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:30:59,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:30:59,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:30:59,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775202857] [2022-12-13 10:30:59,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:30:59,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:30:59,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:30:59,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:30:59,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:30:59,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:30:59,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 83 transitions, 874 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 10:30:59,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:30:59,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:30:59,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:00,180 INFO L130 PetriNetUnfolder]: 1013/2221 cut-off events. [2022-12-13 10:31:00,181 INFO L131 PetriNetUnfolder]: For 14534/14534 co-relation queries the response was YES. [2022-12-13 10:31:00,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10986 conditions, 2221 events. 1013/2221 cut-off events. For 14534/14534 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15490 event pairs, 395 based on Foata normal form. 2/2215 useless extension candidates. Maximal degree in co-relation 10289. Up to 1257 conditions per place. [2022-12-13 10:31:00,192 INFO L137 encePairwiseOnDemand]: 36/50 looper letters, 160 selfloop transitions, 19 changer transitions 10/189 dead transitions. [2022-12-13 10:31:00,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 189 transitions, 2053 flow [2022-12-13 10:31:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2022-12-13 10:31:00,193 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3511111111111111 [2022-12-13 10:31:00,194 INFO L175 Difference]: Start difference. First operand has 107 places, 83 transitions, 874 flow. Second operand 9 states and 158 transitions. [2022-12-13 10:31:00,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 189 transitions, 2053 flow [2022-12-13 10:31:00,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 189 transitions, 1980 flow, removed 15 selfloop flow, removed 8 redundant places. [2022-12-13 10:31:00,220 INFO L231 Difference]: Finished difference. Result has 111 places, 89 transitions, 960 flow [2022-12-13 10:31:00,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=960, PETRI_PLACES=111, PETRI_TRANSITIONS=89} [2022-12-13 10:31:00,221 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 10:31:00,221 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:00,221 INFO L89 Accepts]: Start accepts. Operand has 111 places, 89 transitions, 960 flow [2022-12-13 10:31:00,221 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:00,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:00,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 89 transitions, 960 flow [2022-12-13 10:31:00,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 89 transitions, 960 flow [2022-12-13 10:31:00,262 INFO L130 PetriNetUnfolder]: 69/631 cut-off events. [2022-12-13 10:31:00,263 INFO L131 PetriNetUnfolder]: For 2929/2943 co-relation queries the response was YES. [2022-12-13 10:31:00,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2366 conditions, 631 events. 69/631 cut-off events. For 2929/2943 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5797 event pairs, 7 based on Foata normal form. 6/605 useless extension candidates. Maximal degree in co-relation 2308. Up to 78 conditions per place. [2022-12-13 10:31:00,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 89 transitions, 960 flow [2022-12-13 10:31:00,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-13 10:31:00,297 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:00,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-13 10:31:00,298 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 89 transitions, 971 flow [2022-12-13 10:31:00,298 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 10:31:00,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:00,298 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 10:31:00,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 10:31:00,298 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 10:31:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash 789669170, now seen corresponding path program 1 times [2022-12-13 10:31:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:00,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719248440] [2022-12-13 10:31:00,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:00,814 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 10:31:00,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:00,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719248440] [2022-12-13 10:31:00,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719248440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:00,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:00,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:31:00,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614476886] [2022-12-13 10:31:00,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:00,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:31:00,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:00,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:31:00,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:31:00,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:00,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 89 transitions, 971 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 10:31:00,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:00,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:00,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:01,394 INFO L130 PetriNetUnfolder]: 1005/2211 cut-off events. [2022-12-13 10:31:01,395 INFO L131 PetriNetUnfolder]: For 15309/15309 co-relation queries the response was YES. [2022-12-13 10:31:01,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10857 conditions, 2211 events. 1005/2211 cut-off events. For 15309/15309 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15441 event pairs, 439 based on Foata normal form. 4/2207 useless extension candidates. Maximal degree in co-relation 10794. Up to 1257 conditions per place. [2022-12-13 10:31:01,405 INFO L137 encePairwiseOnDemand]: 33/51 looper letters, 129 selfloop transitions, 14 changer transitions 41/184 dead transitions. [2022-12-13 10:31:01,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 184 transitions, 2027 flow [2022-12-13 10:31:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:31:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:31:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2022-12-13 10:31:01,406 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2022-12-13 10:31:01,406 INFO L175 Difference]: Start difference. First operand has 110 places, 89 transitions, 971 flow. Second operand 10 states and 150 transitions. [2022-12-13 10:31:01,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 184 transitions, 2027 flow [2022-12-13 10:31:01,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 184 transitions, 1965 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-13 10:31:01,432 INFO L231 Difference]: Finished difference. Result has 119 places, 90 transitions, 974 flow [2022-12-13 10:31:01,432 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=974, PETRI_PLACES=119, PETRI_TRANSITIONS=90} [2022-12-13 10:31:01,432 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 10:31:01,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:01,432 INFO L89 Accepts]: Start accepts. Operand has 119 places, 90 transitions, 974 flow [2022-12-13 10:31:01,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:01,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:01,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 90 transitions, 974 flow [2022-12-13 10:31:01,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 90 transitions, 974 flow [2022-12-13 10:31:01,471 INFO L130 PetriNetUnfolder]: 65/584 cut-off events. [2022-12-13 10:31:01,471 INFO L131 PetriNetUnfolder]: For 3181/3221 co-relation queries the response was YES. [2022-12-13 10:31:01,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 584 events. 65/584 cut-off events. For 3181/3221 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5192 event pairs, 7 based on Foata normal form. 8/563 useless extension candidates. Maximal degree in co-relation 2224. Up to 71 conditions per place. [2022-12-13 10:31:01,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 90 transitions, 974 flow [2022-12-13 10:31:01,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-13 10:31:01,477 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 10:31:01,517 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:01,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-13 10:31:01,518 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 90 transitions, 979 flow [2022-12-13 10:31:01,518 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 10:31:01,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:01,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 10:31:01,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 10:31:01,518 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 10:31:01,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:01,518 INFO L85 PathProgramCache]: Analyzing trace with hash -661528464, now seen corresponding path program 1 times [2022-12-13 10:31:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:01,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296363459] [2022-12-13 10:31:01,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:02,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 10:31:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:02,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296363459] [2022-12-13 10:31:02,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296363459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:02,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:02,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:31:02,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270196639] [2022-12-13 10:31:02,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:02,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:31:02,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:02,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:31:02,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:31:02,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:31:02,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 90 transitions, 979 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 10:31:02,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:02,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:31:02,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:02,616 INFO L130 PetriNetUnfolder]: 950/2082 cut-off events. [2022-12-13 10:31:02,616 INFO L131 PetriNetUnfolder]: For 14641/14641 co-relation queries the response was YES. [2022-12-13 10:31:02,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10395 conditions, 2082 events. 950/2082 cut-off events. For 14641/14641 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14281 event pairs, 410 based on Foata normal form. 2/2076 useless extension candidates. Maximal degree in co-relation 10328. Up to 1257 conditions per place. [2022-12-13 10:31:02,630 INFO L137 encePairwiseOnDemand]: 35/52 looper letters, 129 selfloop transitions, 21 changer transitions 50/200 dead transitions. [2022-12-13 10:31:02,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 200 transitions, 2121 flow [2022-12-13 10:31:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:31:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:31:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 169 transitions. [2022-12-13 10:31:02,631 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2708333333333333 [2022-12-13 10:31:02,631 INFO L175 Difference]: Start difference. First operand has 115 places, 90 transitions, 979 flow. Second operand 12 states and 169 transitions. [2022-12-13 10:31:02,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 200 transitions, 2121 flow [2022-12-13 10:31:02,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 200 transitions, 2071 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-12-13 10:31:02,663 INFO L231 Difference]: Finished difference. Result has 127 places, 97 transitions, 1064 flow [2022-12-13 10:31:02,664 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1064, PETRI_PLACES=127, PETRI_TRANSITIONS=97} [2022-12-13 10:31:02,664 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places. [2022-12-13 10:31:02,664 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:02,664 INFO L89 Accepts]: Start accepts. Operand has 127 places, 97 transitions, 1064 flow [2022-12-13 10:31:02,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:02,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:02,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 97 transitions, 1064 flow [2022-12-13 10:31:02,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 97 transitions, 1064 flow [2022-12-13 10:31:02,705 INFO L130 PetriNetUnfolder]: 71/583 cut-off events. [2022-12-13 10:31:02,706 INFO L131 PetriNetUnfolder]: For 3434/3475 co-relation queries the response was YES. [2022-12-13 10:31:02,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 583 events. 71/583 cut-off events. For 3434/3475 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5132 event pairs, 10 based on Foata normal form. 8/565 useless extension candidates. Maximal degree in co-relation 2307. Up to 71 conditions per place. [2022-12-13 10:31:02,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 97 transitions, 1064 flow [2022-12-13 10:31:02,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 552 [2022-12-13 10:31:02,768 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 10:31:02,789 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 [764] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| 0)) (= (+ v_~tmp1~0_252 1) v_~n1~0_510) (= v_~n2~0_528 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_69| 0) (= v_~e1~0_292 0) (= (ite (and (< v_~i~0_512 v_~n~0_242) (<= 0 v_~i~0_512)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_69| 0) (= v_~n2~0_529 v_~tmp1~0_252)) InVars {~n2~0=v_~n2~0_529, ~i~0=v_~i~0_512, ~n~0=v_~n~0_242} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_69|, ~n2~0=v_~n2~0_528, ~i~0=v_~i~0_512, ~n1~0=v_~n1~0_510, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|, ~n~0=v_~n~0_242, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_69|, ~tmp1~0=v_~tmp1~0_252, ~e1~0=v_~e1~0_292} 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 10:31:02,874 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:02,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-13 10:31:02,875 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 96 transitions, 1100 flow [2022-12-13 10:31:02,875 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 10:31:02,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:02,876 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 10:31:02,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 10:31:02,876 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 10:31:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:02,876 INFO L85 PathProgramCache]: Analyzing trace with hash 22055098, now seen corresponding path program 2 times [2022-12-13 10:31:02,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:02,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4143017] [2022-12-13 10:31:02,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:02,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:03,243 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 10:31:03,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:03,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4143017] [2022-12-13 10:31:03,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4143017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:03,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:03,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:31:03,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380772172] [2022-12-13 10:31:03,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:03,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:31:03,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:03,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:31:03,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:31:03,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 10:31:03,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 96 transitions, 1100 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 10:31:03,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:03,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 10:31:03,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:03,774 INFO L130 PetriNetUnfolder]: 930/2059 cut-off events. [2022-12-13 10:31:03,774 INFO L131 PetriNetUnfolder]: For 15810/15810 co-relation queries the response was YES. [2022-12-13 10:31:03,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10475 conditions, 2059 events. 930/2059 cut-off events. For 15810/15810 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14203 event pairs, 440 based on Foata normal form. 4/2055 useless extension candidates. Maximal degree in co-relation 10405. Up to 1116 conditions per place. [2022-12-13 10:31:03,788 INFO L137 encePairwiseOnDemand]: 40/55 looper letters, 137 selfloop transitions, 17 changer transitions 54/208 dead transitions. [2022-12-13 10:31:03,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 208 transitions, 2343 flow [2022-12-13 10:31:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 10:31:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 10:31:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 178 transitions. [2022-12-13 10:31:03,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23116883116883116 [2022-12-13 10:31:03,789 INFO L175 Difference]: Start difference. First operand has 124 places, 96 transitions, 1100 flow. Second operand 14 states and 178 transitions. [2022-12-13 10:31:03,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 208 transitions, 2343 flow [2022-12-13 10:31:03,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 208 transitions, 2290 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-13 10:31:03,822 INFO L231 Difference]: Finished difference. Result has 137 places, 96 transitions, 1105 flow [2022-12-13 10:31:03,822 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1105, PETRI_PLACES=137, PETRI_TRANSITIONS=96} [2022-12-13 10:31:03,822 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 96 predicate places. [2022-12-13 10:31:03,822 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:03,823 INFO L89 Accepts]: Start accepts. Operand has 137 places, 96 transitions, 1105 flow [2022-12-13 10:31:03,823 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:03,823 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:03,823 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 96 transitions, 1105 flow [2022-12-13 10:31:03,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 96 transitions, 1105 flow [2022-12-13 10:31:03,878 INFO L130 PetriNetUnfolder]: 67/567 cut-off events. [2022-12-13 10:31:03,878 INFO L131 PetriNetUnfolder]: For 3450/3489 co-relation queries the response was YES. [2022-12-13 10:31:03,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 567 events. 67/567 cut-off events. For 3450/3489 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4969 event pairs, 14 based on Foata normal form. 7/549 useless extension candidates. Maximal degree in co-relation 2297. Up to 70 conditions per place. [2022-12-13 10:31:03,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 96 transitions, 1105 flow [2022-12-13 10:31:03,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-13 10:31:03,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:03,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 10:31:03,942 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 96 transitions, 1111 flow [2022-12-13 10:31:03,942 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 10:31:03,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:03,942 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 10:31:03,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-13 10:31:03,942 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 10:31:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:03,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1159241191, now seen corresponding path program 1 times [2022-12-13 10:31:03,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:03,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188594809] [2022-12-13 10:31:03,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:04,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 10:31:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:04,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188594809] [2022-12-13 10:31:04,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188594809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:04,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:04,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:04,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407193735] [2022-12-13 10:31:04,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:04,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:04,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:04,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:04,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:04,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 10:31:04,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 96 transitions, 1111 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 10:31:04,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:04,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 10:31:04,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:04,937 INFO L130 PetriNetUnfolder]: 887/1952 cut-off events. [2022-12-13 10:31:04,937 INFO L131 PetriNetUnfolder]: For 14642/14642 co-relation queries the response was YES. [2022-12-13 10:31:04,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10018 conditions, 1952 events. 887/1952 cut-off events. For 14642/14642 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13272 event pairs, 379 based on Foata normal form. 2/1946 useless extension candidates. Maximal degree in co-relation 9935. Up to 1255 conditions per place. [2022-12-13 10:31:04,948 INFO L137 encePairwiseOnDemand]: 39/55 looper letters, 127 selfloop transitions, 17 changer transitions 41/185 dead transitions. [2022-12-13 10:31:04,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 185 transitions, 2097 flow [2022-12-13 10:31:04,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2022-12-13 10:31:04,948 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2022-12-13 10:31:04,948 INFO L175 Difference]: Start difference. First operand has 129 places, 96 transitions, 1111 flow. Second operand 9 states and 154 transitions. [2022-12-13 10:31:04,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 185 transitions, 2097 flow [2022-12-13 10:31:04,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 185 transitions, 2001 flow, removed 25 selfloop flow, removed 11 redundant places. [2022-12-13 10:31:04,978 INFO L231 Difference]: Finished difference. Result has 129 places, 95 transitions, 1073 flow [2022-12-13 10:31:04,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1073, PETRI_PLACES=129, PETRI_TRANSITIONS=95} [2022-12-13 10:31:04,978 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 88 predicate places. [2022-12-13 10:31:04,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:04,978 INFO L89 Accepts]: Start accepts. Operand has 129 places, 95 transitions, 1073 flow [2022-12-13 10:31:04,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:04,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:04,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 95 transitions, 1073 flow [2022-12-13 10:31:04,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 95 transitions, 1073 flow [2022-12-13 10:31:05,015 INFO L130 PetriNetUnfolder]: 62/531 cut-off events. [2022-12-13 10:31:05,015 INFO L131 PetriNetUnfolder]: For 3353/3392 co-relation queries the response was YES. [2022-12-13 10:31:05,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 531 events. 62/531 cut-off events. For 3353/3392 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4535 event pairs, 10 based on Foata normal form. 7/513 useless extension candidates. Maximal degree in co-relation 2145. Up to 59 conditions per place. [2022-12-13 10:31:05,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 95 transitions, 1073 flow [2022-12-13 10:31:05,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-13 10:31:05,022 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:05,023 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 10:31:05,023 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 1073 flow [2022-12-13 10:31:05,023 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 10:31:05,023 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:05,023 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 10:31:05,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 10:31:05,024 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 10:31:05,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash 781506735, now seen corresponding path program 1 times [2022-12-13 10:31:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:05,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418965135] [2022-12-13 10:31:05,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:05,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:05,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418965135] [2022-12-13 10:31:05,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418965135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:05,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:05,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:31:05,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12640970] [2022-12-13 10:31:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:05,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:31:05,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:05,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:31:05,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:31:05,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 10:31:05,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 1073 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 10:31:05,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:05,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 10:31:05,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:05,765 INFO L130 PetriNetUnfolder]: 856/1888 cut-off events. [2022-12-13 10:31:05,765 INFO L131 PetriNetUnfolder]: For 14604/14604 co-relation queries the response was YES. [2022-12-13 10:31:05,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9650 conditions, 1888 events. 856/1888 cut-off events. For 14604/14604 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12729 event pairs, 403 based on Foata normal form. 2/1882 useless extension candidates. Maximal degree in co-relation 9571. Up to 1255 conditions per place. [2022-12-13 10:31:05,776 INFO L137 encePairwiseOnDemand]: 40/55 looper letters, 118 selfloop transitions, 14 changer transitions 42/174 dead transitions. [2022-12-13 10:31:05,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 174 transitions, 1985 flow [2022-12-13 10:31:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:31:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:31:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2022-12-13 10:31:05,777 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32045454545454544 [2022-12-13 10:31:05,777 INFO L175 Difference]: Start difference. First operand has 127 places, 95 transitions, 1073 flow. Second operand 8 states and 141 transitions. [2022-12-13 10:31:05,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 174 transitions, 1985 flow [2022-12-13 10:31:05,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 174 transitions, 1934 flow, removed 8 selfloop flow, removed 9 redundant places. [2022-12-13 10:31:05,805 INFO L231 Difference]: Finished difference. Result has 128 places, 94 transitions, 1041 flow [2022-12-13 10:31:05,805 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1041, PETRI_PLACES=128, PETRI_TRANSITIONS=94} [2022-12-13 10:31:05,806 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 87 predicate places. [2022-12-13 10:31:05,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:05,806 INFO L89 Accepts]: Start accepts. Operand has 128 places, 94 transitions, 1041 flow [2022-12-13 10:31:05,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:05,806 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:05,806 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 94 transitions, 1041 flow [2022-12-13 10:31:05,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 94 transitions, 1041 flow [2022-12-13 10:31:05,843 INFO L130 PetriNetUnfolder]: 58/530 cut-off events. [2022-12-13 10:31:05,844 INFO L131 PetriNetUnfolder]: For 3415/3454 co-relation queries the response was YES. [2022-12-13 10:31:05,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2159 conditions, 530 events. 58/530 cut-off events. For 3415/3454 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4586 event pairs, 10 based on Foata normal form. 8/513 useless extension candidates. Maximal degree in co-relation 2095. Up to 59 conditions per place. [2022-12-13 10:31:05,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 94 transitions, 1041 flow [2022-12-13 10:31:05,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-13 10:31:05,857 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:05,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 10:31:05,859 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 94 transitions, 1041 flow [2022-12-13 10:31:05,859 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 10:31:05,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:05,859 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 10:31:05,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 10:31:05,859 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 10:31:05,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:05,859 INFO L85 PathProgramCache]: Analyzing trace with hash -71765917, now seen corresponding path program 2 times [2022-12-13 10:31:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:05,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983691084] [2022-12-13 10:31:05,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:06,385 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 10:31:06,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:06,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983691084] [2022-12-13 10:31:06,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983691084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:06,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:06,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:06,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707031501] [2022-12-13 10:31:06,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:06,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:06,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:06,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:06,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:06,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 54 [2022-12-13 10:31:06,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 94 transitions, 1041 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 10:31:06,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:06,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 54 [2022-12-13 10:31:06,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:06,930 INFO L130 PetriNetUnfolder]: 818/1804 cut-off events. [2022-12-13 10:31:06,930 INFO L131 PetriNetUnfolder]: For 14166/14166 co-relation queries the response was YES. [2022-12-13 10:31:06,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9184 conditions, 1804 events. 818/1804 cut-off events. For 14166/14166 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12048 event pairs, 384 based on Foata normal form. 2/1798 useless extension candidates. Maximal degree in co-relation 9114. Up to 1255 conditions per place. [2022-12-13 10:31:06,943 INFO L137 encePairwiseOnDemand]: 39/54 looper letters, 106 selfloop transitions, 11 changer transitions 48/165 dead transitions. [2022-12-13 10:31:06,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 165 transitions, 1830 flow [2022-12-13 10:31:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:31:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:31:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-12-13 10:31:06,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-13 10:31:06,944 INFO L175 Difference]: Start difference. First operand has 126 places, 94 transitions, 1041 flow. Second operand 10 states and 135 transitions. [2022-12-13 10:31:06,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 165 transitions, 1830 flow [2022-12-13 10:31:06,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 165 transitions, 1790 flow, removed 5 selfloop flow, removed 8 redundant places. [2022-12-13 10:31:06,970 INFO L231 Difference]: Finished difference. Result has 129 places, 88 transitions, 937 flow [2022-12-13 10:31:06,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=937, PETRI_PLACES=129, PETRI_TRANSITIONS=88} [2022-12-13 10:31:06,970 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 88 predicate places. [2022-12-13 10:31:06,970 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:06,971 INFO L89 Accepts]: Start accepts. Operand has 129 places, 88 transitions, 937 flow [2022-12-13 10:31:06,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:06,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:06,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 88 transitions, 937 flow [2022-12-13 10:31:06,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 88 transitions, 937 flow [2022-12-13 10:31:07,005 INFO L130 PetriNetUnfolder]: 54/484 cut-off events. [2022-12-13 10:31:07,005 INFO L131 PetriNetUnfolder]: For 2899/2936 co-relation queries the response was YES. [2022-12-13 10:31:07,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 484 events. 54/484 cut-off events. For 2899/2936 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4087 event pairs, 9 based on Foata normal form. 7/466 useless extension candidates. Maximal degree in co-relation 1895. Up to 55 conditions per place. [2022-12-13 10:31:07,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 88 transitions, 937 flow [2022-12-13 10:31:07,009 INFO L226 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-13 10:31:07,011 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:07,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 10:31:07,012 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 88 transitions, 937 flow [2022-12-13 10:31:07,012 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 10:31:07,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:07,012 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 10:31:07,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-13 10:31:07,013 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 10:31:07,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1654543888, now seen corresponding path program 1 times [2022-12-13 10:31:07,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:07,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902449838] [2022-12-13 10:31:07,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:07,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:07,506 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 10:31:07,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:07,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902449838] [2022-12-13 10:31:07,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902449838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:07,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:07,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:31:07,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038269675] [2022-12-13 10:31:07,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:07,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:31:07,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:31:07,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:31:07,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:07,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 88 transitions, 937 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 10:31:07,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:07,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:07,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:07,919 INFO L130 PetriNetUnfolder]: 836/1822 cut-off events. [2022-12-13 10:31:07,919 INFO L131 PetriNetUnfolder]: For 14210/14210 co-relation queries the response was YES. [2022-12-13 10:31:07,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9221 conditions, 1822 events. 836/1822 cut-off events. For 14210/14210 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12047 event pairs, 419 based on Foata normal form. 1/1815 useless extension candidates. Maximal degree in co-relation 9152. Up to 1255 conditions per place. [2022-12-13 10:31:07,929 INFO L137 encePairwiseOnDemand]: 40/51 looper letters, 120 selfloop transitions, 13 changer transitions 25/158 dead transitions. [2022-12-13 10:31:07,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 158 transitions, 1722 flow [2022-12-13 10:31:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:31:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:31:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2022-12-13 10:31:07,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31862745098039214 [2022-12-13 10:31:07,930 INFO L175 Difference]: Start difference. First operand has 122 places, 88 transitions, 937 flow. Second operand 8 states and 130 transitions. [2022-12-13 10:31:07,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 158 transitions, 1722 flow [2022-12-13 10:31:07,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 158 transitions, 1679 flow, removed 8 selfloop flow, removed 10 redundant places. [2022-12-13 10:31:07,955 INFO L231 Difference]: Finished difference. Result has 122 places, 91 transitions, 976 flow [2022-12-13 10:31:07,955 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=976, PETRI_PLACES=122, PETRI_TRANSITIONS=91} [2022-12-13 10:31:07,956 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2022-12-13 10:31:07,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:07,956 INFO L89 Accepts]: Start accepts. Operand has 122 places, 91 transitions, 976 flow [2022-12-13 10:31:07,956 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:07,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:07,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 91 transitions, 976 flow [2022-12-13 10:31:07,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 91 transitions, 976 flow [2022-12-13 10:31:07,997 INFO L130 PetriNetUnfolder]: 60/519 cut-off events. [2022-12-13 10:31:07,997 INFO L131 PetriNetUnfolder]: For 3301/3341 co-relation queries the response was YES. [2022-12-13 10:31:07,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 519 events. 60/519 cut-off events. For 3301/3341 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4476 event pairs, 11 based on Foata normal form. 7/497 useless extension candidates. Maximal degree in co-relation 2030. Up to 55 conditions per place. [2022-12-13 10:31:08,001 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 91 transitions, 976 flow [2022-12-13 10:31:08,001 INFO L226 LiptonReduction]: Number of co-enabled transitions 526 [2022-12-13 10:31:08,002 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:08,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 10:31:08,003 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 91 transitions, 976 flow [2022-12-13 10:31:08,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 10:31:08,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:08,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 10:31:08,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-13 10:31:08,003 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 10:31:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:08,003 INFO L85 PathProgramCache]: Analyzing trace with hash -265955773, now seen corresponding path program 1 times [2022-12-13 10:31:08,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:08,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364580530] [2022-12-13 10:31:08,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:08,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:08,511 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 10:31:08,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:08,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364580530] [2022-12-13 10:31:08,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364580530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:08,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:08,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041520546] [2022-12-13 10:31:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:08,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:08,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:08,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:08,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:08,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 91 transitions, 976 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 10:31:08,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:08,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:08,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:08,959 INFO L130 PetriNetUnfolder]: 840/1840 cut-off events. [2022-12-13 10:31:08,959 INFO L131 PetriNetUnfolder]: For 14636/14636 co-relation queries the response was YES. [2022-12-13 10:31:08,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9290 conditions, 1840 events. 840/1840 cut-off events. For 14636/14636 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12371 event pairs, 386 based on Foata normal form. 1/1833 useless extension candidates. Maximal degree in co-relation 9222. Up to 1255 conditions per place. [2022-12-13 10:31:08,970 INFO L137 encePairwiseOnDemand]: 40/51 looper letters, 109 selfloop transitions, 16 changer transitions 25/150 dead transitions. [2022-12-13 10:31:08,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 150 transitions, 1629 flow [2022-12-13 10:31:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:31:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:31:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-13 10:31:08,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2965686274509804 [2022-12-13 10:31:08,971 INFO L175 Difference]: Start difference. First operand has 121 places, 91 transitions, 976 flow. Second operand 8 states and 121 transitions. [2022-12-13 10:31:08,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 150 transitions, 1629 flow [2022-12-13 10:31:08,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 150 transitions, 1597 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 10:31:08,996 INFO L231 Difference]: Finished difference. Result has 124 places, 92 transitions, 995 flow [2022-12-13 10:31:08,997 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=995, PETRI_PLACES=124, PETRI_TRANSITIONS=92} [2022-12-13 10:31:08,997 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places. [2022-12-13 10:31:08,997 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:08,997 INFO L89 Accepts]: Start accepts. Operand has 124 places, 92 transitions, 995 flow [2022-12-13 10:31:08,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:08,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:08,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 92 transitions, 995 flow [2022-12-13 10:31:08,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 92 transitions, 995 flow [2022-12-13 10:31:09,034 INFO L130 PetriNetUnfolder]: 59/518 cut-off events. [2022-12-13 10:31:09,035 INFO L131 PetriNetUnfolder]: For 3428/3468 co-relation queries the response was YES. [2022-12-13 10:31:09,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 518 events. 59/518 cut-off events. For 3428/3468 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4504 event pairs, 11 based on Foata normal form. 7/496 useless extension candidates. Maximal degree in co-relation 2036. Up to 55 conditions per place. [2022-12-13 10:31:09,038 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 92 transitions, 995 flow [2022-12-13 10:31:09,038 INFO L226 LiptonReduction]: Number of co-enabled transitions 528 [2022-12-13 10:31:09,042 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:09,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 10:31:09,043 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 92 transitions, 995 flow [2022-12-13 10:31:09,043 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 10:31:09,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:09,043 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 10:31:09,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-13 10:31:09,043 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 10:31:09,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:09,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1768982921, now seen corresponding path program 1 times [2022-12-13 10:31:09,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:09,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238696222] [2022-12-13 10:31:09,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:09,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:09,640 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 10:31:09,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:09,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238696222] [2022-12-13 10:31:09,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238696222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:09,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:09,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:31:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297893648] [2022-12-13 10:31:09,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:09,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:31:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:09,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:31:09,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:31:09,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:09,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 92 transitions, 995 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 10:31:09,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:09,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:09,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:10,236 INFO L130 PetriNetUnfolder]: 828/1815 cut-off events. [2022-12-13 10:31:10,237 INFO L131 PetriNetUnfolder]: For 14896/14896 co-relation queries the response was YES. [2022-12-13 10:31:10,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9229 conditions, 1815 events. 828/1815 cut-off events. For 14896/14896 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12129 event pairs, 335 based on Foata normal form. 2/1809 useless extension candidates. Maximal degree in co-relation 9167. Up to 1255 conditions per place. [2022-12-13 10:31:10,246 INFO L137 encePairwiseOnDemand]: 38/51 looper letters, 78 selfloop transitions, 7 changer transitions 66/151 dead transitions. [2022-12-13 10:31:10,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 151 transitions, 1673 flow [2022-12-13 10:31:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:31:10,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:31:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2022-12-13 10:31:10,247 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2372549019607843 [2022-12-13 10:31:10,247 INFO L175 Difference]: Start difference. First operand has 123 places, 92 transitions, 995 flow. Second operand 10 states and 121 transitions. [2022-12-13 10:31:10,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 151 transitions, 1673 flow [2022-12-13 10:31:10,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 151 transitions, 1639 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 10:31:10,278 INFO L231 Difference]: Finished difference. Result has 129 places, 78 transitions, 760 flow [2022-12-13 10:31:10,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=760, PETRI_PLACES=129, PETRI_TRANSITIONS=78} [2022-12-13 10:31:10,278 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 88 predicate places. [2022-12-13 10:31:10,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:10,278 INFO L89 Accepts]: Start accepts. Operand has 129 places, 78 transitions, 760 flow [2022-12-13 10:31:10,279 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:10,279 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:10,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 78 transitions, 760 flow [2022-12-13 10:31:10,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 78 transitions, 760 flow [2022-12-13 10:31:10,306 INFO L130 PetriNetUnfolder]: 47/375 cut-off events. [2022-12-13 10:31:10,307 INFO L131 PetriNetUnfolder]: For 1723/1740 co-relation queries the response was YES. [2022-12-13 10:31:10,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 375 events. 47/375 cut-off events. For 1723/1740 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2944 event pairs, 7 based on Foata normal form. 5/365 useless extension candidates. Maximal degree in co-relation 1432. Up to 43 conditions per place. [2022-12-13 10:31:10,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 78 transitions, 760 flow [2022-12-13 10:31:10,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-13 10:31:12,420 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:12,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2143 [2022-12-13 10:31:12,421 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 77 transitions, 754 flow [2022-12-13 10:31:12,421 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 10:31:12,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:12,421 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 10:31:12,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-13 10:31:12,421 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 10:31:12,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:12,421 INFO L85 PathProgramCache]: Analyzing trace with hash -12170718, now seen corresponding path program 1 times [2022-12-13 10:31:12,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:12,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500871934] [2022-12-13 10:31:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:12,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:12,944 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 10:31:12,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:12,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500871934] [2022-12-13 10:31:12,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500871934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:12,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:12,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:12,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493989267] [2022-12-13 10:31:12,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:12,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:12,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:12,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:12,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:12,945 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 10:31:12,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 77 transitions, 754 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 10:31:12,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:12,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 10:31:12,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:13,506 INFO L130 PetriNetUnfolder]: 1231/2679 cut-off events. [2022-12-13 10:31:13,506 INFO L131 PetriNetUnfolder]: For 17587/17587 co-relation queries the response was YES. [2022-12-13 10:31:13,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13320 conditions, 2679 events. 1231/2679 cut-off events. For 17587/17587 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19636 event pairs, 444 based on Foata normal form. 4/2675 useless extension candidates. Maximal degree in co-relation 13244. Up to 1255 conditions per place. [2022-12-13 10:31:13,523 INFO L137 encePairwiseOnDemand]: 35/48 looper letters, 154 selfloop transitions, 19 changer transitions 34/207 dead transitions. [2022-12-13 10:31:13,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 207 transitions, 2252 flow [2022-12-13 10:31:13,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:13,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2022-12-13 10:31:13,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38425925925925924 [2022-12-13 10:31:13,524 INFO L175 Difference]: Start difference. First operand has 110 places, 77 transitions, 754 flow. Second operand 9 states and 166 transitions. [2022-12-13 10:31:13,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 207 transitions, 2252 flow [2022-12-13 10:31:13,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 207 transitions, 2116 flow, removed 43 selfloop flow, removed 15 redundant places. [2022-12-13 10:31:13,561 INFO L231 Difference]: Finished difference. Result has 108 places, 90 transitions, 914 flow [2022-12-13 10:31:13,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=914, PETRI_PLACES=108, PETRI_TRANSITIONS=90} [2022-12-13 10:31:13,562 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 10:31:13,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:13,562 INFO L89 Accepts]: Start accepts. Operand has 108 places, 90 transitions, 914 flow [2022-12-13 10:31:13,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:13,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:13,563 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 90 transitions, 914 flow [2022-12-13 10:31:13,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 90 transitions, 914 flow [2022-12-13 10:31:13,612 INFO L130 PetriNetUnfolder]: 83/725 cut-off events. [2022-12-13 10:31:13,612 INFO L131 PetriNetUnfolder]: For 2916/2949 co-relation queries the response was YES. [2022-12-13 10:31:13,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 725 events. 83/725 cut-off events. For 2916/2949 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6921 event pairs, 14 based on Foata normal form. 9/704 useless extension candidates. Maximal degree in co-relation 2611. Up to 85 conditions per place. [2022-12-13 10:31:13,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 90 transitions, 914 flow [2022-12-13 10:31:13,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-13 10:31:13,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:13,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 219 [2022-12-13 10:31:13,781 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 936 flow [2022-12-13 10:31:13,781 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 10:31:13,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:13,781 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 10:31:13,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-13 10:31:13,781 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 10:31:13,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:13,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1292809548, now seen corresponding path program 1 times [2022-12-13 10:31:13,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:13,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465601492] [2022-12-13 10:31:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:14,429 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 10:31:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:14,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465601492] [2022-12-13 10:31:14,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465601492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:14,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:14,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:31:14,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192050928] [2022-12-13 10:31:14,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:14,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:31:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:14,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:31:14,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:31:14,430 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:31:14,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 936 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 10:31:14,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:14,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:31:14,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:15,022 INFO L130 PetriNetUnfolder]: 1139/2519 cut-off events. [2022-12-13 10:31:15,022 INFO L131 PetriNetUnfolder]: For 16191/16191 co-relation queries the response was YES. [2022-12-13 10:31:15,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12264 conditions, 2519 events. 1139/2519 cut-off events. For 16191/16191 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18487 event pairs, 440 based on Foata normal form. 4/2515 useless extension candidates. Maximal degree in co-relation 12195. Up to 1255 conditions per place. [2022-12-13 10:31:15,035 INFO L137 encePairwiseOnDemand]: 36/52 looper letters, 141 selfloop transitions, 15 changer transitions 46/202 dead transitions. [2022-12-13 10:31:15,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 202 transitions, 2191 flow [2022-12-13 10:31:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2022-12-13 10:31:15,036 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3547008547008547 [2022-12-13 10:31:15,036 INFO L175 Difference]: Start difference. First operand has 106 places, 89 transitions, 936 flow. Second operand 9 states and 166 transitions. [2022-12-13 10:31:15,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 202 transitions, 2191 flow [2022-12-13 10:31:15,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 202 transitions, 2173 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 10:31:15,070 INFO L231 Difference]: Finished difference. Result has 115 places, 86 transitions, 877 flow [2022-12-13 10:31:15,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=877, PETRI_PLACES=115, PETRI_TRANSITIONS=86} [2022-12-13 10:31:15,070 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2022-12-13 10:31:15,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:15,070 INFO L89 Accepts]: Start accepts. Operand has 115 places, 86 transitions, 877 flow [2022-12-13 10:31:15,071 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:15,071 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:15,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 86 transitions, 877 flow [2022-12-13 10:31:15,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 86 transitions, 877 flow [2022-12-13 10:31:15,111 INFO L130 PetriNetUnfolder]: 75/639 cut-off events. [2022-12-13 10:31:15,111 INFO L131 PetriNetUnfolder]: For 2773/2783 co-relation queries the response was YES. [2022-12-13 10:31:15,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 639 events. 75/639 cut-off events. For 2773/2783 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5845 event pairs, 15 based on Foata normal form. 6/611 useless extension candidates. Maximal degree in co-relation 2345. Up to 79 conditions per place. [2022-12-13 10:31:15,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 86 transitions, 877 flow [2022-12-13 10:31:15,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-13 10:31:15,123 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [753] L59-->L71: Formula: (and (not (= 0 (ite (= (mod v_~e2~0_341 256) 0) 1 0))) (= (select (select |v_#memory_int_368| v_~f~0.base_288) (+ v_~f~0.offset_286 (* v_~i1~0_225 4))) v_~i~0_483) (= v_~i1~0_225 v_~i~0_484) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| (ite (or (<= v_~n1~0_480 v_~n2~0_486) (= v_~n2~0_486 0)) 1 0))) InVars {~n2~0=v_~n2~0_486, ~i~0=v_~i~0_484, ~f~0.base=v_~f~0.base_288, ~n1~0=v_~n1~0_480, #memory_int=|v_#memory_int_368|, ~f~0.offset=v_~f~0.offset_286, ~e2~0=v_~e2~0_341} OutVars{~n2~0=v_~n2~0_486, ~i~0=v_~i~0_483, ~f~0.base=v_~f~0.base_288, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235|, ~n1~0=v_~n1~0_480, #memory_int=|v_#memory_int_368|, ~i1~0=v_~i1~0_225, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_98|, ~f~0.offset=v_~f~0.offset_286, ~e2~0=v_~e2~0_341, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|} 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 10:31:15,254 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:15,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-13 10:31:15,255 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 886 flow [2022-12-13 10:31:15,255 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 10:31:15,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:15,255 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 10:31:15,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-13 10:31:15,255 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 10:31:15,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:15,255 INFO L85 PathProgramCache]: Analyzing trace with hash 253619232, now seen corresponding path program 1 times [2022-12-13 10:31:15,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:15,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877520975] [2022-12-13 10:31:15,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:15,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:15,862 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 10:31:15,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:15,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877520975] [2022-12-13 10:31:15,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877520975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:15,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:15,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:31:15,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950753848] [2022-12-13 10:31:15,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:15,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:31:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:15,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:31:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:31:15,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:31:15,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 886 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 10:31:15,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:15,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:31:15,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:16,424 INFO L130 PetriNetUnfolder]: 983/2165 cut-off events. [2022-12-13 10:31:16,424 INFO L131 PetriNetUnfolder]: For 14370/14370 co-relation queries the response was YES. [2022-12-13 10:31:16,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10483 conditions, 2165 events. 983/2165 cut-off events. For 14370/14370 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15083 event pairs, 421 based on Foata normal form. 4/2161 useless extension candidates. Maximal degree in co-relation 10418. Up to 1255 conditions per place. [2022-12-13 10:31:16,436 INFO L137 encePairwiseOnDemand]: 32/50 looper letters, 127 selfloop transitions, 13 changer transitions 44/184 dead transitions. [2022-12-13 10:31:16,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 184 transitions, 1994 flow [2022-12-13 10:31:16,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:31:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:31:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2022-12-13 10:31:16,437 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 10:31:16,437 INFO L175 Difference]: Start difference. First operand has 111 places, 85 transitions, 886 flow. Second operand 10 states and 150 transitions. [2022-12-13 10:31:16,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 184 transitions, 1994 flow [2022-12-13 10:31:16,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 184 transitions, 1922 flow, removed 22 selfloop flow, removed 9 redundant places. [2022-12-13 10:31:16,463 INFO L231 Difference]: Finished difference. Result has 116 places, 85 transitions, 870 flow [2022-12-13 10:31:16,463 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=870, PETRI_PLACES=116, PETRI_TRANSITIONS=85} [2022-12-13 10:31:16,463 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2022-12-13 10:31:16,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:16,463 INFO L89 Accepts]: Start accepts. Operand has 116 places, 85 transitions, 870 flow [2022-12-13 10:31:16,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:16,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:16,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 85 transitions, 870 flow [2022-12-13 10:31:16,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 85 transitions, 870 flow [2022-12-13 10:31:16,502 INFO L130 PetriNetUnfolder]: 71/580 cut-off events. [2022-12-13 10:31:16,503 INFO L131 PetriNetUnfolder]: For 2675/2686 co-relation queries the response was YES. [2022-12-13 10:31:16,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 580 events. 71/580 cut-off events. For 2675/2686 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5109 event pairs, 15 based on Foata normal form. 5/554 useless extension candidates. Maximal degree in co-relation 2162. Up to 71 conditions per place. [2022-12-13 10:31:16,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 85 transitions, 870 flow [2022-12-13 10:31:16,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-13 10:31:16,511 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 10:31:16,551 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:16,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 88 [2022-12-13 10:31:16,552 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 84 transitions, 866 flow [2022-12-13 10:31:16,552 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 10:31:16,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:16,552 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 10:31:16,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-13 10:31:16,552 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 10:31:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:16,552 INFO L85 PathProgramCache]: Analyzing trace with hash 68725160, now seen corresponding path program 1 times [2022-12-13 10:31:16,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:16,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757602473] [2022-12-13 10:31:16,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:16,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:17,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 10:31:17,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:17,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757602473] [2022-12-13 10:31:17,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757602473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:17,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:17,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:31:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630768563] [2022-12-13 10:31:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:17,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:31:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:17,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:31:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:31:17,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:17,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 84 transitions, 866 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 10:31:17,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:17,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:17,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:17,588 INFO L130 PetriNetUnfolder]: 995/2161 cut-off events. [2022-12-13 10:31:17,588 INFO L131 PetriNetUnfolder]: For 14413/14413 co-relation queries the response was YES. [2022-12-13 10:31:17,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10621 conditions, 2161 events. 995/2161 cut-off events. For 14413/14413 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15021 event pairs, 397 based on Foata normal form. 2/2155 useless extension candidates. Maximal degree in co-relation 10555. Up to 1560 conditions per place. [2022-12-13 10:31:17,597 INFO L137 encePairwiseOnDemand]: 35/51 looper letters, 134 selfloop transitions, 24 changer transitions 14/172 dead transitions. [2022-12-13 10:31:17,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 172 transitions, 1868 flow [2022-12-13 10:31:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:31:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:31:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2022-12-13 10:31:17,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2022-12-13 10:31:17,598 INFO L175 Difference]: Start difference. First operand has 111 places, 84 transitions, 866 flow. Second operand 8 states and 141 transitions. [2022-12-13 10:31:17,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 172 transitions, 1868 flow [2022-12-13 10:31:17,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 172 transitions, 1802 flow, removed 21 selfloop flow, removed 9 redundant places. [2022-12-13 10:31:17,620 INFO L231 Difference]: Finished difference. Result has 114 places, 96 transitions, 1047 flow [2022-12-13 10:31:17,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1047, PETRI_PLACES=114, PETRI_TRANSITIONS=96} [2022-12-13 10:31:17,620 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places. [2022-12-13 10:31:17,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:17,620 INFO L89 Accepts]: Start accepts. Operand has 114 places, 96 transitions, 1047 flow [2022-12-13 10:31:17,621 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:17,621 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:17,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 96 transitions, 1047 flow [2022-12-13 10:31:17,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 96 transitions, 1047 flow [2022-12-13 10:31:17,661 INFO L130 PetriNetUnfolder]: 80/629 cut-off events. [2022-12-13 10:31:17,662 INFO L131 PetriNetUnfolder]: For 3318/3333 co-relation queries the response was YES. [2022-12-13 10:31:17,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2482 conditions, 629 events. 80/629 cut-off events. For 3318/3333 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5710 event pairs, 15 based on Foata normal form. 7/603 useless extension candidates. Maximal degree in co-relation 2231. Up to 71 conditions per place. [2022-12-13 10:31:17,666 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 96 transitions, 1047 flow [2022-12-13 10:31:17,666 INFO L226 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-13 10:31:17,697 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:17,698 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 10:31:17,698 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 96 transitions, 1057 flow [2022-12-13 10:31:17,698 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 10:31:17,698 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:17,698 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 10:31:17,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 10:31:17,698 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 10:31:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:17,698 INFO L85 PathProgramCache]: Analyzing trace with hash 804379217, now seen corresponding path program 1 times [2022-12-13 10:31:17,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:17,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362789806] [2022-12-13 10:31:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:18,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 10:31:18,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:18,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362789806] [2022-12-13 10:31:18,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362789806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:18,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:18,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:18,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212833296] [2022-12-13 10:31:18,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:18,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:18,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:18,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:18,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:18,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:31:18,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 96 transitions, 1057 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 10:31:18,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:18,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:31:18,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:18,639 INFO L130 PetriNetUnfolder]: 985/2151 cut-off events. [2022-12-13 10:31:18,639 INFO L131 PetriNetUnfolder]: For 16174/16174 co-relation queries the response was YES. [2022-12-13 10:31:18,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10883 conditions, 2151 events. 985/2151 cut-off events. For 16174/16174 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14969 event pairs, 433 based on Foata normal form. 2/2145 useless extension candidates. Maximal degree in co-relation 9653. Up to 1255 conditions per place. [2022-12-13 10:31:18,651 INFO L137 encePairwiseOnDemand]: 39/52 looper letters, 143 selfloop transitions, 15 changer transitions 29/187 dead transitions. [2022-12-13 10:31:18,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 187 transitions, 2110 flow [2022-12-13 10:31:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:18,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2022-12-13 10:31:18,652 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31837606837606836 [2022-12-13 10:31:18,652 INFO L175 Difference]: Start difference. First operand has 114 places, 96 transitions, 1057 flow. Second operand 9 states and 149 transitions. [2022-12-13 10:31:18,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 187 transitions, 2110 flow [2022-12-13 10:31:18,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 187 transitions, 2034 flow, removed 27 selfloop flow, removed 4 redundant places. [2022-12-13 10:31:18,679 INFO L231 Difference]: Finished difference. Result has 122 places, 98 transitions, 1040 flow [2022-12-13 10:31:18,679 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=987, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1040, PETRI_PLACES=122, PETRI_TRANSITIONS=98} [2022-12-13 10:31:18,680 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2022-12-13 10:31:18,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:18,680 INFO L89 Accepts]: Start accepts. Operand has 122 places, 98 transitions, 1040 flow [2022-12-13 10:31:18,680 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:18,680 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:18,680 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 98 transitions, 1040 flow [2022-12-13 10:31:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 98 transitions, 1040 flow [2022-12-13 10:31:18,724 INFO L130 PetriNetUnfolder]: 77/620 cut-off events. [2022-12-13 10:31:18,724 INFO L131 PetriNetUnfolder]: For 3232/3251 co-relation queries the response was YES. [2022-12-13 10:31:18,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2436 conditions, 620 events. 77/620 cut-off events. For 3232/3251 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5638 event pairs, 15 based on Foata normal form. 7/594 useless extension candidates. Maximal degree in co-relation 2375. Up to 71 conditions per place. [2022-12-13 10:31:18,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 98 transitions, 1040 flow [2022-12-13 10:31:18,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-13 10:31:18,730 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:18,731 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 10:31:18,731 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 98 transitions, 1040 flow [2022-12-13 10:31:18,731 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 10:31:18,731 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:18,731 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 10:31:18,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-13 10:31:18,731 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 10:31:18,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:18,731 INFO L85 PathProgramCache]: Analyzing trace with hash 38445005, now seen corresponding path program 1 times [2022-12-13 10:31:18,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:18,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571439710] [2022-12-13 10:31:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:18,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:19,480 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 10:31:19,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:19,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571439710] [2022-12-13 10:31:19,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571439710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:19,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:19,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:19,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739227742] [2022-12-13 10:31:19,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:19,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:19,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:19,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:19,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:19,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:19,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 98 transitions, 1040 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 10:31:19,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:19,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:19,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:20,144 INFO L130 PetriNetUnfolder]: 1001/2179 cut-off events. [2022-12-13 10:31:20,144 INFO L131 PetriNetUnfolder]: For 15705/15705 co-relation queries the response was YES. [2022-12-13 10:31:20,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10939 conditions, 2179 events. 1001/2179 cut-off events. For 15705/15705 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15075 event pairs, 370 based on Foata normal form. 2/2173 useless extension candidates. Maximal degree in co-relation 10869. Up to 1255 conditions per place. [2022-12-13 10:31:20,158 INFO L137 encePairwiseOnDemand]: 34/51 looper letters, 142 selfloop transitions, 26 changer transitions 16/184 dead transitions. [2022-12-13 10:31:20,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 184 transitions, 2028 flow [2022-12-13 10:31:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2022-12-13 10:31:20,159 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3159041394335512 [2022-12-13 10:31:20,159 INFO L175 Difference]: Start difference. First operand has 120 places, 98 transitions, 1040 flow. Second operand 9 states and 145 transitions. [2022-12-13 10:31:20,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 184 transitions, 2028 flow [2022-12-13 10:31:20,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 184 transitions, 2006 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 10:31:20,192 INFO L231 Difference]: Finished difference. Result has 127 places, 105 transitions, 1199 flow [2022-12-13 10:31:20,192 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1199, PETRI_PLACES=127, PETRI_TRANSITIONS=105} [2022-12-13 10:31:20,192 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places. [2022-12-13 10:31:20,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:20,193 INFO L89 Accepts]: Start accepts. Operand has 127 places, 105 transitions, 1199 flow [2022-12-13 10:31:20,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:20,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:20,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 105 transitions, 1199 flow [2022-12-13 10:31:20,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 105 transitions, 1199 flow [2022-12-13 10:31:20,238 INFO L130 PetriNetUnfolder]: 75/631 cut-off events. [2022-12-13 10:31:20,239 INFO L131 PetriNetUnfolder]: For 3736/3760 co-relation queries the response was YES. [2022-12-13 10:31:20,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 631 events. 75/631 cut-off events. For 3736/3760 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5737 event pairs, 15 based on Foata normal form. 9/607 useless extension candidates. Maximal degree in co-relation 2396. Up to 71 conditions per place. [2022-12-13 10:31:20,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 105 transitions, 1199 flow [2022-12-13 10:31:20,244 INFO L226 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-13 10:31:20,246 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:20,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 10:31:20,247 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 105 transitions, 1199 flow [2022-12-13 10:31:20,247 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 10:31:20,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:20,248 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 10:31:20,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-13 10:31:20,248 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 10:31:20,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash -978966266, now seen corresponding path program 1 times [2022-12-13 10:31:20,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:20,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881117835] [2022-12-13 10:31:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:20,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:20,717 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 10:31:20,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:20,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881117835] [2022-12-13 10:31:20,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881117835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:20,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:20,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:20,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725706016] [2022-12-13 10:31:20,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:20,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:20,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:20,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:20,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:20,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 105 transitions, 1199 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 10:31:20,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:20,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:20,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:21,288 INFO L130 PetriNetUnfolder]: 1001/2191 cut-off events. [2022-12-13 10:31:21,288 INFO L131 PetriNetUnfolder]: For 18427/18427 co-relation queries the response was YES. [2022-12-13 10:31:21,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11490 conditions, 2191 events. 1001/2191 cut-off events. For 18427/18427 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15209 event pairs, 444 based on Foata normal form. 2/2185 useless extension candidates. Maximal degree in co-relation 10868. Up to 1255 conditions per place. [2022-12-13 10:31:21,305 INFO L137 encePairwiseOnDemand]: 38/51 looper letters, 146 selfloop transitions, 17 changer transitions 42/205 dead transitions. [2022-12-13 10:31:21,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 205 transitions, 2337 flow [2022-12-13 10:31:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 10:31:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 10:31:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2022-12-13 10:31:21,306 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2976827094474153 [2022-12-13 10:31:21,306 INFO L175 Difference]: Start difference. First operand has 127 places, 105 transitions, 1199 flow. Second operand 11 states and 167 transitions. [2022-12-13 10:31:21,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 205 transitions, 2337 flow [2022-12-13 10:31:21,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 205 transitions, 2261 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-13 10:31:21,346 INFO L231 Difference]: Finished difference. Result has 137 places, 105 transitions, 1180 flow [2022-12-13 10:31:21,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1180, PETRI_PLACES=137, PETRI_TRANSITIONS=105} [2022-12-13 10:31:21,347 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 96 predicate places. [2022-12-13 10:31:21,347 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:21,347 INFO L89 Accepts]: Start accepts. Operand has 137 places, 105 transitions, 1180 flow [2022-12-13 10:31:21,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:21,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:21,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 105 transitions, 1180 flow [2022-12-13 10:31:21,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 105 transitions, 1180 flow [2022-12-13 10:31:21,392 INFO L130 PetriNetUnfolder]: 71/596 cut-off events. [2022-12-13 10:31:21,393 INFO L131 PetriNetUnfolder]: For 3755/3801 co-relation queries the response was YES. [2022-12-13 10:31:21,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2476 conditions, 596 events. 71/596 cut-off events. For 3755/3801 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5325 event pairs, 14 based on Foata normal form. 10/577 useless extension candidates. Maximal degree in co-relation 2410. Up to 69 conditions per place. [2022-12-13 10:31:21,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 105 transitions, 1180 flow [2022-12-13 10:31:21,398 INFO L226 LiptonReduction]: Number of co-enabled transitions 640 [2022-12-13 10:31:21,398 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:21,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 10:31:21,399 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 105 transitions, 1180 flow [2022-12-13 10:31:21,399 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 10:31:21,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:21,399 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 10:31:21,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-13 10:31:21,400 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 10:31:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash 615598708, now seen corresponding path program 2 times [2022-12-13 10:31:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:21,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097123309] [2022-12-13 10:31:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:21,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:21,890 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 10:31:21,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:21,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097123309] [2022-12-13 10:31:21,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097123309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:21,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:21,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:21,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178014058] [2022-12-13 10:31:21,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:21,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:21,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:21,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:21,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:21,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 105 transitions, 1180 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 10:31:21,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:21,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:21,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:22,494 INFO L130 PetriNetUnfolder]: 962/2105 cut-off events. [2022-12-13 10:31:22,494 INFO L131 PetriNetUnfolder]: For 16716/16716 co-relation queries the response was YES. [2022-12-13 10:31:22,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10913 conditions, 2105 events. 962/2105 cut-off events. For 16716/16716 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14540 event pairs, 450 based on Foata normal form. 2/2099 useless extension candidates. Maximal degree in co-relation 10838. Up to 1255 conditions per place. [2022-12-13 10:31:22,507 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 133 selfloop transitions, 14 changer transitions 41/188 dead transitions. [2022-12-13 10:31:22,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 188 transitions, 2127 flow [2022-12-13 10:31:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2022-12-13 10:31:22,508 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3311546840958606 [2022-12-13 10:31:22,508 INFO L175 Difference]: Start difference. First operand has 135 places, 105 transitions, 1180 flow. Second operand 9 states and 152 transitions. [2022-12-13 10:31:22,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 188 transitions, 2127 flow [2022-12-13 10:31:22,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 188 transitions, 2086 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-13 10:31:22,541 INFO L231 Difference]: Finished difference. Result has 137 places, 101 transitions, 1140 flow [2022-12-13 10:31:22,541 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1140, PETRI_PLACES=137, PETRI_TRANSITIONS=101} [2022-12-13 10:31:22,541 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 96 predicate places. [2022-12-13 10:31:22,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:22,542 INFO L89 Accepts]: Start accepts. Operand has 137 places, 101 transitions, 1140 flow [2022-12-13 10:31:22,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:22,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:22,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 101 transitions, 1140 flow [2022-12-13 10:31:22,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 101 transitions, 1140 flow [2022-12-13 10:31:22,583 INFO L130 PetriNetUnfolder]: 65/560 cut-off events. [2022-12-13 10:31:22,583 INFO L131 PetriNetUnfolder]: For 3557/3580 co-relation queries the response was YES. [2022-12-13 10:31:22,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2342 conditions, 560 events. 65/560 cut-off events. For 3557/3580 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4946 event pairs, 12 based on Foata normal form. 10/539 useless extension candidates. Maximal degree in co-relation 2211. Up to 59 conditions per place. [2022-12-13 10:31:22,588 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 101 transitions, 1140 flow [2022-12-13 10:31:22,588 INFO L226 LiptonReduction]: Number of co-enabled transitions 612 [2022-12-13 10:31:22,591 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:22,592 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 10:31:22,592 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 101 transitions, 1140 flow [2022-12-13 10:31:22,592 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 10:31:22,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:22,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, 1, 1] [2022-12-13 10:31:22,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-13 10:31:22,593 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 10:31:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash -819708176, now seen corresponding path program 3 times [2022-12-13 10:31:22,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:22,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224500300] [2022-12-13 10:31:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:22,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:23,075 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 10:31:23,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:23,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224500300] [2022-12-13 10:31:23,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224500300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:23,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:23,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:31:23,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518631736] [2022-12-13 10:31:23,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:23,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:31:23,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:23,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:31:23,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:31:23,076 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:23,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 101 transitions, 1140 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 10:31:23,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:23,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:23,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:23,592 INFO L130 PetriNetUnfolder]: 909/1978 cut-off events. [2022-12-13 10:31:23,593 INFO L131 PetriNetUnfolder]: For 16365/16365 co-relation queries the response was YES. [2022-12-13 10:31:23,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10327 conditions, 1978 events. 909/1978 cut-off events. For 16365/16365 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13303 event pairs, 445 based on Foata normal form. 2/1972 useless extension candidates. Maximal degree in co-relation 9590. Up to 1255 conditions per place. [2022-12-13 10:31:23,605 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 112 selfloop transitions, 11 changer transitions 52/175 dead transitions. [2022-12-13 10:31:23,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 175 transitions, 2004 flow [2022-12-13 10:31:23,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:31:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:31:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2022-12-13 10:31:23,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27450980392156865 [2022-12-13 10:31:23,606 INFO L175 Difference]: Start difference. First operand has 136 places, 101 transitions, 1140 flow. Second operand 10 states and 140 transitions. [2022-12-13 10:31:23,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 175 transitions, 2004 flow [2022-12-13 10:31:23,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 175 transitions, 1954 flow, removed 5 selfloop flow, removed 11 redundant places. [2022-12-13 10:31:23,638 INFO L231 Difference]: Finished difference. Result has 136 places, 97 transitions, 1073 flow [2022-12-13 10:31:23,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1073, PETRI_PLACES=136, PETRI_TRANSITIONS=97} [2022-12-13 10:31:23,639 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 95 predicate places. [2022-12-13 10:31:23,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:23,639 INFO L89 Accepts]: Start accepts. Operand has 136 places, 97 transitions, 1073 flow [2022-12-13 10:31:23,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:23,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:23,640 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 97 transitions, 1073 flow [2022-12-13 10:31:23,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 97 transitions, 1073 flow [2022-12-13 10:31:23,678 INFO L130 PetriNetUnfolder]: 61/526 cut-off events. [2022-12-13 10:31:23,678 INFO L131 PetriNetUnfolder]: For 3255/3277 co-relation queries the response was YES. [2022-12-13 10:31:23,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 526 events. 61/526 cut-off events. For 3255/3277 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4546 event pairs, 11 based on Foata normal form. 9/505 useless extension candidates. Maximal degree in co-relation 2118. Up to 55 conditions per place. [2022-12-13 10:31:23,683 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 97 transitions, 1073 flow [2022-12-13 10:31:23,683 INFO L226 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-13 10:31:23,686 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:23,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 10:31:23,687 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 1073 flow [2022-12-13 10:31:23,687 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 10:31:23,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:23,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] [2022-12-13 10:31:23,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-13 10:31:23,687 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 10:31:23,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1728822299, now seen corresponding path program 1 times [2022-12-13 10:31:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:23,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356832599] [2022-12-13 10:31:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:24,830 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 10:31:24,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:24,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356832599] [2022-12-13 10:31:24,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356832599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:24,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:24,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:31:24,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036790196] [2022-12-13 10:31:24,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:24,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:31:24,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:24,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:31:24,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:31:24,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:24,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 1073 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 10:31:24,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:24,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:24,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:25,423 INFO L130 PetriNetUnfolder]: 864/1878 cut-off events. [2022-12-13 10:31:25,423 INFO L131 PetriNetUnfolder]: For 15277/15277 co-relation queries the response was YES. [2022-12-13 10:31:25,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9698 conditions, 1878 events. 864/1878 cut-off events. For 15277/15277 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12614 event pairs, 373 based on Foata normal form. 1/1871 useless extension candidates. Maximal degree in co-relation 9627. Up to 1471 conditions per place. [2022-12-13 10:31:25,433 INFO L137 encePairwiseOnDemand]: 40/51 looper letters, 122 selfloop transitions, 16 changer transitions 24/162 dead transitions. [2022-12-13 10:31:25,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 162 transitions, 1851 flow [2022-12-13 10:31:25,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:31:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:31:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-12-13 10:31:25,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.32107843137254904 [2022-12-13 10:31:25,434 INFO L175 Difference]: Start difference. First operand has 129 places, 97 transitions, 1073 flow. Second operand 8 states and 131 transitions. [2022-12-13 10:31:25,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 162 transitions, 1851 flow [2022-12-13 10:31:25,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 162 transitions, 1814 flow, removed 5 selfloop flow, removed 9 redundant places. [2022-12-13 10:31:25,461 INFO L231 Difference]: Finished difference. Result has 130 places, 100 transitions, 1122 flow [2022-12-13 10:31:25,461 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1122, PETRI_PLACES=130, PETRI_TRANSITIONS=100} [2022-12-13 10:31:25,461 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 89 predicate places. [2022-12-13 10:31:25,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:25,461 INFO L89 Accepts]: Start accepts. Operand has 130 places, 100 transitions, 1122 flow [2022-12-13 10:31:25,462 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:25,462 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:25,462 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 100 transitions, 1122 flow [2022-12-13 10:31:25,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 100 transitions, 1122 flow [2022-12-13 10:31:25,500 INFO L130 PetriNetUnfolder]: 60/525 cut-off events. [2022-12-13 10:31:25,500 INFO L131 PetriNetUnfolder]: For 3412/3432 co-relation queries the response was YES. [2022-12-13 10:31:25,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2214 conditions, 525 events. 60/525 cut-off events. For 3412/3432 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4597 event pairs, 11 based on Foata normal form. 9/504 useless extension candidates. Maximal degree in co-relation 2062. Up to 55 conditions per place. [2022-12-13 10:31:25,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 100 transitions, 1122 flow [2022-12-13 10:31:25,504 INFO L226 LiptonReduction]: Number of co-enabled transitions 592 [2022-12-13 10:31:25,505 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:25,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 10:31:25,506 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 100 transitions, 1122 flow [2022-12-13 10:31:25,506 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 10:31:25,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:25,506 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 10:31:25,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-13 10:31:25,506 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 10:31:25,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:25,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1414840254, now seen corresponding path program 1 times [2022-12-13 10:31:25,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:25,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149267246] [2022-12-13 10:31:25,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:25,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:26,105 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 10:31:26,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:26,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149267246] [2022-12-13 10:31:26,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149267246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:26,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:26,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:26,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110079247] [2022-12-13 10:31:26,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:26,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:26,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:26,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:26,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:26,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:26,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 100 transitions, 1122 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 10:31:26,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:26,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:26,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:26,638 INFO L130 PetriNetUnfolder]: 882/1931 cut-off events. [2022-12-13 10:31:26,638 INFO L131 PetriNetUnfolder]: For 16668/16668 co-relation queries the response was YES. [2022-12-13 10:31:26,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10105 conditions, 1931 events. 882/1931 cut-off events. For 16668/16668 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13082 event pairs, 419 based on Foata normal form. 2/1925 useless extension candidates. Maximal degree in co-relation 9353. Up to 1255 conditions per place. [2022-12-13 10:31:26,650 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 106 selfloop transitions, 9 changer transitions 53/168 dead transitions. [2022-12-13 10:31:26,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 168 transitions, 1902 flow [2022-12-13 10:31:26,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2022-12-13 10:31:26,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2984749455337691 [2022-12-13 10:31:26,651 INFO L175 Difference]: Start difference. First operand has 130 places, 100 transitions, 1122 flow. Second operand 9 states and 137 transitions. [2022-12-13 10:31:26,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 168 transitions, 1902 flow [2022-12-13 10:31:26,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 168 transitions, 1849 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-12-13 10:31:26,681 INFO L231 Difference]: Finished difference. Result has 134 places, 91 transitions, 948 flow [2022-12-13 10:31:26,681 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=948, PETRI_PLACES=134, PETRI_TRANSITIONS=91} [2022-12-13 10:31:26,681 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 93 predicate places. [2022-12-13 10:31:26,681 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:26,682 INFO L89 Accepts]: Start accepts. Operand has 134 places, 91 transitions, 948 flow [2022-12-13 10:31:26,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:26,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:26,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 91 transitions, 948 flow [2022-12-13 10:31:26,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 91 transitions, 948 flow [2022-12-13 10:31:26,714 INFO L130 PetriNetUnfolder]: 53/449 cut-off events. [2022-12-13 10:31:26,714 INFO L131 PetriNetUnfolder]: For 2257/2281 co-relation queries the response was YES. [2022-12-13 10:31:26,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 449 events. 53/449 cut-off events. For 2257/2281 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3693 event pairs, 9 based on Foata normal form. 8/436 useless extension candidates. Maximal degree in co-relation 1715. Up to 46 conditions per place. [2022-12-13 10:31:26,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 91 transitions, 948 flow [2022-12-13 10:31:26,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-13 10:31:26,794 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_~e2~0_137 1) (= v_~n1~0_178 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_20| 0) (= v_~n1~0_179 v_~tmp2~0_98) (= |v_thread1Thread1of1ForFork1_#res#1.base_20| 0)) InVars {~n1~0=v_~n1~0_179} OutVars{~n1~0=v_~n1~0_178, 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_98, ~e2~0=v_~e2~0_137} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~tmp2~0, ~e2~0] [2022-12-13 10:31:26,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [846] L59-->L154-3: Formula: (and (= |v_#pthreadsForks_175| |v_ULTIMATE.start_main_#t~pre15#1_111|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_424| (ite (or (<= v_~n1~0_852 v_~n2~0_980) (= v_~n2~0_980 0)) 1 0)) (= (select (select |v_#memory_int_681| v_~f~0.base_573) (+ v_~f~0.offset_569 (* v_~i1~0_402 4))) v_~i~0_1047) (= (store |v_#memory_int_681| |v_ULTIMATE.start_main_~#t2~0#1.base_97| (store (select |v_#memory_int_681| |v_ULTIMATE.start_main_~#t2~0#1.base_97|) |v_ULTIMATE.start_main_~#t2~0#1.offset_63| |v_ULTIMATE.start_main_#t~pre15#1_111|)) |v_#memory_int_680|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_424| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_424|) (= v_~i1~0_402 v_~i~0_1048) (not (= (ite (= (mod v_~e2~0_633 256) 0) 1 0) 0)) (= (+ |v_#pthreadsForks_175| 1) |v_#pthreadsForks_174|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_424| 0))) InVars {#pthreadsForks=|v_#pthreadsForks_175|, ~n2~0=v_~n2~0_980, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_63|, ~i~0=v_~i~0_1048, ~f~0.base=v_~f~0.base_573, ~n1~0=v_~n1~0_852, #memory_int=|v_#memory_int_681|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_97|, ~f~0.offset=v_~f~0.offset_569, ~e2~0=v_~e2~0_633} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_73|, ~n2~0=v_~n2~0_980, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_63|, ~i~0=v_~i~0_1047, ~f~0.base=v_~f~0.base_573, ~n1~0=v_~n1~0_852, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_111|, ~i1~0=v_~i1~0_402, ~f~0.offset=v_~f~0.offset_569, ~e2~0=v_~e2~0_633, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_55|, #pthreadsForks=|v_#pthreadsForks_174|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_424|, #memory_int=|v_#memory_int_680|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_269|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_97|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_424|} 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 [850] L71-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_448| 0)) (= v_~n1~0_882 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_71| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_448| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_448|) (= |v_thread1Thread1of1ForFork1_#res#1.offset_71| 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_448| (ite (and (<= 0 v_~i~0_1103) (< v_~i~0_1103 v_~n~0_382)) 1 0))) InVars {~i~0=v_~i~0_1103, ~n~0=v_~n~0_382} OutVars{~i~0=v_~i~0_1103, ~n1~0=v_~n1~0_882, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_448|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_71|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_71|, ~n~0=v_~n~0_382, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_448|} 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 10:31:26,948 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [846] L59-->L154-3: Formula: (and (= |v_#pthreadsForks_175| |v_ULTIMATE.start_main_#t~pre15#1_111|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_424| (ite (or (<= v_~n1~0_852 v_~n2~0_980) (= v_~n2~0_980 0)) 1 0)) (= (select (select |v_#memory_int_681| v_~f~0.base_573) (+ v_~f~0.offset_569 (* v_~i1~0_402 4))) v_~i~0_1047) (= (store |v_#memory_int_681| |v_ULTIMATE.start_main_~#t2~0#1.base_97| (store (select |v_#memory_int_681| |v_ULTIMATE.start_main_~#t2~0#1.base_97|) |v_ULTIMATE.start_main_~#t2~0#1.offset_63| |v_ULTIMATE.start_main_#t~pre15#1_111|)) |v_#memory_int_680|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_424| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_424|) (= v_~i1~0_402 v_~i~0_1048) (not (= (ite (= (mod v_~e2~0_633 256) 0) 1 0) 0)) (= (+ |v_#pthreadsForks_175| 1) |v_#pthreadsForks_174|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_424| 0))) InVars {#pthreadsForks=|v_#pthreadsForks_175|, ~n2~0=v_~n2~0_980, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_63|, ~i~0=v_~i~0_1048, ~f~0.base=v_~f~0.base_573, ~n1~0=v_~n1~0_852, #memory_int=|v_#memory_int_681|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_97|, ~f~0.offset=v_~f~0.offset_569, ~e2~0=v_~e2~0_633} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_73|, ~n2~0=v_~n2~0_980, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_63|, ~i~0=v_~i~0_1047, ~f~0.base=v_~f~0.base_573, ~n1~0=v_~n1~0_852, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_111|, ~i1~0=v_~i1~0_402, ~f~0.offset=v_~f~0.offset_569, ~e2~0=v_~e2~0_633, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_55|, #pthreadsForks=|v_#pthreadsForks_174|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_424|, #memory_int=|v_#memory_int_680|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_269|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_97|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_424|} 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 [851] L71-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_450| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_450|) (= v_~n1~0_884 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_450| (ite (and (<= 0 v_~i~0_1105) (< v_~i~0_1105 v_~n~0_384)) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_73| 0) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_450| 0)) (= |v_thread1Thread1of1ForFork1_#res#1.base_73| 0)) InVars {~i~0=v_~i~0_1105, ~n~0=v_~n~0_384} OutVars{~i~0=v_~i~0_1105, ~n1~0=v_~n1~0_884, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_450|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_73|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_73|, ~n~0=v_~n~0_384, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_450|} 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 10:31:27,041 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [846] L59-->L154-3: Formula: (and (= |v_#pthreadsForks_175| |v_ULTIMATE.start_main_#t~pre15#1_111|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_424| (ite (or (<= v_~n1~0_852 v_~n2~0_980) (= v_~n2~0_980 0)) 1 0)) (= (select (select |v_#memory_int_681| v_~f~0.base_573) (+ v_~f~0.offset_569 (* v_~i1~0_402 4))) v_~i~0_1047) (= (store |v_#memory_int_681| |v_ULTIMATE.start_main_~#t2~0#1.base_97| (store (select |v_#memory_int_681| |v_ULTIMATE.start_main_~#t2~0#1.base_97|) |v_ULTIMATE.start_main_~#t2~0#1.offset_63| |v_ULTIMATE.start_main_#t~pre15#1_111|)) |v_#memory_int_680|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_424| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_424|) (= v_~i1~0_402 v_~i~0_1048) (not (= (ite (= (mod v_~e2~0_633 256) 0) 1 0) 0)) (= (+ |v_#pthreadsForks_175| 1) |v_#pthreadsForks_174|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_424| 0))) InVars {#pthreadsForks=|v_#pthreadsForks_175|, ~n2~0=v_~n2~0_980, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_63|, ~i~0=v_~i~0_1048, ~f~0.base=v_~f~0.base_573, ~n1~0=v_~n1~0_852, #memory_int=|v_#memory_int_681|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_97|, ~f~0.offset=v_~f~0.offset_569, ~e2~0=v_~e2~0_633} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_73|, ~n2~0=v_~n2~0_980, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_63|, ~i~0=v_~i~0_1047, ~f~0.base=v_~f~0.base_573, ~n1~0=v_~n1~0_852, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_111|, ~i1~0=v_~i1~0_402, ~f~0.offset=v_~f~0.offset_569, ~e2~0=v_~e2~0_633, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_55|, #pthreadsForks=|v_#pthreadsForks_174|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_424|, #memory_int=|v_#memory_int_680|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_269|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_97|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_424|} 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 [852] L71-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_75| 0) (= v_~tmp2~0_444 v_~n1~0_887) (= |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_thread1Thread1of1ForFork1_#res#1.base_75| 0) (= v_~n1~0_886 0) (= v_~e2~0_661 1) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_452| (ite (and (< v_~i~0_1107 v_~n~0_386) (<= 0 v_~i~0_1107)) 1 0))) InVars {~i~0=v_~i~0_1107, ~n1~0=v_~n1~0_887, ~n~0=v_~n~0_386} OutVars{~i~0=v_~i~0_1107, ~n1~0=v_~n1~0_886, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_452|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_75|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_75|, ~tmp2~0=v_~tmp2~0_444, ~n~0=v_~n~0_386, ~e2~0=v_~e2~0_661, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_452|} 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 10:31:27,145 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:31:27,146 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 465 [2022-12-13 10:31:27,146 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 91 transitions, 1023 flow [2022-12-13 10:31:27,146 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 10:31:27,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:27,146 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 10:31:27,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-13 10:31:27,146 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 10:31:27,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash 761625960, now seen corresponding path program 1 times [2022-12-13 10:31:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:27,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400282605] [2022-12-13 10:31:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:27,701 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 10:31:27,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:27,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400282605] [2022-12-13 10:31:27,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400282605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:27,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:27,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:27,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374292973] [2022-12-13 10:31:27,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:27,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:27,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:27,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:27,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:27,702 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:31:27,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 91 transitions, 1023 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 10:31:27,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:27,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:31:27,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:28,186 INFO L130 PetriNetUnfolder]: 693/1515 cut-off events. [2022-12-13 10:31:28,186 INFO L131 PetriNetUnfolder]: For 11088/11088 co-relation queries the response was YES. [2022-12-13 10:31:28,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7680 conditions, 1515 events. 693/1515 cut-off events. For 11088/11088 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9621 event pairs, 326 based on Foata normal form. 1/1508 useless extension candidates. Maximal degree in co-relation 7612. Up to 1255 conditions per place. [2022-12-13 10:31:28,195 INFO L137 encePairwiseOnDemand]: 41/52 looper letters, 93 selfloop transitions, 12 changer transitions 41/146 dead transitions. [2022-12-13 10:31:28,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 146 transitions, 1546 flow [2022-12-13 10:31:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2022-12-13 10:31:28,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25854700854700857 [2022-12-13 10:31:28,196 INFO L175 Difference]: Start difference. First operand has 124 places, 91 transitions, 1023 flow. Second operand 9 states and 121 transitions. [2022-12-13 10:31:28,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 146 transitions, 1546 flow [2022-12-13 10:31:28,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 146 transitions, 1484 flow, removed 21 selfloop flow, removed 11 redundant places. [2022-12-13 10:31:28,220 INFO L231 Difference]: Finished difference. Result has 122 places, 83 transitions, 843 flow [2022-12-13 10:31:28,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=113, 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=843, PETRI_PLACES=122, PETRI_TRANSITIONS=83} [2022-12-13 10:31:28,220 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2022-12-13 10:31:28,220 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:28,220 INFO L89 Accepts]: Start accepts. Operand has 122 places, 83 transitions, 843 flow [2022-12-13 10:31:28,221 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:28,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:28,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 83 transitions, 843 flow [2022-12-13 10:31:28,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 83 transitions, 843 flow [2022-12-13 10:31:28,249 INFO L130 PetriNetUnfolder]: 47/404 cut-off events. [2022-12-13 10:31:28,249 INFO L131 PetriNetUnfolder]: For 1910/1933 co-relation queries the response was YES. [2022-12-13 10:31:28,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 404 events. 47/404 cut-off events. For 1910/1933 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3177 event pairs, 7 based on Foata normal form. 7/395 useless extension candidates. Maximal degree in co-relation 1535. Up to 45 conditions per place. [2022-12-13 10:31:28,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 83 transitions, 843 flow [2022-12-13 10:31:28,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 450 [2022-12-13 10:31:28,254 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 10:31:33,376 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:31:33,377 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5157 [2022-12-13 10:31:33,377 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 81 transitions, 853 flow [2022-12-13 10:31:33,377 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 10:31:33,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:33,377 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 10:31:33,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-13 10:31:33,378 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 10:31:33,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1881315308, now seen corresponding path program 1 times [2022-12-13 10:31:33,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:33,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981050952] [2022-12-13 10:31:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:33,891 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 10:31:33,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:33,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981050952] [2022-12-13 10:31:33,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981050952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:33,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:33,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:31:33,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826779878] [2022-12-13 10:31:33,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:33,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:31:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:31:33,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:31:33,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-13 10:31:33,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 81 transitions, 853 flow. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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 10:31:33,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:33,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-13 10:31:33,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:34,165 INFO L130 PetriNetUnfolder]: 648/1410 cut-off events. [2022-12-13 10:31:34,165 INFO L131 PetriNetUnfolder]: For 9504/9504 co-relation queries the response was YES. [2022-12-13 10:31:34,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7066 conditions, 1410 events. 648/1410 cut-off events. For 9504/9504 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8808 event pairs, 303 based on Foata normal form. 1/1402 useless extension candidates. Maximal degree in co-relation 7007. Up to 1256 conditions per place. [2022-12-13 10:31:34,173 INFO L137 encePairwiseOnDemand]: 44/52 looper letters, 79 selfloop transitions, 5 changer transitions 33/117 dead transitions. [2022-12-13 10:31:34,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 1332 flow [2022-12-13 10:31:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:31:34,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:31:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-13 10:31:34,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2980769230769231 [2022-12-13 10:31:34,173 INFO L175 Difference]: Start difference. First operand has 116 places, 81 transitions, 853 flow. Second operand 6 states and 93 transitions. [2022-12-13 10:31:34,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 1332 flow [2022-12-13 10:31:34,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 117 transitions, 1276 flow, removed 19 selfloop flow, removed 8 redundant places. [2022-12-13 10:31:34,191 INFO L231 Difference]: Finished difference. Result has 115 places, 77 transitions, 735 flow [2022-12-13 10:31:34,191 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=735, PETRI_PLACES=115, PETRI_TRANSITIONS=77} [2022-12-13 10:31:34,191 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2022-12-13 10:31:34,191 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:34,191 INFO L89 Accepts]: Start accepts. Operand has 115 places, 77 transitions, 735 flow [2022-12-13 10:31:34,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:34,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:34,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 77 transitions, 735 flow [2022-12-13 10:31:34,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 77 transitions, 735 flow [2022-12-13 10:31:34,216 INFO L130 PetriNetUnfolder]: 47/370 cut-off events. [2022-12-13 10:31:34,216 INFO L131 PetriNetUnfolder]: For 1552/1569 co-relation queries the response was YES. [2022-12-13 10:31:34,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 370 events. 47/370 cut-off events. For 1552/1569 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2922 event pairs, 7 based on Foata normal form. 5/361 useless extension candidates. Maximal degree in co-relation 1393. Up to 43 conditions per place. [2022-12-13 10:31:34,219 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 77 transitions, 735 flow [2022-12-13 10:31:34,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-13 10:31:34,219 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:34,220 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 10:31:34,220 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 77 transitions, 735 flow [2022-12-13 10:31:34,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 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 10:31:34,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:34,220 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 10:31:34,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-13 10:31:34,221 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 10:31:34,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash -502821580, now seen corresponding path program 1 times [2022-12-13 10:31:34,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:34,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115061784] [2022-12-13 10:31:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:34,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 10:31:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:34,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115061784] [2022-12-13 10:31:34,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115061784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:34,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:34,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:34,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928991528] [2022-12-13 10:31:34,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:34,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:34,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:34,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:34,809 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 10:31:34,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 77 transitions, 735 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 10:31:34,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:34,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 10:31:34,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:35,362 INFO L130 PetriNetUnfolder]: 1257/2729 cut-off events. [2022-12-13 10:31:35,362 INFO L131 PetriNetUnfolder]: For 16881/16881 co-relation queries the response was YES. [2022-12-13 10:31:35,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13389 conditions, 2729 events. 1257/2729 cut-off events. For 16881/16881 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20025 event pairs, 476 based on Foata normal form. 4/2725 useless extension candidates. Maximal degree in co-relation 12524. Up to 1255 conditions per place. [2022-12-13 10:31:35,378 INFO L137 encePairwiseOnDemand]: 36/48 looper letters, 142 selfloop transitions, 13 changer transitions 53/208 dead transitions. [2022-12-13 10:31:35,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 208 transitions, 2240 flow [2022-12-13 10:31:35,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:35,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2022-12-13 10:31:35,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38425925925925924 [2022-12-13 10:31:35,379 INFO L175 Difference]: Start difference. First operand has 107 places, 77 transitions, 735 flow. Second operand 9 states and 166 transitions. [2022-12-13 10:31:35,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 208 transitions, 2240 flow [2022-12-13 10:31:35,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 208 transitions, 2134 flow, removed 23 selfloop flow, removed 12 redundant places. [2022-12-13 10:31:35,414 INFO L231 Difference]: Finished difference. Result has 108 places, 84 transitions, 818 flow [2022-12-13 10:31:35,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=818, PETRI_PLACES=108, PETRI_TRANSITIONS=84} [2022-12-13 10:31:35,414 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 67 predicate places. [2022-12-13 10:31:35,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:35,414 INFO L89 Accepts]: Start accepts. Operand has 108 places, 84 transitions, 818 flow [2022-12-13 10:31:35,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:35,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:35,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 84 transitions, 818 flow [2022-12-13 10:31:35,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 84 transitions, 818 flow [2022-12-13 10:31:35,455 INFO L130 PetriNetUnfolder]: 75/643 cut-off events. [2022-12-13 10:31:35,455 INFO L131 PetriNetUnfolder]: For 2470/2482 co-relation queries the response was YES. [2022-12-13 10:31:35,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 643 events. 75/643 cut-off events. For 2470/2482 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6005 event pairs, 16 based on Foata normal form. 8/621 useless extension candidates. Maximal degree in co-relation 2271. Up to 85 conditions per place. [2022-12-13 10:31:35,459 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 84 transitions, 818 flow [2022-12-13 10:31:35,459 INFO L226 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-13 10:31:35,461 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:35,462 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 10:31:35,462 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 84 transitions, 818 flow [2022-12-13 10:31:35,462 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 10:31:35,462 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:35,463 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 10:31:35,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-13 10:31:35,463 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 10:31:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:35,463 INFO L85 PathProgramCache]: Analyzing trace with hash -284132824, now seen corresponding path program 1 times [2022-12-13 10:31:35,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:35,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835935135] [2022-12-13 10:31:35,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:35,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:36,072 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 10:31:36,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:36,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835935135] [2022-12-13 10:31:36,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835935135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:36,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:36,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:36,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95659400] [2022-12-13 10:31:36,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:36,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:36,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:36,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:36,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:36,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 10:31:36,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 84 transitions, 818 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 10:31:36,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:36,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 10:31:36,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:36,642 INFO L130 PetriNetUnfolder]: 1031/2283 cut-off events. [2022-12-13 10:31:36,642 INFO L131 PetriNetUnfolder]: For 13070/13070 co-relation queries the response was YES. [2022-12-13 10:31:36,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10742 conditions, 2283 events. 1031/2283 cut-off events. For 13070/13070 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16334 event pairs, 454 based on Foata normal form. 4/2279 useless extension candidates. Maximal degree in co-relation 10679. Up to 1255 conditions per place. [2022-12-13 10:31:36,655 INFO L137 encePairwiseOnDemand]: 32/48 looper letters, 127 selfloop transitions, 12 changer transitions 47/186 dead transitions. [2022-12-13 10:31:36,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 186 transitions, 1957 flow [2022-12-13 10:31:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:31:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:31:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2022-12-13 10:31:36,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2022-12-13 10:31:36,655 INFO L175 Difference]: Start difference. First operand has 105 places, 84 transitions, 818 flow. Second operand 10 states and 152 transitions. [2022-12-13 10:31:36,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 186 transitions, 1957 flow [2022-12-13 10:31:36,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 186 transitions, 1943 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 10:31:36,684 INFO L231 Difference]: Finished difference. Result has 116 places, 84 transitions, 848 flow [2022-12-13 10:31:36,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=848, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2022-12-13 10:31:36,684 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 75 predicate places. [2022-12-13 10:31:36,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:36,684 INFO L89 Accepts]: Start accepts. Operand has 116 places, 84 transitions, 848 flow [2022-12-13 10:31:36,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:36,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:36,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 84 transitions, 848 flow [2022-12-13 10:31:36,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 84 transitions, 848 flow [2022-12-13 10:31:36,724 INFO L130 PetriNetUnfolder]: 71/601 cut-off events. [2022-12-13 10:31:36,724 INFO L131 PetriNetUnfolder]: For 2646/2653 co-relation queries the response was YES. [2022-12-13 10:31:36,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2289 conditions, 601 events. 71/601 cut-off events. For 2646/2653 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5445 event pairs, 16 based on Foata normal form. 5/575 useless extension candidates. Maximal degree in co-relation 2240. Up to 78 conditions per place. [2022-12-13 10:31:36,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 84 transitions, 848 flow [2022-12-13 10:31:36,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 466 [2022-12-13 10:31:36,732 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 10:31:36,770 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:36,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 87 [2022-12-13 10:31:36,771 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 83 transitions, 844 flow [2022-12-13 10:31:36,771 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 10:31:36,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:36,771 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 10:31:36,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-13 10:31:36,771 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 10:31:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1469617128, now seen corresponding path program 1 times [2022-12-13 10:31:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:36,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419943630] [2022-12-13 10:31:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:37,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 10:31:37,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:37,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419943630] [2022-12-13 10:31:37,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419943630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:37,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:37,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:31:37,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863755063] [2022-12-13 10:31:37,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:37,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:31:37,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:37,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:31:37,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:31:37,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:31:37,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 83 transitions, 844 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 10:31:37,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:37,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:31:37,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:38,166 INFO L130 PetriNetUnfolder]: 960/2122 cut-off events. [2022-12-13 10:31:38,166 INFO L131 PetriNetUnfolder]: For 13034/13034 co-relation queries the response was YES. [2022-12-13 10:31:38,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10285 conditions, 2122 events. 960/2122 cut-off events. For 13034/13034 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14782 event pairs, 411 based on Foata normal form. 2/2116 useless extension candidates. Maximal degree in co-relation 10219. Up to 1255 conditions per place. [2022-12-13 10:31:38,177 INFO L137 encePairwiseOnDemand]: 30/49 looper letters, 123 selfloop transitions, 21 changer transitions 63/207 dead transitions. [2022-12-13 10:31:38,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 207 transitions, 2165 flow [2022-12-13 10:31:38,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 10:31:38,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 10:31:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2022-12-13 10:31:38,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2778649921507064 [2022-12-13 10:31:38,178 INFO L175 Difference]: Start difference. First operand has 111 places, 83 transitions, 844 flow. Second operand 13 states and 177 transitions. [2022-12-13 10:31:38,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 207 transitions, 2165 flow [2022-12-13 10:31:38,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 207 transitions, 2087 flow, removed 28 selfloop flow, removed 9 redundant places. [2022-12-13 10:31:38,204 INFO L231 Difference]: Finished difference. Result has 122 places, 92 transitions, 963 flow [2022-12-13 10:31:38,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=963, PETRI_PLACES=122, PETRI_TRANSITIONS=92} [2022-12-13 10:31:38,204 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2022-12-13 10:31:38,204 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:38,204 INFO L89 Accepts]: Start accepts. Operand has 122 places, 92 transitions, 963 flow [2022-12-13 10:31:38,205 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:38,205 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:38,205 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 92 transitions, 963 flow [2022-12-13 10:31:38,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 92 transitions, 963 flow [2022-12-13 10:31:38,248 INFO L130 PetriNetUnfolder]: 76/599 cut-off events. [2022-12-13 10:31:38,248 INFO L131 PetriNetUnfolder]: For 2777/2787 co-relation queries the response was YES. [2022-12-13 10:31:38,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 599 events. 76/599 cut-off events. For 2777/2787 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5254 event pairs, 23 based on Foata normal form. 7/577 useless extension candidates. Maximal degree in co-relation 2329. Up to 79 conditions per place. [2022-12-13 10:31:38,253 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 92 transitions, 963 flow [2022-12-13 10:31:38,253 INFO L226 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-13 10:31:38,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [753] L59-->L71: Formula: (and (not (= 0 (ite (= (mod v_~e2~0_341 256) 0) 1 0))) (= (select (select |v_#memory_int_368| v_~f~0.base_288) (+ v_~f~0.offset_286 (* v_~i1~0_225 4))) v_~i~0_483) (= v_~i1~0_225 v_~i~0_484) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235| (ite (or (<= v_~n1~0_480 v_~n2~0_486) (= v_~n2~0_486 0)) 1 0))) InVars {~n2~0=v_~n2~0_486, ~i~0=v_~i~0_484, ~f~0.base=v_~f~0.base_288, ~n1~0=v_~n1~0_480, #memory_int=|v_#memory_int_368|, ~f~0.offset=v_~f~0.offset_286, ~e2~0=v_~e2~0_341} OutVars{~n2~0=v_~n2~0_486, ~i~0=v_~i~0_483, ~f~0.base=v_~f~0.base_288, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_235|, ~n1~0=v_~n1~0_480, #memory_int=|v_#memory_int_368|, ~i1~0=v_~i1~0_225, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_98|, ~f~0.offset=v_~f~0.offset_286, ~e2~0=v_~e2~0_341, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_235|} 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 10:31:38,404 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [748] L71-->thread1EXIT: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_219| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| (ite (and (< v_~i~0_463 v_~n~0_222) (<= 0 v_~i~0_463)) 1 0)) (= |v_thread1Thread1of1ForFork1_#res#1.offset_37| 0) (= v_~n1~0_462 0) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_219|) (= |v_thread1Thread1of1ForFork1_#res#1.base_37| 0)) InVars {~i~0=v_~i~0_463, ~n~0=v_~n~0_222} OutVars{~i~0=v_~i~0_463, ~n1~0=v_~n1~0_462, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_219|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_37|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_37|, ~n~0=v_~n~0_222, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_219|} 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] and [760] L106-->thread2EXIT: Formula: (and (= v_~n2~0_502 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_67| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_215| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_215|) (= |v_thread2Thread1of1ForFork2_#res#1.base_67| 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_215| 0)) (= (ite (and (< v_~i~0_499 v_~n~0_240) (<= 0 v_~i~0_499)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_215|)) InVars {~i~0=v_~i~0_499, ~n~0=v_~n~0_240} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_215|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_67|, ~n2~0=v_~n2~0_502, ~i~0=v_~i~0_499, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_215|, ~n~0=v_~n~0_240, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_67|} 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 10:31:38,536 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 10:31:38,601 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 [764] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| 0)) (= (+ v_~tmp1~0_252 1) v_~n1~0_510) (= v_~n2~0_528 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_69| 0) (= v_~e1~0_292 0) (= (ite (and (< v_~i~0_512 v_~n~0_242) (<= 0 v_~i~0_512)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_69| 0) (= v_~n2~0_529 v_~tmp1~0_252)) InVars {~n2~0=v_~n2~0_529, ~i~0=v_~i~0_512, ~n~0=v_~n~0_242} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_69|, ~n2~0=v_~n2~0_528, ~i~0=v_~i~0_512, ~n1~0=v_~n1~0_510, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|, ~n~0=v_~n~0_242, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_69|, ~tmp1~0=v_~tmp1~0_252, ~e1~0=v_~e1~0_292} 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 10:31:38,651 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 10:31:38,652 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 448 [2022-12-13 10:31:38,652 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 91 transitions, 1019 flow [2022-12-13 10:31:38,652 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 10:31:38,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:38,652 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 10:31:38,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-13 10:31:38,653 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 10:31:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1916962048, now seen corresponding path program 1 times [2022-12-13 10:31:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:38,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013416387] [2022-12-13 10:31:38,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:38,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:39,144 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 10:31:39,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:39,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013416387] [2022-12-13 10:31:39,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013416387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:39,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:39,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547624645] [2022-12-13 10:31:39,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:39,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:39,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:39,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:39,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:39,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-13 10:31:39,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 91 transitions, 1019 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 10:31:39,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:39,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-13 10:31:39,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:39,664 INFO L130 PetriNetUnfolder]: 885/1961 cut-off events. [2022-12-13 10:31:39,664 INFO L131 PetriNetUnfolder]: For 14213/14213 co-relation queries the response was YES. [2022-12-13 10:31:39,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9826 conditions, 1961 events. 885/1961 cut-off events. For 14213/14213 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13515 event pairs, 379 based on Foata normal form. 2/1955 useless extension candidates. Maximal degree in co-relation 9757. Up to 1306 conditions per place. [2022-12-13 10:31:39,675 INFO L137 encePairwiseOnDemand]: 36/55 looper letters, 122 selfloop transitions, 22 changer transitions 45/189 dead transitions. [2022-12-13 10:31:39,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 189 transitions, 2071 flow [2022-12-13 10:31:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 10:31:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 10:31:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2022-12-13 10:31:39,676 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24242424242424243 [2022-12-13 10:31:39,676 INFO L175 Difference]: Start difference. First operand has 119 places, 91 transitions, 1019 flow. Second operand 12 states and 160 transitions. [2022-12-13 10:31:39,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 189 transitions, 2071 flow [2022-12-13 10:31:39,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 189 transitions, 1973 flow, removed 34 selfloop flow, removed 8 redundant places. [2022-12-13 10:31:39,701 INFO L231 Difference]: Finished difference. Result has 127 places, 90 transitions, 987 flow [2022-12-13 10:31:39,701 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=987, PETRI_PLACES=127, PETRI_TRANSITIONS=90} [2022-12-13 10:31:39,701 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 86 predicate places. [2022-12-13 10:31:39,701 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:39,701 INFO L89 Accepts]: Start accepts. Operand has 127 places, 90 transitions, 987 flow [2022-12-13 10:31:39,702 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:39,702 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:39,702 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 90 transitions, 987 flow [2022-12-13 10:31:39,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 90 transitions, 987 flow [2022-12-13 10:31:39,751 INFO L130 PetriNetUnfolder]: 72/538 cut-off events. [2022-12-13 10:31:39,751 INFO L131 PetriNetUnfolder]: For 2942/2958 co-relation queries the response was YES. [2022-12-13 10:31:39,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 538 events. 72/538 cut-off events. For 2942/2958 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4563 event pairs, 19 based on Foata normal form. 6/517 useless extension candidates. Maximal degree in co-relation 2134. Up to 66 conditions per place. [2022-12-13 10:31:39,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 90 transitions, 987 flow [2022-12-13 10:31:39,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-13 10:31:39,767 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [865] L103-->L155-3: Formula: (and (= (+ |v_#pthreadsForks_207| 1) |v_#pthreadsForks_206|) (= (select (select |v_#memory_int_767| v_~f~0.base_642) (+ v_~f~0.offset_638 (* v_~i2~0_295 4))) v_~i~0_1180) (= |v_ULTIMATE.start_main_#t~pre17#1_111| |v_#pthreadsForks_207|) (= (store |v_#memory_int_767| |v_ULTIMATE.start_main_~#t3~0#1.base_183| (store (select |v_#memory_int_767| |v_ULTIMATE.start_main_~#t3~0#1.base_183|) |v_ULTIMATE.start_main_~#t3~0#1.offset_107| |v_ULTIMATE.start_main_#t~pre17#1_111|)) |v_#memory_int_766|)) InVars {#pthreadsForks=|v_#pthreadsForks_207|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_107|, ~f~0.base=v_~f~0.base_642, #memory_int=|v_#memory_int_767|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_183|, ~i2~0=v_~i2~0_295, ~f~0.offset=v_~f~0.offset_638} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_101|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_195|, #pthreadsForks=|v_#pthreadsForks_206|, ~i~0=v_~i~0_1180, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_107|, ~f~0.base=v_~f~0.base_642, #memory_int=|v_#memory_int_766|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_183|, ~i2~0=v_~i2~0_295, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_129|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_111|, ~f~0.offset=v_~f~0.offset_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, #pthreadsForks, ~i~0, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [764] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239| 0)) (= (+ v_~tmp1~0_252 1) v_~n1~0_510) (= v_~n2~0_528 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_69| 0) (= v_~e1~0_292 0) (= (ite (and (< v_~i~0_512 v_~n~0_242) (<= 0 v_~i~0_512)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_69| 0) (= v_~n2~0_529 v_~tmp1~0_252)) InVars {~n2~0=v_~n2~0_529, ~i~0=v_~i~0_512, ~n~0=v_~n~0_242} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_239|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_69|, ~n2~0=v_~n2~0_528, ~i~0=v_~i~0_512, ~n1~0=v_~n1~0_510, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_239|, ~n~0=v_~n~0_242, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_69|, ~tmp1~0=v_~tmp1~0_252, ~e1~0=v_~e1~0_292} 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 10:31:39,836 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [865] L103-->L155-3: Formula: (and (= (+ |v_#pthreadsForks_207| 1) |v_#pthreadsForks_206|) (= (select (select |v_#memory_int_767| v_~f~0.base_642) (+ v_~f~0.offset_638 (* v_~i2~0_295 4))) v_~i~0_1180) (= |v_ULTIMATE.start_main_#t~pre17#1_111| |v_#pthreadsForks_207|) (= (store |v_#memory_int_767| |v_ULTIMATE.start_main_~#t3~0#1.base_183| (store (select |v_#memory_int_767| |v_ULTIMATE.start_main_~#t3~0#1.base_183|) |v_ULTIMATE.start_main_~#t3~0#1.offset_107| |v_ULTIMATE.start_main_#t~pre17#1_111|)) |v_#memory_int_766|)) InVars {#pthreadsForks=|v_#pthreadsForks_207|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_107|, ~f~0.base=v_~f~0.base_642, #memory_int=|v_#memory_int_767|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_183|, ~i2~0=v_~i2~0_295, ~f~0.offset=v_~f~0.offset_638} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_101|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_195|, #pthreadsForks=|v_#pthreadsForks_206|, ~i~0=v_~i~0_1180, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_107|, ~f~0.base=v_~f~0.base_642, #memory_int=|v_#memory_int_766|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_183|, ~i2~0=v_~i2~0_295, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_129|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_111|, ~f~0.offset=v_~f~0.offset_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, #pthreadsForks, ~i~0, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [755] L106-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_205| 0)) (= (ite (and (<= 0 v_~i~0_489) (< v_~i~0_489 v_~n~0_230)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205|) (= |v_thread2Thread1of1ForFork2_#res#1.offset_57| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_205| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205|) (= |v_thread2Thread1of1ForFork2_#res#1.base_57| 0) (= v_~n2~0_490 0)) InVars {~i~0=v_~i~0_489, ~n~0=v_~n~0_230} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_205|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_57|, ~n2~0=v_~n2~0_490, ~i~0=v_~i~0_489, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_205|, ~n~0=v_~n~0_230, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_57|} 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 10:31:39,888 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [865] L103-->L155-3: Formula: (and (= (+ |v_#pthreadsForks_207| 1) |v_#pthreadsForks_206|) (= (select (select |v_#memory_int_767| v_~f~0.base_642) (+ v_~f~0.offset_638 (* v_~i2~0_295 4))) v_~i~0_1180) (= |v_ULTIMATE.start_main_#t~pre17#1_111| |v_#pthreadsForks_207|) (= (store |v_#memory_int_767| |v_ULTIMATE.start_main_~#t3~0#1.base_183| (store (select |v_#memory_int_767| |v_ULTIMATE.start_main_~#t3~0#1.base_183|) |v_ULTIMATE.start_main_~#t3~0#1.offset_107| |v_ULTIMATE.start_main_#t~pre17#1_111|)) |v_#memory_int_766|)) InVars {#pthreadsForks=|v_#pthreadsForks_207|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_107|, ~f~0.base=v_~f~0.base_642, #memory_int=|v_#memory_int_767|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_183|, ~i2~0=v_~i2~0_295, ~f~0.offset=v_~f~0.offset_638} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_101|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_195|, #pthreadsForks=|v_#pthreadsForks_206|, ~i~0=v_~i~0_1180, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_107|, ~f~0.base=v_~f~0.base_642, #memory_int=|v_#memory_int_766|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_183|, ~i2~0=v_~i2~0_295, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_129|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_111|, ~f~0.offset=v_~f~0.offset_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, #pthreadsForks, ~i~0, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [756] L106-->thread2EXIT: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_207| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_59| 0) (= v_~n2~0_492 0) (= (ite (and (<= 0 v_~i~0_491) (< v_~i~0_491 v_~n~0_232)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_207|) (= v_~n2~0_493 v_~tmp1~0_239) (= |v_thread2Thread1of1ForFork2_#res#1.base_59| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_207| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_207|) (= v_~e1~0_274 1)) InVars {~n2~0=v_~n2~0_493, ~i~0=v_~i~0_491, ~n~0=v_~n~0_232} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_207|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_59|, ~n2~0=v_~n2~0_492, ~i~0=v_~i~0_491, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_207|, ~n~0=v_~n~0_232, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_59|, ~tmp1~0=v_~tmp1~0_239, ~e1~0=v_~e1~0_274} 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 10:31:40,501 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 10:31:40,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 801 [2022-12-13 10:31:40,502 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 90 transitions, 1093 flow [2022-12-13 10:31:40,503 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 10:31:40,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:40,503 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 10:31:40,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-13 10:31:40,503 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 10:31:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash -393012271, now seen corresponding path program 1 times [2022-12-13 10:31:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:40,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127637787] [2022-12-13 10:31:40,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:40,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:41,028 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 10:31:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:41,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127637787] [2022-12-13 10:31:41,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127637787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:41,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:41,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:31:41,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082004435] [2022-12-13 10:31:41,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:41,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 10:31:41,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:41,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 10:31:41,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 10:31:41,029 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-13 10:31:41,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 90 transitions, 1093 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 10:31:41,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:41,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-13 10:31:41,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:41,462 INFO L130 PetriNetUnfolder]: 838/1861 cut-off events. [2022-12-13 10:31:41,462 INFO L131 PetriNetUnfolder]: For 13686/13686 co-relation queries the response was YES. [2022-12-13 10:31:41,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9398 conditions, 1861 events. 838/1861 cut-off events. For 13686/13686 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12571 event pairs, 409 based on Foata normal form. 2/1863 useless extension candidates. Maximal degree in co-relation 9327. Up to 1189 conditions per place. [2022-12-13 10:31:41,472 INFO L137 encePairwiseOnDemand]: 38/56 looper letters, 112 selfloop transitions, 14 changer transitions 45/171 dead transitions. [2022-12-13 10:31:41,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 171 transitions, 1983 flow [2022-12-13 10:31:41,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:31:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:31:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2022-12-13 10:31:41,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31473214285714285 [2022-12-13 10:31:41,473 INFO L175 Difference]: Start difference. First operand has 123 places, 90 transitions, 1093 flow. Second operand 8 states and 141 transitions. [2022-12-13 10:31:41,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 171 transitions, 1983 flow [2022-12-13 10:31:41,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 171 transitions, 1880 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-12-13 10:31:41,499 INFO L231 Difference]: Finished difference. Result has 124 places, 85 transitions, 915 flow [2022-12-13 10:31:41,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=114, 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=915, PETRI_PLACES=124, PETRI_TRANSITIONS=85} [2022-12-13 10:31:41,499 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places. [2022-12-13 10:31:41,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:41,499 INFO L89 Accepts]: Start accepts. Operand has 124 places, 85 transitions, 915 flow [2022-12-13 10:31:41,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:41,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:41,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 85 transitions, 915 flow [2022-12-13 10:31:41,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 85 transitions, 915 flow [2022-12-13 10:31:41,538 INFO L130 PetriNetUnfolder]: 68/533 cut-off events. [2022-12-13 10:31:41,538 INFO L131 PetriNetUnfolder]: For 2883/2899 co-relation queries the response was YES. [2022-12-13 10:31:41,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 533 events. 68/533 cut-off events. For 2883/2899 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4536 event pairs, 19 based on Foata normal form. 7/516 useless extension candidates. Maximal degree in co-relation 2072. Up to 66 conditions per place. [2022-12-13 10:31:41,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 85 transitions, 915 flow [2022-12-13 10:31:41,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 10:31:41,545 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:41,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 10:31:41,546 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 85 transitions, 915 flow [2022-12-13 10:31:41,546 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 10:31:41,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:41,546 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 10:31:41,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-13 10:31:41,546 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 10:31:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:41,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1096344991, now seen corresponding path program 1 times [2022-12-13 10:31:41,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:41,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577526469] [2022-12-13 10:31:41,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:42,140 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 10:31:42,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:42,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577526469] [2022-12-13 10:31:42,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577526469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:42,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:42,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:42,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655564025] [2022-12-13 10:31:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:42,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:42,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:42,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:42,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-13 10:31:42,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 85 transitions, 915 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 10:31:42,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:42,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-13 10:31:42,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:42,635 INFO L130 PetriNetUnfolder]: 787/1740 cut-off events. [2022-12-13 10:31:42,636 INFO L131 PetriNetUnfolder]: For 12560/12560 co-relation queries the response was YES. [2022-12-13 10:31:42,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8682 conditions, 1740 events. 787/1740 cut-off events. For 12560/12560 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11694 event pairs, 357 based on Foata normal form. 2/1742 useless extension candidates. Maximal degree in co-relation 8614. Up to 1184 conditions per place. [2022-12-13 10:31:42,645 INFO L137 encePairwiseOnDemand]: 36/51 looper letters, 99 selfloop transitions, 11 changer transitions 51/161 dead transitions. [2022-12-13 10:31:42,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 161 transitions, 1718 flow [2022-12-13 10:31:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:42,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:42,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2022-12-13 10:31:42,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2022-12-13 10:31:42,645 INFO L175 Difference]: Start difference. First operand has 120 places, 85 transitions, 915 flow. Second operand 9 states and 135 transitions. [2022-12-13 10:31:42,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 161 transitions, 1718 flow [2022-12-13 10:31:42,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 161 transitions, 1680 flow, removed 4 selfloop flow, removed 8 redundant places. [2022-12-13 10:31:42,668 INFO L231 Difference]: Finished difference. Result has 121 places, 76 transitions, 778 flow [2022-12-13 10:31:42,668 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=778, PETRI_PLACES=121, PETRI_TRANSITIONS=76} [2022-12-13 10:31:42,668 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places. [2022-12-13 10:31:42,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:42,668 INFO L89 Accepts]: Start accepts. Operand has 121 places, 76 transitions, 778 flow [2022-12-13 10:31:42,669 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:42,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:42,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 76 transitions, 778 flow [2022-12-13 10:31:42,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 76 transitions, 778 flow [2022-12-13 10:31:42,701 INFO L130 PetriNetUnfolder]: 60/458 cut-off events. [2022-12-13 10:31:42,701 INFO L131 PetriNetUnfolder]: For 2422/2436 co-relation queries the response was YES. [2022-12-13 10:31:42,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 458 events. 60/458 cut-off events. For 2422/2436 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3740 event pairs, 16 based on Foata normal form. 6/440 useless extension candidates. Maximal degree in co-relation 1781. Up to 52 conditions per place. [2022-12-13 10:31:42,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 76 transitions, 778 flow [2022-12-13 10:31:42,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-13 10:31:42,708 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:42,709 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-13 10:31:42,709 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 76 transitions, 778 flow [2022-12-13 10:31:42,709 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 10:31:42,709 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31: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] [2022-12-13 10:31:42,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-13 10:31:42,709 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 10:31:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:42,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2093501812, now seen corresponding path program 1 times [2022-12-13 10:31:42,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:42,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308041563] [2022-12-13 10:31:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:42,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:43,283 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 10:31:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:43,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308041563] [2022-12-13 10:31:43,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308041563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:43,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:43,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:43,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655513080] [2022-12-13 10:31:43,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:43,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:43,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:43,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:43,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 10:31:43,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 76 transitions, 778 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 10:31:43,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:43,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 10:31:43,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:43,743 INFO L130 PetriNetUnfolder]: 739/1619 cut-off events. [2022-12-13 10:31:43,743 INFO L131 PetriNetUnfolder]: For 12008/12008 co-relation queries the response was YES. [2022-12-13 10:31:43,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8092 conditions, 1619 events. 739/1619 cut-off events. For 12008/12008 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10597 event pairs, 285 based on Foata normal form. 2/1621 useless extension candidates. Maximal degree in co-relation 8017. Up to 1184 conditions per place. [2022-12-13 10:31:43,753 INFO L137 encePairwiseOnDemand]: 32/47 looper letters, 115 selfloop transitions, 17 changer transitions 17/149 dead transitions. [2022-12-13 10:31:43,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 149 transitions, 1543 flow [2022-12-13 10:31:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:31:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:31:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2022-12-13 10:31:43,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2680851063829787 [2022-12-13 10:31:43,754 INFO L175 Difference]: Start difference. First operand has 113 places, 76 transitions, 778 flow. Second operand 10 states and 126 transitions. [2022-12-13 10:31:43,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 149 transitions, 1543 flow [2022-12-13 10:31:43,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 149 transitions, 1500 flow, removed 9 selfloop flow, removed 10 redundant places. [2022-12-13 10:31:43,773 INFO L231 Difference]: Finished difference. Result has 117 places, 83 transitions, 887 flow [2022-12-13 10:31:43,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=887, PETRI_PLACES=117, PETRI_TRANSITIONS=83} [2022-12-13 10:31:43,774 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2022-12-13 10:31:43,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:43,774 INFO L89 Accepts]: Start accepts. Operand has 117 places, 83 transitions, 887 flow [2022-12-13 10:31:43,774 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:43,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:43,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 83 transitions, 887 flow [2022-12-13 10:31:43,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 83 transitions, 887 flow [2022-12-13 10:31:43,806 INFO L130 PetriNetUnfolder]: 58/464 cut-off events. [2022-12-13 10:31:43,807 INFO L131 PetriNetUnfolder]: For 2732/2745 co-relation queries the response was YES. [2022-12-13 10:31:43,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1880 conditions, 464 events. 58/464 cut-off events. For 2732/2745 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3845 event pairs, 14 based on Foata normal form. 6/448 useless extension candidates. Maximal degree in co-relation 1822. Up to 52 conditions per place. [2022-12-13 10:31:43,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 83 transitions, 887 flow [2022-12-13 10:31:43,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 464 [2022-12-13 10:31:43,842 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [861] L59-->L154-3: Formula: (and (= (select (select |v_#memory_int_759| v_~f~0.base_636) (+ v_~f~0.offset_632 (* v_~i1~0_449 4))) v_~i~0_1168) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_481| (ite (or (<= v_~n1~0_930 v_~n2~0_1066) (= v_~n2~0_1066 0)) 1 0)) (= |v_#pthreadsForks_203| |v_ULTIMATE.start_main_#t~pre15#1_127|) (= v_~i1~0_449 v_~i~0_1169) (= (store |v_#memory_int_759| |v_ULTIMATE.start_main_~#t2~0#1.base_111| (store (select |v_#memory_int_759| |v_ULTIMATE.start_main_~#t2~0#1.base_111|) |v_ULTIMATE.start_main_~#t2~0#1.offset_75| |v_ULTIMATE.start_main_#t~pre15#1_127|)) |v_#memory_int_758|) (not (= (ite (= (mod v_~e2~0_700 256) 0) 1 0) 0)) (= (+ |v_#pthreadsForks_203| 1) |v_#pthreadsForks_202|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_481| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_481| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_481|)) InVars {#pthreadsForks=|v_#pthreadsForks_203|, ~n2~0=v_~n2~0_1066, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ~i~0=v_~i~0_1169, ~f~0.base=v_~f~0.base_636, ~n1~0=v_~n1~0_930, #memory_int=|v_#memory_int_759|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_111|, ~f~0.offset=v_~f~0.offset_632, ~e2~0=v_~e2~0_700} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_87|, ~n2~0=v_~n2~0_1066, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_75|, ~i~0=v_~i~0_1168, ~f~0.base=v_~f~0.base_636, ~n1~0=v_~n1~0_930, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_127|, ~i1~0=v_~i1~0_449, ~f~0.offset=v_~f~0.offset_632, ~e2~0=v_~e2~0_700, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_67|, #pthreadsForks=|v_#pthreadsForks_202|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_481|, #memory_int=|v_#memory_int_758|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_312|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_111|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_481|} 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 10:31:43,944 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:31:43,944 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 10:31:43,944 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 82 transitions, 891 flow [2022-12-13 10:31:43,944 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 10:31:43,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:43,945 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 10:31:43,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-13 10:31:43,945 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 10:31:43,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1781096119, now seen corresponding path program 1 times [2022-12-13 10:31:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:43,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457454387] [2022-12-13 10:31:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:44,695 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 10:31:44,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:44,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457454387] [2022-12-13 10:31:44,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457454387] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:31:44,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858553979] [2022-12-13 10:31:44,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:44,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:44,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:31:44,697 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 10:31:44,697 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 10:31:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:44,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 10:31:44,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:31:44,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:31:44,941 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 10:31:44,950 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 10:31:44,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:31:44,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858553979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:44,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:31:44,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-12-13 10:31:44,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226614898] [2022-12-13 10:31:44,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:44,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:31:44,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:44,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:31:44,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-13 10:31:44,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 10:31:44,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 82 transitions, 891 flow. Second operand has 6 states, 5 states have (on average 4.2) 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 10:31:44,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:44,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 10:31:44,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:45,333 INFO L130 PetriNetUnfolder]: 728/1611 cut-off events. [2022-12-13 10:31:45,333 INFO L131 PetriNetUnfolder]: For 13591/13591 co-relation queries the response was YES. [2022-12-13 10:31:45,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8268 conditions, 1611 events. 728/1611 cut-off events. For 13591/13591 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10507 event pairs, 274 based on Foata normal form. 2/1613 useless extension candidates. Maximal degree in co-relation 8202. Up to 1076 conditions per place. [2022-12-13 10:31:45,341 INFO L137 encePairwiseOnDemand]: 37/48 looper letters, 104 selfloop transitions, 17 changer transitions 24/145 dead transitions. [2022-12-13 10:31:45,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 145 transitions, 1644 flow [2022-12-13 10:31:45,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:31:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:31:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2022-12-13 10:31:45,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3177083333333333 [2022-12-13 10:31:45,342 INFO L175 Difference]: Start difference. First operand has 115 places, 82 transitions, 891 flow. Second operand 8 states and 122 transitions. [2022-12-13 10:31:45,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 145 transitions, 1644 flow [2022-12-13 10:31:45,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 145 transitions, 1576 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-13 10:31:45,367 INFO L231 Difference]: Finished difference. Result has 118 places, 81 transitions, 867 flow [2022-12-13 10:31:45,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=867, PETRI_PLACES=118, PETRI_TRANSITIONS=81} [2022-12-13 10:31:45,368 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 77 predicate places. [2022-12-13 10:31:45,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:45,368 INFO L89 Accepts]: Start accepts. Operand has 118 places, 81 transitions, 867 flow [2022-12-13 10:31:45,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:45,369 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:45,369 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 81 transitions, 867 flow [2022-12-13 10:31:45,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 81 transitions, 867 flow [2022-12-13 10:31:45,423 INFO L130 PetriNetUnfolder]: 55/468 cut-off events. [2022-12-13 10:31:45,423 INFO L131 PetriNetUnfolder]: For 2788/2804 co-relation queries the response was YES. [2022-12-13 10:31:45,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1905 conditions, 468 events. 55/468 cut-off events. For 2788/2804 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3884 event pairs, 11 based on Foata normal form. 6/451 useless extension candidates. Maximal degree in co-relation 1763. Up to 51 conditions per place. [2022-12-13 10:31:45,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 81 transitions, 867 flow [2022-12-13 10:31:45,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-13 10:31:45,429 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:45,430 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 62 [2022-12-13 10:31:45,430 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 81 transitions, 867 flow [2022-12-13 10:31:45,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) 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 10:31:45,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:45,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] [2022-12-13 10:31:45,437 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 10:31:45,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:45,631 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 10:31:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1797971047, now seen corresponding path program 1 times [2022-12-13 10:31:45,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:45,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731782938] [2022-12-13 10:31:45,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:45,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:45,886 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 10:31:45,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:45,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731782938] [2022-12-13 10:31:45,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731782938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:45,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:45,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:31:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946379484] [2022-12-13 10:31:45,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:45,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:31:45,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:45,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:31:45,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:31:45,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-13 10:31:45,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 81 transitions, 867 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 10:31:45,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:45,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-13 10:31:45,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:46,312 INFO L130 PetriNetUnfolder]: 746/1707 cut-off events. [2022-12-13 10:31:46,312 INFO L131 PetriNetUnfolder]: For 13684/13684 co-relation queries the response was YES. [2022-12-13 10:31:46,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8578 conditions, 1707 events. 746/1707 cut-off events. For 13684/13684 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11699 event pairs, 202 based on Foata normal form. 8/1715 useless extension candidates. Maximal degree in co-relation 8149. Up to 624 conditions per place. [2022-12-13 10:31:46,320 INFO L137 encePairwiseOnDemand]: 34/48 looper letters, 70 selfloop transitions, 24 changer transitions 43/137 dead transitions. [2022-12-13 10:31:46,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 137 transitions, 1533 flow [2022-12-13 10:31:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:31:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:31:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2022-12-13 10:31:46,321 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2864583333333333 [2022-12-13 10:31:46,321 INFO L175 Difference]: Start difference. First operand has 117 places, 81 transitions, 867 flow. Second operand 8 states and 110 transitions. [2022-12-13 10:31:46,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 137 transitions, 1533 flow [2022-12-13 10:31:46,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 137 transitions, 1482 flow, removed 5 selfloop flow, removed 9 redundant places. [2022-12-13 10:31:46,346 INFO L231 Difference]: Finished difference. Result has 119 places, 76 transitions, 868 flow [2022-12-13 10:31:46,346 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=868, PETRI_PLACES=119, PETRI_TRANSITIONS=76} [2022-12-13 10:31:46,346 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 78 predicate places. [2022-12-13 10:31:46,346 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:46,347 INFO L89 Accepts]: Start accepts. Operand has 119 places, 76 transitions, 868 flow [2022-12-13 10:31:46,347 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:46,347 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:46,347 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 76 transitions, 868 flow [2022-12-13 10:31:46,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 76 transitions, 868 flow [2022-12-13 10:31:46,374 INFO L130 PetriNetUnfolder]: 35/397 cut-off events. [2022-12-13 10:31:46,374 INFO L131 PetriNetUnfolder]: For 2900/2916 co-relation queries the response was YES. [2022-12-13 10:31:46,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1698 conditions, 397 events. 35/397 cut-off events. For 2900/2916 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3248 event pairs, 6 based on Foata normal form. 4/380 useless extension candidates. Maximal degree in co-relation 1632. Up to 46 conditions per place. [2022-12-13 10:31:46,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 76 transitions, 868 flow [2022-12-13 10:31:46,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-13 10:31:46,500 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:46,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 10:31:46,501 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 75 transitions, 878 flow [2022-12-13 10:31:46,501 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 10:31:46,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:46,501 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 10:31:46,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-13 10:31:46,502 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 10:31:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1697912561, now seen corresponding path program 2 times [2022-12-13 10:31:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:46,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243479713] [2022-12-13 10:31:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:47,138 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 10:31:47,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:47,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243479713] [2022-12-13 10:31:47,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243479713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:47,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:47,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:47,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890172376] [2022-12-13 10:31:47,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:47,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:47,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:47,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:47,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:47,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 10:31:47,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 75 transitions, 878 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 10:31:47,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:47,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 10:31:47,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:47,628 INFO L130 PetriNetUnfolder]: 614/1461 cut-off events. [2022-12-13 10:31:47,628 INFO L131 PetriNetUnfolder]: For 16476/16476 co-relation queries the response was YES. [2022-12-13 10:31:47,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7893 conditions, 1461 events. 614/1461 cut-off events. For 16476/16476 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10027 event pairs, 315 based on Foata normal form. 2/1463 useless extension candidates. Maximal degree in co-relation 7819. Up to 897 conditions per place. [2022-12-13 10:31:47,635 INFO L137 encePairwiseOnDemand]: 37/50 looper letters, 90 selfloop transitions, 10 changer transitions 48/148 dead transitions. [2022-12-13 10:31:47,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 1699 flow [2022-12-13 10:31:47,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2022-12-13 10:31:47,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2911111111111111 [2022-12-13 10:31:47,636 INFO L175 Difference]: Start difference. First operand has 116 places, 75 transitions, 878 flow. Second operand 9 states and 131 transitions. [2022-12-13 10:31:47,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 1699 flow [2022-12-13 10:31:47,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 148 transitions, 1522 flow, removed 54 selfloop flow, removed 14 redundant places. [2022-12-13 10:31:47,659 INFO L231 Difference]: Finished difference. Result has 114 places, 74 transitions, 768 flow [2022-12-13 10:31:47,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=768, PETRI_PLACES=114, PETRI_TRANSITIONS=74} [2022-12-13 10:31:47,660 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places. [2022-12-13 10:31:47,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:47,660 INFO L89 Accepts]: Start accepts. Operand has 114 places, 74 transitions, 768 flow [2022-12-13 10:31:47,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:47,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:47,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 74 transitions, 768 flow [2022-12-13 10:31:47,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 74 transitions, 768 flow [2022-12-13 10:31:47,685 INFO L130 PetriNetUnfolder]: 34/387 cut-off events. [2022-12-13 10:31:47,686 INFO L131 PetriNetUnfolder]: For 2108/2128 co-relation queries the response was YES. [2022-12-13 10:31:47,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 387 events. 34/387 cut-off events. For 2108/2128 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3128 event pairs, 6 based on Foata normal form. 6/372 useless extension candidates. Maximal degree in co-relation 1418. Up to 45 conditions per place. [2022-12-13 10:31:47,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 74 transitions, 768 flow [2022-12-13 10:31:47,688 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 10:31:47,691 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:47,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 10:31:47,692 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 74 transitions, 768 flow [2022-12-13 10:31:47,693 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 10:31:47,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:47,693 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 10:31:47,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-13 10:31:47,693 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 10:31:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2073122552, now seen corresponding path program 1 times [2022-12-13 10:31:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:47,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523923624] [2022-12-13 10:31:47,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:47,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:48,217 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 10:31:48,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:48,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523923624] [2022-12-13 10:31:48,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523923624] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:31:48,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158869296] [2022-12-13 10:31:48,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:48,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:48,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:31:48,219 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 10:31:48,220 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 10:31:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:48,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 10:31:48,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:31:48,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:31:48,458 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 10:31:48,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:31:48,480 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 10:31:48,485 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 10:31:48,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:31:48,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158869296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:48,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:31:48,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2022-12-13 10:31:48,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041423501] [2022-12-13 10:31:48,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:48,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:31:48,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:48,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:31:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-12-13 10:31:48,486 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-13 10:31:48,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 74 transitions, 768 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 10:31:48,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:48,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-13 10:31:48,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:48,772 INFO L130 PetriNetUnfolder]: 564/1359 cut-off events. [2022-12-13 10:31:48,772 INFO L131 PetriNetUnfolder]: For 10592/10592 co-relation queries the response was YES. [2022-12-13 10:31:48,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6651 conditions, 1359 events. 564/1359 cut-off events. For 10592/10592 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9053 event pairs, 233 based on Foata normal form. 4/1363 useless extension candidates. Maximal degree in co-relation 6588. Up to 837 conditions per place. [2022-12-13 10:31:48,779 INFO L137 encePairwiseOnDemand]: 38/49 looper letters, 68 selfloop transitions, 10 changer transitions 36/114 dead transitions. [2022-12-13 10:31:48,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 1258 flow [2022-12-13 10:31:48,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:31:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:31:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-13 10:31:48,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3163265306122449 [2022-12-13 10:31:48,779 INFO L175 Difference]: Start difference. First operand has 111 places, 74 transitions, 768 flow. Second operand 6 states and 93 transitions. [2022-12-13 10:31:48,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 1258 flow [2022-12-13 10:31:48,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 114 transitions, 1222 flow, removed 7 selfloop flow, removed 9 redundant places. [2022-12-13 10:31:48,798 INFO L231 Difference]: Finished difference. Result has 109 places, 70 transitions, 693 flow [2022-12-13 10:31:48,798 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=109, PETRI_TRANSITIONS=70} [2022-12-13 10:31:48,799 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places. [2022-12-13 10:31:48,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:48,799 INFO L89 Accepts]: Start accepts. Operand has 109 places, 70 transitions, 693 flow [2022-12-13 10:31:48,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:48,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:48,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 70 transitions, 693 flow [2022-12-13 10:31:48,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 70 transitions, 693 flow [2022-12-13 10:31:48,823 INFO L130 PetriNetUnfolder]: 28/348 cut-off events. [2022-12-13 10:31:48,823 INFO L131 PetriNetUnfolder]: For 1699/1717 co-relation queries the response was YES. [2022-12-13 10:31:48,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 348 events. 28/348 cut-off events. For 1699/1717 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2684 event pairs, 6 based on Foata normal form. 5/333 useless extension candidates. Maximal degree in co-relation 1194. Up to 45 conditions per place. [2022-12-13 10:31:48,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 70 transitions, 693 flow [2022-12-13 10:31:48,825 INFO L226 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-13 10:31:48,828 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:48,830 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 10:31:48,830 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 70 transitions, 693 flow [2022-12-13 10:31:48,830 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 10:31:48,830 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:48,830 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 10:31:48,836 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 10:31:49,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:49,036 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 10:31:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1350054273, now seen corresponding path program 1 times [2022-12-13 10:31:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:49,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529197852] [2022-12-13 10:31:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:31:49,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:49,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529197852] [2022-12-13 10:31:49,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529197852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:49,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:49,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 10:31:49,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15839624] [2022-12-13 10:31:49,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:49,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 10:31:49,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:49,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 10:31:49,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 10:31:49,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 10:31:49,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 70 transitions, 693 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 10:31:49,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:49,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 10:31:49,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:50,314 INFO L130 PetriNetUnfolder]: 458/1103 cut-off events. [2022-12-13 10:31:50,314 INFO L131 PetriNetUnfolder]: For 7493/7493 co-relation queries the response was YES. [2022-12-13 10:31:50,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5209 conditions, 1103 events. 458/1103 cut-off events. For 7493/7493 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6971 event pairs, 182 based on Foata normal form. 2/1105 useless extension candidates. Maximal degree in co-relation 4865. Up to 745 conditions per place. [2022-12-13 10:31:50,319 INFO L137 encePairwiseOnDemand]: 35/46 looper letters, 61 selfloop transitions, 7 changer transitions 52/120 dead transitions. [2022-12-13 10:31:50,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 120 transitions, 1221 flow [2022-12-13 10:31:50,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2022-12-13 10:31:50,320 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2560386473429952 [2022-12-13 10:31:50,320 INFO L175 Difference]: Start difference. First operand has 107 places, 70 transitions, 693 flow. Second operand 9 states and 106 transitions. [2022-12-13 10:31:50,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 120 transitions, 1221 flow [2022-12-13 10:31:50,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 120 transitions, 1186 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-13 10:31:50,333 INFO L231 Difference]: Finished difference. Result has 110 places, 62 transitions, 558 flow [2022-12-13 10:31:50,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=558, PETRI_PLACES=110, PETRI_TRANSITIONS=62} [2022-12-13 10:31:50,334 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2022-12-13 10:31:50,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:50,334 INFO L89 Accepts]: Start accepts. Operand has 110 places, 62 transitions, 558 flow [2022-12-13 10:31:50,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:50,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:50,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 62 transitions, 558 flow [2022-12-13 10:31:50,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 62 transitions, 558 flow [2022-12-13 10:31:50,350 INFO L130 PetriNetUnfolder]: 24/252 cut-off events. [2022-12-13 10:31:50,351 INFO L131 PetriNetUnfolder]: For 945/953 co-relation queries the response was YES. [2022-12-13 10:31:50,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 252 events. 24/252 cut-off events. For 945/953 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1737 event pairs, 4 based on Foata normal form. 3/243 useless extension candidates. Maximal degree in co-relation 838. Up to 37 conditions per place. [2022-12-13 10:31:50,352 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 62 transitions, 558 flow [2022-12-13 10:31:50,352 INFO L226 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-13 10:31:54,300 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 10:31:54,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3967 [2022-12-13 10:31:54,301 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 61 transitions, 556 flow [2022-12-13 10:31:54,301 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 10:31:54,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:54,301 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 10:31:54,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-13 10:31:54,301 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 10:31:54,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:54,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1063253485, now seen corresponding path program 1 times [2022-12-13 10:31:54,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:54,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868819525] [2022-12-13 10:31:54,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:54,835 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 10:31:54,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:54,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868819525] [2022-12-13 10:31:54,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868819525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:54,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:54,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:54,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819341582] [2022-12-13 10:31:54,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:54,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:54,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:54,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:54,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:54,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:31:54,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 61 transitions, 556 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 10:31:54,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:54,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:31:54,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:55,279 INFO L130 PetriNetUnfolder]: 680/1632 cut-off events. [2022-12-13 10:31:55,279 INFO L131 PetriNetUnfolder]: For 8748/8748 co-relation queries the response was YES. [2022-12-13 10:31:55,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7289 conditions, 1632 events. 680/1632 cut-off events. For 8748/8748 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11475 event pairs, 273 based on Foata normal form. 2/1634 useless extension candidates. Maximal degree in co-relation 7217. Up to 745 conditions per place. [2022-12-13 10:31:55,287 INFO L137 encePairwiseOnDemand]: 36/45 looper letters, 140 selfloop transitions, 13 changer transitions 26/179 dead transitions. [2022-12-13 10:31:55,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 179 transitions, 1805 flow [2022-12-13 10:31:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:31:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:31:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2022-12-13 10:31:55,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3488888888888889 [2022-12-13 10:31:55,290 INFO L175 Difference]: Start difference. First operand has 98 places, 61 transitions, 556 flow. Second operand 10 states and 157 transitions. [2022-12-13 10:31:55,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 179 transitions, 1805 flow [2022-12-13 10:31:55,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 179 transitions, 1703 flow, removed 26 selfloop flow, removed 13 redundant places. [2022-12-13 10:31:55,305 INFO L231 Difference]: Finished difference. Result has 100 places, 68 transitions, 616 flow [2022-12-13 10:31:55,306 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=616, PETRI_PLACES=100, PETRI_TRANSITIONS=68} [2022-12-13 10:31:55,306 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2022-12-13 10:31:55,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:55,306 INFO L89 Accepts]: Start accepts. Operand has 100 places, 68 transitions, 616 flow [2022-12-13 10:31:55,306 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:55,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:55,307 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 68 transitions, 616 flow [2022-12-13 10:31:55,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 68 transitions, 616 flow [2022-12-13 10:31:55,336 INFO L130 PetriNetUnfolder]: 45/507 cut-off events. [2022-12-13 10:31:55,336 INFO L131 PetriNetUnfolder]: For 1854/1874 co-relation queries the response was YES. [2022-12-13 10:31:55,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 507 events. 45/507 cut-off events. For 1854/1874 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4435 event pairs, 15 based on Foata normal form. 6/489 useless extension candidates. Maximal degree in co-relation 1639. Up to 73 conditions per place. [2022-12-13 10:31:55,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 68 transitions, 616 flow [2022-12-13 10:31:55,339 INFO L226 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-13 10:31:55,340 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:55,341 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 10:31:55,341 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 68 transitions, 616 flow [2022-12-13 10:31:55,341 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 10:31:55,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:55,341 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 10:31:55,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-13 10:31:55,341 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 10:31:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1238786763, now seen corresponding path program 2 times [2022-12-13 10:31:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:55,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652732539] [2022-12-13 10:31:55,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:55,977 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 10:31:55,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:55,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652732539] [2022-12-13 10:31:55,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652732539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:55,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:55,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:55,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075463249] [2022-12-13 10:31:55,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:55,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:55,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:55,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:55,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:31:55,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 68 transitions, 616 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 10:31:55,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:55,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:31:55,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:56,447 INFO L130 PetriNetUnfolder]: 667/1605 cut-off events. [2022-12-13 10:31:56,447 INFO L131 PetriNetUnfolder]: For 8359/8359 co-relation queries the response was YES. [2022-12-13 10:31:56,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7073 conditions, 1605 events. 667/1605 cut-off events. For 8359/8359 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11256 event pairs, 253 based on Foata normal form. 2/1607 useless extension candidates. Maximal degree in co-relation 7005. Up to 745 conditions per place. [2022-12-13 10:31:56,454 INFO L137 encePairwiseOnDemand]: 35/45 looper letters, 125 selfloop transitions, 14 changer transitions 37/176 dead transitions. [2022-12-13 10:31:56,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 176 transitions, 1744 flow [2022-12-13 10:31:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:31:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:31:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2022-12-13 10:31:56,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3802469135802469 [2022-12-13 10:31:56,455 INFO L175 Difference]: Start difference. First operand has 98 places, 68 transitions, 616 flow. Second operand 9 states and 154 transitions. [2022-12-13 10:31:56,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 176 transitions, 1744 flow [2022-12-13 10:31:56,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 176 transitions, 1730 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 10:31:56,470 INFO L231 Difference]: Finished difference. Result has 106 places, 69 transitions, 661 flow [2022-12-13 10:31:56,470 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=661, PETRI_PLACES=106, PETRI_TRANSITIONS=69} [2022-12-13 10:31:56,470 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2022-12-13 10:31:56,470 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:56,470 INFO L89 Accepts]: Start accepts. Operand has 106 places, 69 transitions, 661 flow [2022-12-13 10:31:56,471 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:56,471 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:56,471 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 69 transitions, 661 flow [2022-12-13 10:31:56,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 69 transitions, 661 flow [2022-12-13 10:31:56,499 INFO L130 PetriNetUnfolder]: 39/473 cut-off events. [2022-12-13 10:31:56,500 INFO L131 PetriNetUnfolder]: For 1951/1971 co-relation queries the response was YES. [2022-12-13 10:31:56,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 473 events. 39/473 cut-off events. For 1951/1971 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4046 event pairs, 11 based on Foata normal form. 6/453 useless extension candidates. Maximal degree in co-relation 1484. Up to 61 conditions per place. [2022-12-13 10:31:56,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 69 transitions, 661 flow [2022-12-13 10:31:56,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-13 10:31:56,505 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:56,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 10:31:56,506 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 69 transitions, 661 flow [2022-12-13 10:31:56,506 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 10:31:56,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:56,506 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 10:31:56,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-13 10:31:56,507 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 10:31:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:56,507 INFO L85 PathProgramCache]: Analyzing trace with hash -965416589, now seen corresponding path program 3 times [2022-12-13 10:31:56,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:56,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138161665] [2022-12-13 10:31:56,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:56,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:56,680 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 10:31:56,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:56,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138161665] [2022-12-13 10:31:56,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138161665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:56,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:56,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:56,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282895516] [2022-12-13 10:31:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:56,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:56,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:56,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:31:56,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 69 transitions, 661 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 10:31:56,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:56,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:31:56,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:57,005 INFO L130 PetriNetUnfolder]: 627/1517 cut-off events. [2022-12-13 10:31:57,005 INFO L131 PetriNetUnfolder]: For 8517/8517 co-relation queries the response was YES. [2022-12-13 10:31:57,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6853 conditions, 1517 events. 627/1517 cut-off events. For 8517/8517 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10495 event pairs, 218 based on Foata normal form. 4/1521 useless extension candidates. Maximal degree in co-relation 6122. Up to 839 conditions per place. [2022-12-13 10:31:57,012 INFO L137 encePairwiseOnDemand]: 36/45 looper letters, 79 selfloop transitions, 15 changer transitions 34/128 dead transitions. [2022-12-13 10:31:57,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 128 transitions, 1297 flow [2022-12-13 10:31:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 10:31:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 10:31:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2022-12-13 10:31:57,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.24222222222222223 [2022-12-13 10:31:57,013 INFO L175 Difference]: Start difference. First operand has 105 places, 69 transitions, 661 flow. Second operand 10 states and 109 transitions. [2022-12-13 10:31:57,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 128 transitions, 1297 flow [2022-12-13 10:31:57,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 128 transitions, 1267 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 10:31:57,027 INFO L231 Difference]: Finished difference. Result has 111 places, 67 transitions, 639 flow [2022-12-13 10:31:57,027 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=639, PETRI_PLACES=111, PETRI_TRANSITIONS=67} [2022-12-13 10:31:57,027 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2022-12-13 10:31:57,027 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:57,027 INFO L89 Accepts]: Start accepts. Operand has 111 places, 67 transitions, 639 flow [2022-12-13 10:31:57,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:57,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:57,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 67 transitions, 639 flow [2022-12-13 10:31:57,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 67 transitions, 639 flow [2022-12-13 10:31:57,054 INFO L130 PetriNetUnfolder]: 28/419 cut-off events. [2022-12-13 10:31:57,054 INFO L131 PetriNetUnfolder]: For 1738/1759 co-relation queries the response was YES. [2022-12-13 10:31:57,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 419 events. 28/419 cut-off events. For 1738/1759 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3538 event pairs, 7 based on Foata normal form. 6/405 useless extension candidates. Maximal degree in co-relation 1387. Up to 57 conditions per place. [2022-12-13 10:31:57,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 67 transitions, 639 flow [2022-12-13 10:31:57,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-13 10:31:57,057 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:57,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 10:31:57,058 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 67 transitions, 639 flow [2022-12-13 10:31:57,058 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 10:31:57,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:57,058 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 10:31:57,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-13 10:31:57,058 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 10:31:57,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:57,058 INFO L85 PathProgramCache]: Analyzing trace with hash 300876164, now seen corresponding path program 1 times [2022-12-13 10:31:57,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:57,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794846239] [2022-12-13 10:31:57,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:57,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:57,913 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 10:31:57,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:57,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794846239] [2022-12-13 10:31:57,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794846239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:31:57,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602368664] [2022-12-13 10:31:57,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:57,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:31:57,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:31:57,915 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 10:31:57,916 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 10:31:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:58,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 10:31:58,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:31:58,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:31:58,133 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 10:31:58,149 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 10:31:58,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:31:58,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602368664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:58,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:31:58,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2022-12-13 10:31:58,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860599915] [2022-12-13 10:31:58,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:58,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:31:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:58,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:31:58,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-12-13 10:31:58,150 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 10:31:58,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 67 transitions, 639 flow. Second operand has 6 states, 5 states have (on average 4.2) 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 10:31:58,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:58,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 10:31:58,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:58,459 INFO L130 PetriNetUnfolder]: 543/1349 cut-off events. [2022-12-13 10:31:58,459 INFO L131 PetriNetUnfolder]: For 7618/7618 co-relation queries the response was YES. [2022-12-13 10:31:58,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6009 conditions, 1349 events. 543/1349 cut-off events. For 7618/7618 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9129 event pairs, 245 based on Foata normal form. 2/1351 useless extension candidates. Maximal degree in co-relation 5941. Up to 1004 conditions per place. [2022-12-13 10:31:58,465 INFO L137 encePairwiseOnDemand]: 38/45 looper letters, 76 selfloop transitions, 9 changer transitions 25/110 dead transitions. [2022-12-13 10:31:58,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 1089 flow [2022-12-13 10:31:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:31:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:31:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2022-12-13 10:31:58,466 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26944444444444443 [2022-12-13 10:31:58,466 INFO L175 Difference]: Start difference. First operand has 106 places, 67 transitions, 639 flow. Second operand 8 states and 97 transitions. [2022-12-13 10:31:58,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 110 transitions, 1089 flow [2022-12-13 10:31:58,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 110 transitions, 1026 flow, removed 17 selfloop flow, removed 11 redundant places. [2022-12-13 10:31:58,478 INFO L231 Difference]: Finished difference. Result has 103 places, 64 transitions, 579 flow [2022-12-13 10:31:58,478 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=579, PETRI_PLACES=103, PETRI_TRANSITIONS=64} [2022-12-13 10:31:58,478 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2022-12-13 10:31:58,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:58,478 INFO L89 Accepts]: Start accepts. Operand has 103 places, 64 transitions, 579 flow [2022-12-13 10:31:58,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:58,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:58,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 64 transitions, 579 flow [2022-12-13 10:31:58,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 64 transitions, 579 flow [2022-12-13 10:31:58,503 INFO L130 PetriNetUnfolder]: 24/399 cut-off events. [2022-12-13 10:31:58,503 INFO L131 PetriNetUnfolder]: For 1562/1584 co-relation queries the response was YES. [2022-12-13 10:31:58,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 399 events. 24/399 cut-off events. For 1562/1584 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3311 event pairs, 9 based on Foata normal form. 6/386 useless extension candidates. Maximal degree in co-relation 1269. Up to 55 conditions per place. [2022-12-13 10:31:58,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 64 transitions, 579 flow [2022-12-13 10:31:58,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-13 10:31:58,510 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] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|) (not (= (ite (= (mod v_~e2~0_337 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| (ite (or (<= v_~n1~0_476 v_~n2~0_482) (= v_~n2~0_482 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_231| 0)) (= v_~i1~0_221 v_~i~0_476) (= v_~i~0_475 (select (select |v_#memory_int_364| v_~f~0.base_284) (+ v_~f~0.offset_282 (* v_~i1~0_221 4))))) InVars {~n2~0=v_~n2~0_482, ~i~0=v_~i~0_476, ~f~0.base=v_~f~0.base_284, ~n1~0=v_~n1~0_476, #memory_int=|v_#memory_int_364|, ~f~0.offset=v_~f~0.offset_282, ~e2~0=v_~e2~0_337} OutVars{~n2~0=v_~n2~0_482, ~i~0=v_~i~0_475, ~f~0.base=v_~f~0.base_284, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231|, ~n1~0=v_~n1~0_476, #memory_int=|v_#memory_int_364|, ~i1~0=v_~i1~0_221, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_94|, ~f~0.offset=v_~f~0.offset_282, ~e2~0=v_~e2~0_337, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|} 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 10:31:58,590 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] L59-->L71: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|) (not (= (ite (= (mod v_~e2~0_337 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231| (ite (or (<= v_~n1~0_476 v_~n2~0_482) (= v_~n2~0_482 0)) 1 0)) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_231| 0)) (= v_~i1~0_221 v_~i~0_476) (= v_~i~0_475 (select (select |v_#memory_int_364| v_~f~0.base_284) (+ v_~f~0.offset_282 (* v_~i1~0_221 4))))) InVars {~n2~0=v_~n2~0_482, ~i~0=v_~i~0_476, ~f~0.base=v_~f~0.base_284, ~n1~0=v_~n1~0_476, #memory_int=|v_#memory_int_364|, ~f~0.offset=v_~f~0.offset_282, ~e2~0=v_~e2~0_337} OutVars{~n2~0=v_~n2~0_482, ~i~0=v_~i~0_475, ~f~0.base=v_~f~0.base_284, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_231|, ~n1~0=v_~n1~0_476, #memory_int=|v_#memory_int_364|, ~i1~0=v_~i1~0_221, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_94|, ~f~0.offset=v_~f~0.offset_282, ~e2~0=v_~e2~0_337, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_231|} 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 10:31:58,674 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:31:58,675 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-13 10:31:58,676 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 65 transitions, 608 flow [2022-12-13 10:31:58,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) 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 10:31:58,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:58,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] [2022-12-13 10:31:58,682 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 10:31:58,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-12-13 10:31:58,876 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 10:31:58,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:58,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1881058802, now seen corresponding path program 1 times [2022-12-13 10:31:58,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:58,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025241566] [2022-12-13 10:31:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:58,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:31:59,390 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 10:31:59,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:31:59,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025241566] [2022-12-13 10:31:59,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025241566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:31:59,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:31:59,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:31:59,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266241265] [2022-12-13 10:31:59,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:31:59,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:31:59,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:31:59,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:31:59,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:31:59,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 47 [2022-12-13 10:31:59,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 65 transitions, 608 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 10:31:59,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:31:59,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 47 [2022-12-13 10:31:59,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:31:59,768 INFO L130 PetriNetUnfolder]: 532/1322 cut-off events. [2022-12-13 10:31:59,769 INFO L131 PetriNetUnfolder]: For 7618/7618 co-relation queries the response was YES. [2022-12-13 10:31:59,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5838 conditions, 1322 events. 532/1322 cut-off events. For 7618/7618 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9024 event pairs, 270 based on Foata normal form. 4/1326 useless extension candidates. Maximal degree in co-relation 5780. Up to 713 conditions per place. [2022-12-13 10:31:59,774 INFO L137 encePairwiseOnDemand]: 35/47 looper letters, 83 selfloop transitions, 8 changer transitions 47/138 dead transitions. [2022-12-13 10:31:59,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 138 transitions, 1398 flow [2022-12-13 10:31:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:31:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:31:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2022-12-13 10:31:59,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3351063829787234 [2022-12-13 10:31:59,775 INFO L175 Difference]: Start difference. First operand has 101 places, 65 transitions, 608 flow. Second operand 8 states and 126 transitions. [2022-12-13 10:31:59,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 138 transitions, 1398 flow [2022-12-13 10:31:59,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 138 transitions, 1351 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 10:31:59,785 INFO L231 Difference]: Finished difference. Result has 103 places, 62 transitions, 558 flow [2022-12-13 10:31:59,785 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=558, PETRI_PLACES=103, PETRI_TRANSITIONS=62} [2022-12-13 10:31:59,785 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 62 predicate places. [2022-12-13 10:31:59,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:31:59,785 INFO L89 Accepts]: Start accepts. Operand has 103 places, 62 transitions, 558 flow [2022-12-13 10:31:59,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:31:59,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:31:59,786 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 62 transitions, 558 flow [2022-12-13 10:31:59,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 62 transitions, 558 flow [2022-12-13 10:31:59,810 INFO L130 PetriNetUnfolder]: 21/352 cut-off events. [2022-12-13 10:31:59,810 INFO L131 PetriNetUnfolder]: For 1447/1468 co-relation queries the response was YES. [2022-12-13 10:31:59,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 352 events. 21/352 cut-off events. For 1447/1468 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2829 event pairs, 9 based on Foata normal form. 4/338 useless extension candidates. Maximal degree in co-relation 1121. Up to 50 conditions per place. [2022-12-13 10:31:59,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 62 transitions, 558 flow [2022-12-13 10:31:59,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-13 10:31:59,816 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:31:59,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-13 10:31:59,817 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 62 transitions, 558 flow [2022-12-13 10:31:59,817 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 10:31:59,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:31:59,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 10:31:59,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-13 10:31:59,818 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 10:31:59,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:31:59,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1691123558, now seen corresponding path program 2 times [2022-12-13 10:31:59,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:31:59,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65201275] [2022-12-13 10:31:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:31:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:31:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:00,577 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 10:32:00,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:00,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65201275] [2022-12-13 10:32:00,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65201275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:32:00,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800962555] [2022-12-13 10:32:00,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 10:32:00,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:32:00,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:32:00,579 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 10:32:00,581 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 10:32:00,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 10:32:00,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 10:32:00,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 10:32:00,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:32:00,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 10:32:00,902 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 10:32:00,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:32:00,934 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 10:32:00,939 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 10:32:00,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:32:00,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800962555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:32:00,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:32:00,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2022-12-13 10:32:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111136360] [2022-12-13 10:32:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:32:00,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:32:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:00,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:32:00,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-12-13 10:32:00,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 10:32:00,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 62 transitions, 558 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 10:32:00,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:00,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 10:32:00,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:01,191 INFO L130 PetriNetUnfolder]: 450/1118 cut-off events. [2022-12-13 10:32:01,192 INFO L131 PetriNetUnfolder]: For 6267/6267 co-relation queries the response was YES. [2022-12-13 10:32:01,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 1118 events. 450/1118 cut-off events. For 6267/6267 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7176 event pairs, 203 based on Foata normal form. 2/1120 useless extension candidates. Maximal degree in co-relation 4810. Up to 595 conditions per place. [2022-12-13 10:32:01,196 INFO L137 encePairwiseOnDemand]: 36/46 looper letters, 45 selfloop transitions, 8 changer transitions 47/100 dead transitions. [2022-12-13 10:32:01,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 100 transitions, 943 flow [2022-12-13 10:32:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:32:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:32:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-12-13 10:32:01,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2418478260869565 [2022-12-13 10:32:01,196 INFO L175 Difference]: Start difference. First operand has 99 places, 62 transitions, 558 flow. Second operand 8 states and 89 transitions. [2022-12-13 10:32:01,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 100 transitions, 943 flow [2022-12-13 10:32:01,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 100 transitions, 917 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 10:32:01,207 INFO L231 Difference]: Finished difference. Result has 100 places, 47 transitions, 424 flow [2022-12-13 10:32:01,207 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=424, PETRI_PLACES=100, PETRI_TRANSITIONS=47} [2022-12-13 10:32:01,207 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2022-12-13 10:32:01,207 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:01,207 INFO L89 Accepts]: Start accepts. Operand has 100 places, 47 transitions, 424 flow [2022-12-13 10:32:01,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:01,208 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:01,208 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 47 transitions, 424 flow [2022-12-13 10:32:01,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 47 transitions, 424 flow [2022-12-13 10:32:01,226 INFO L130 PetriNetUnfolder]: 14/286 cut-off events. [2022-12-13 10:32:01,226 INFO L131 PetriNetUnfolder]: For 1239/1258 co-relation queries the response was YES. [2022-12-13 10:32:01,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 286 events. 14/286 cut-off events. For 1239/1258 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2143 event pairs, 6 based on Foata normal form. 4/272 useless extension candidates. Maximal degree in co-relation 830. Up to 36 conditions per place. [2022-12-13 10:32:01,227 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 47 transitions, 424 flow [2022-12-13 10:32:01,227 INFO L226 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-13 10:32:01,230 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:32:01,231 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-13 10:32:01,231 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 47 transitions, 424 flow [2022-12-13 10:32:01,231 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 10:32:01,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:32:01,231 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 10:32:01,237 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 10:32:01,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:32:01,432 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 10:32:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:32:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash -174443470, now seen corresponding path program 1 times [2022-12-13 10:32:01,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:32:01,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028252538] [2022-12-13 10:32:01,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:32:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:02,096 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 10:32:02,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:02,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028252538] [2022-12-13 10:32:02,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028252538] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 10:32:02,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915017468] [2022-12-13 10:32:02,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:02,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 10:32:02,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:32:02,098 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 10:32:02,099 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 10:32:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:02,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 10:32:02,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 10:32:02,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 10:32:02,334 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 10:32:02,340 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 10:32:02,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 10:32:02,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915017468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:32:02,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 10:32:02,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2022-12-13 10:32:02,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842289889] [2022-12-13 10:32:02,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:32:02,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:32:02,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:02,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:32:02,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 10:32:02,341 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-13 10:32:02,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 47 transitions, 424 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 10:32:02,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:02,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-13 10:32:02,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:02,572 INFO L130 PetriNetUnfolder]: 365/927 cut-off events. [2022-12-13 10:32:02,572 INFO L131 PetriNetUnfolder]: For 5581/5581 co-relation queries the response was YES. [2022-12-13 10:32:02,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 927 events. 365/927 cut-off events. For 5581/5581 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5740 event pairs, 216 based on Foata normal form. 4/931 useless extension candidates. Maximal degree in co-relation 3425. Up to 690 conditions per place. [2022-12-13 10:32:02,576 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 30 selfloop transitions, 4 changer transitions 40/74 dead transitions. [2022-12-13 10:32:02,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 74 transitions, 714 flow [2022-12-13 10:32:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:32:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:32:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-13 10:32:02,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3063063063063063 [2022-12-13 10:32:02,576 INFO L175 Difference]: Start difference. First operand has 88 places, 47 transitions, 424 flow. Second operand 6 states and 68 transitions. [2022-12-13 10:32:02,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 74 transitions, 714 flow [2022-12-13 10:32:02,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 74 transitions, 587 flow, removed 12 selfloop flow, removed 19 redundant places. [2022-12-13 10:32:02,583 INFO L231 Difference]: Finished difference. Result has 75 places, 34 transitions, 224 flow [2022-12-13 10:32:02,583 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=75, PETRI_TRANSITIONS=34} [2022-12-13 10:32:02,583 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2022-12-13 10:32:02,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:02,583 INFO L89 Accepts]: Start accepts. Operand has 75 places, 34 transitions, 224 flow [2022-12-13 10:32:02,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:02,584 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:02,584 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 34 transitions, 224 flow [2022-12-13 10:32:02,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 34 transitions, 224 flow [2022-12-13 10:32:02,590 INFO L130 PetriNetUnfolder]: 5/88 cut-off events. [2022-12-13 10:32:02,590 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2022-12-13 10:32:02,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 88 events. 5/88 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 292 event pairs, 2 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 244. Up to 11 conditions per place. [2022-12-13 10:32:02,591 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 34 transitions, 224 flow [2022-12-13 10:32:02,591 INFO L226 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-13 10:32:02,698 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [714] $Ultimate##0-->L97: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_95| 0)) (= v_~n2~0_292 (+ v_~tmp2~0_145 1)) (= (ite (= (mod v_~e1~0_158 256) 0) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95|) (= v_~e2~0_215 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_95|) (= v_~tmp2~0_145 v_~n1~0_311)) InVars {~n1~0=v_~n1~0_311, ~e1~0=v_~e1~0_158} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_95|, ~n2~0=v_~n2~0_292, ~n1~0=v_~n1~0_311, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_95|, ~tmp2~0=v_~tmp2~0_145, ~e2~0=v_~e2~0_215, ~e1~0=v_~e1~0_158} 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 10:32:02,743 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [888] $Ultimate##0-->thread1EXIT: Formula: (and (= (+ v_~tmp2~0_520 1) v_~n2~0_1198) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_603| 0)) (= v_~tmp2~0_520 v_~n1~0_1021) (= v_~e2~0_776 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_603| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_603|) (= (ite (= 0 (mod v_~e1~0_650 256)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_603|) (= |v_thread1Thread1of1ForFork1_#res#1.base_85| 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_85| 0) (= v_~n1~0_1020 0)) InVars {~n1~0=v_~n1~0_1021, ~e1~0=v_~e1~0_650} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_603|, ~n2~0=v_~n2~0_1198, ~n1~0=v_~n1~0_1020, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_603|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_85|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_85|, ~tmp2~0=v_~tmp2~0_520, ~e2~0=v_~e2~0_776, ~e1~0=v_~e1~0_650} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~n1~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~tmp2~0, ~e2~0] and [883] L97-->L106: Formula: (and (= v_~i2~0_329 v_~i~0_1287) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_589| 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_589| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_589|) (= (select (select |v_#memory_int_842| v_~f~0.base_700) (+ v_~f~0.offset_696 (* v_~i2~0_329 4))) v_~i~0_1286) (= (ite (or (= v_~n1~0_994 0) (< v_~n2~0_1164 v_~n1~0_994)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_589|)) InVars {~n2~0=v_~n2~0_1164, ~i~0=v_~i~0_1287, ~f~0.base=v_~f~0.base_700, ~n1~0=v_~n1~0_994, #memory_int=|v_#memory_int_842|, ~f~0.offset=v_~f~0.offset_696} OutVars{thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_223|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_589|, ~n2~0=v_~n2~0_1164, ~i~0=v_~i~0_1286, ~f~0.base=v_~f~0.base_700, ~n1~0=v_~n1~0_994, #memory_int=|v_#memory_int_842|, ~i2~0=v_~i2~0_329, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_589|, ~f~0.offset=v_~f~0.offset_696} 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] [2022-12-13 10:32:02,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [757] L106-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_61| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_209| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_209|) (= |v_thread2Thread1of1ForFork2_#res#1.base_61| 0) (= (ite (and (<= 0 v_~i~0_493) (< v_~i~0_493 v_~n~0_234)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_209|) (= v_~n2~0_496 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_209| 0))) InVars {~i~0=v_~i~0_493, ~n~0=v_~n~0_234} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_209|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_61|, ~n2~0=v_~n2~0_496, ~i~0=v_~i~0_493, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_209|, ~n~0=v_~n~0_234, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_61|} 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 [768] L88-->L103: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_247| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_247|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_247| 0)) (not (= (ite (= (mod v_~e1~0_298 256) 0) 1 0) 0)) (= (+ v_~tmp2~0_232 1) v_~n2~0_536) (= v_~i2~0_173 v_~i~0_521) (= v_~e2~0_353 0) (= (ite (or (< v_~n2~0_536 v_~n1~0_516) (= v_~n1~0_516 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_247|)) InVars {~i~0=v_~i~0_521, ~n1~0=v_~n1~0_516, ~tmp2~0=v_~tmp2~0_232, ~e1~0=v_~e1~0_298} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_247|, ~n2~0=v_~n2~0_536, ~i~0=v_~i~0_521, ~n1~0=v_~n1~0_516, ~i2~0=v_~i2~0_173, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_247|, ~tmp2~0=v_~tmp2~0_232, ~e2~0=v_~e2~0_353, ~e1~0=v_~e1~0_298} 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 10:32:02,975 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [686] $Ultimate##0-->thread1EXIT: Formula: (and (= v_~e2~0_137 1) (= v_~n1~0_178 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_20| 0) (= v_~n1~0_179 v_~tmp2~0_98) (= |v_thread1Thread1of1ForFork1_#res#1.base_20| 0)) InVars {~n1~0=v_~n1~0_179} OutVars{~n1~0=v_~n1~0_178, 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_98, ~e2~0=v_~e2~0_137} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~tmp2~0, ~e2~0] and [767] L88-->L103: Formula: (and (= v_~e2~0_351 0) (= v_~i2~0_171 v_~i~0_519) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_245| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_245|) (not (= (ite (= (mod v_~e1~0_296 256) 0) 1 0) 0)) (= (ite (or (= v_~n1~0_514 0) (< v_~n2~0_534 v_~n1~0_514)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_245|) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_245| 0)) (= (+ v_~tmp2~0_230 1) v_~n2~0_534)) InVars {~i~0=v_~i~0_519, ~n1~0=v_~n1~0_514, ~tmp2~0=v_~tmp2~0_230, ~e1~0=v_~e1~0_296} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_245|, ~n2~0=v_~n2~0_534, ~i~0=v_~i~0_519, ~n1~0=v_~n1~0_514, ~i2~0=v_~i2~0_171, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_245|, ~tmp2~0=v_~tmp2~0_230, ~e2~0=v_~e2~0_351, ~e1~0=v_~e1~0_296} 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 10:32:03,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [686] $Ultimate##0-->thread1EXIT: Formula: (and (= v_~e2~0_137 1) (= v_~n1~0_178 0) (= |v_thread1Thread1of1ForFork1_#res#1.offset_20| 0) (= v_~n1~0_179 v_~tmp2~0_98) (= |v_thread1Thread1of1ForFork1_#res#1.base_20| 0)) InVars {~n1~0=v_~n1~0_179} OutVars{~n1~0=v_~n1~0_178, 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_98, ~e2~0=v_~e2~0_137} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~tmp2~0, ~e2~0] and [891] L106-->L103: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_611| 0)) (not (= (ite (= 0 (mod v_~e1~0_656 256)) 1 0) 0)) (= v_~e2~0_784 0) (= v_~i2~0_335 v_~i~0_1343) (= (+ v_~tmp2~0_526 1) v_~n2~0_1204) (= (ite (or (= v_~n1~0_1030 0) (< v_~n2~0_1204 v_~n1~0_1030)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_611|) (= |v_thread2Thread1of1ForFork2_#res#1.base_121| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_611| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_611|) (not (= (ite (and (<= 0 v_~i~0_1343) (< v_~i~0_1343 v_~n~0_460)) 1 0) 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_121| 0)) InVars {~i~0=v_~i~0_1343, ~n1~0=v_~n1~0_1030, ~tmp2~0=v_~tmp2~0_526, ~n~0=v_~n~0_460, ~e1~0=v_~e1~0_656} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_611|, ~n2~0=v_~n2~0_1204, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_121|, ~i~0=v_~i~0_1343, ~n1~0=v_~n1~0_1030, ~i2~0=v_~i2~0_335, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_611|, ~tmp2~0=v_~tmp2~0_526, ~n~0=v_~n~0_460, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_121|, ~e2~0=v_~e2~0_784, ~e1~0=v_~e1~0_656} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, thread2Thread1of1ForFork2_#res#1.offset, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#res#1.base, ~e2~0] [2022-12-13 10:32:03,178 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 10:32:03,197 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [889] $Ultimate##0-->L106: Formula: (let ((.cse0 (= v_~n1~0_1024 0))) (and (not (= (ite (= (mod v_~e1~0_652 256) 0) 1 0) 0)) (= v_~i2~0_331 v_~i~0_1338) (= (+ v_~tmp2~0_522 1) v_~n2~0_1200) (= v_~i~0_1337 (select (select |v_#memory_int_865| v_~f~0.base_723) (+ v_~f~0.offset_721 (* v_~i2~0_331 4)))) .cse0 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_605| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_605|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_605| (ite (or (< v_~n2~0_1200 v_~n1~0_1024) .cse0) 1 0)) (= v_~tmp2~0_522 v_~n1~0_1025) (= |v_thread1Thread1of1ForFork1_#res#1.offset_87| 0) (= v_~e2~0_778 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_87| 0))) InVars {~i~0=v_~i~0_1338, ~f~0.base=v_~f~0.base_723, ~n1~0=v_~n1~0_1025, #memory_int=|v_#memory_int_865|, ~f~0.offset=v_~f~0.offset_721, ~e1~0=v_~e1~0_652} OutVars{~n2~0=v_~n2~0_1200, ~i~0=v_~i~0_1337, ~f~0.base=v_~f~0.base_723, ~n1~0=v_~n1~0_1024, ~i2~0=v_~i2~0_331, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_605|, ~f~0.offset=v_~f~0.offset_721, ~e2~0=v_~e2~0_778, ~e1~0=v_~e1~0_652, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_225|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_605|, #memory_int=|v_#memory_int_865|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_87|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_87|, ~tmp2~0=v_~tmp2~0_522} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~n2~0, ~i~0, ~n1~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~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 10:32:03,545 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 10:32:03,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 963 [2022-12-13 10:32:03,546 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 30 transitions, 255 flow [2022-12-13 10:32:03,546 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 10:32:03,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:32:03,546 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 10:32:03,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 10:32:03,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2022-12-13 10:32:03,747 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 10:32:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:32:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash -683347997, now seen corresponding path program 1 times [2022-12-13 10:32:03,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:32:03,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280663156] [2022-12-13 10:32:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:03,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:32:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:04,669 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 10:32:04,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:04,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280663156] [2022-12-13 10:32:04,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280663156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:32:04,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:32:04,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:32:04,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478286485] [2022-12-13 10:32:04,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:32:04,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:32:04,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:04,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:32:04,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:32:04,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-13 10:32:04,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 30 transitions, 255 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 10:32:04,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:04,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-13 10:32:04,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:04,833 INFO L130 PetriNetUnfolder]: 75/197 cut-off events. [2022-12-13 10:32:04,833 INFO L131 PetriNetUnfolder]: For 1067/1067 co-relation queries the response was YES. [2022-12-13 10:32:04,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 197 events. 75/197 cut-off events. For 1067/1067 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 732 event pairs, 48 based on Foata normal form. 2/199 useless extension candidates. Maximal degree in co-relation 854. Up to 98 conditions per place. [2022-12-13 10:32:04,834 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 20 selfloop transitions, 4 changer transitions 31/55 dead transitions. [2022-12-13 10:32:04,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 502 flow [2022-12-13 10:32:04,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:32:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:32:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-12-13 10:32:04,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2022-12-13 10:32:04,835 INFO L175 Difference]: Start difference. First operand has 59 places, 30 transitions, 255 flow. Second operand 8 states and 56 transitions. [2022-12-13 10:32:04,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 502 flow [2022-12-13 10:32:04,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 305 flow, removed 52 selfloop flow, removed 23 redundant places. [2022-12-13 10:32:04,836 INFO L231 Difference]: Finished difference. Result has 46 places, 24 transitions, 105 flow [2022-12-13 10:32:04,836 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=105, PETRI_PLACES=46, PETRI_TRANSITIONS=24} [2022-12-13 10:32:04,836 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-12-13 10:32:04,836 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:04,836 INFO L89 Accepts]: Start accepts. Operand has 46 places, 24 transitions, 105 flow [2022-12-13 10:32:04,836 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:04,836 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:04,837 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 24 transitions, 105 flow [2022-12-13 10:32:04,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 24 transitions, 105 flow [2022-12-13 10:32:04,840 INFO L130 PetriNetUnfolder]: 3/36 cut-off events. [2022-12-13 10:32:04,840 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 10:32:04,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 36 events. 3/36 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 68. Up to 5 conditions per place. [2022-12-13 10:32:04,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 24 transitions, 105 flow [2022-12-13 10:32:04,840 INFO L226 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-13 10:32:08,498 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [896] $Ultimate##0-->L155-3: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_621| 0)) (= (+ |v_#pthreadsForks_251| 1) |v_#pthreadsForks_250|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_621| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_621|) (= v_~i~0_1355 (select (select |v_#memory_int_876| v_~f~0.base_729) (+ v_~f~0.offset_727 (* v_~i2~0_345 4)))) (= |v_ULTIMATE.start_main_#t~pre17#1_133| |v_#pthreadsForks_251|) (= v_~i2~0_345 v_~i~0_1356) (= v_~tmp2~0_534 v_~n1~0_1044) (= v_~e2~0_796 0) (= (ite (or (= v_~n1~0_1044 0) (< v_~n2~0_1214 v_~n1~0_1044)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_621|) (= (+ v_~tmp2~0_534 1) v_~n2~0_1214) (not (= (ite (= (mod v_~e1~0_664 256) 0) 1 0) 0)) (= (store |v_#memory_int_876| |v_ULTIMATE.start_main_~#t3~0#1.base_217| (store (select |v_#memory_int_876| |v_ULTIMATE.start_main_~#t3~0#1.base_217|) |v_ULTIMATE.start_main_~#t3~0#1.offset_129| |v_ULTIMATE.start_main_#t~pre17#1_133|)) |v_#memory_int_875|)) InVars {#pthreadsForks=|v_#pthreadsForks_251|, ~i~0=v_~i~0_1356, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_129|, ~f~0.base=v_~f~0.base_729, ~n1~0=v_~n1~0_1044, #memory_int=|v_#memory_int_876|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_217|, ~f~0.offset=v_~f~0.offset_727, ~e1~0=v_~e1~0_664} OutVars{~n2~0=v_~n2~0_1214, ~i~0=v_~i~0_1355, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_129|, ~f~0.base=v_~f~0.base_729, ~n1~0=v_~n1~0_1044, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_217|, ~i2~0=v_~i2~0_345, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_621|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_153|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_133|, ~f~0.offset=v_~f~0.offset_727, ~e2~0=v_~e2~0_796, ~e1~0=v_~e1~0_664, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_123|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_231|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_621|, #pthreadsForks=|v_#pthreadsForks_250|, #memory_int=|v_#memory_int_875|, ~tmp2~0=v_~tmp2~0_534} AuxVars[] AssignedVars[~n2~0, ~i~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1, ~e2~0, ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, #memory_int, ~tmp2~0] and [757] L106-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res#1.offset_61| 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_209| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_209|) (= |v_thread2Thread1of1ForFork2_#res#1.base_61| 0) (= (ite (and (<= 0 v_~i~0_493) (< v_~i~0_493 v_~n~0_234)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_209|) (= v_~n2~0_496 0) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_209| 0))) InVars {~i~0=v_~i~0_493, ~n~0=v_~n~0_234} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_209|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_61|, ~n2~0=v_~n2~0_496, ~i~0=v_~i~0_493, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_209|, ~n~0=v_~n~0_234, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_61|} 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 10:32:08,609 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [897] $Ultimate##0-->L155-3: Formula: (let ((.cse0 (= v_~n1~0_1046 0))) (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_95| 0) (= (+ |v_#pthreadsForks_255| 1) |v_#pthreadsForks_254|) (= v_~e2~0_798 0) (= v_~i2~0_347 v_~i~0_1360) (= (+ v_~tmp2~0_536 1) v_~n2~0_1216) (not (= (ite (= (mod v_~e1~0_666 256) 0) 1 0) 0)) (= v_~tmp2~0_536 v_~n1~0_1047) (= (store |v_#memory_int_880| |v_ULTIMATE.start_main_~#t3~0#1.base_219| (store (select |v_#memory_int_880| |v_ULTIMATE.start_main_~#t3~0#1.base_219|) |v_ULTIMATE.start_main_~#t3~0#1.offset_131| |v_ULTIMATE.start_main_#t~pre17#1_135|)) |v_#memory_int_879|) (= |v_ULTIMATE.start_main_#t~pre17#1_135| |v_#pthreadsForks_255|) .cse0 (= |v_thread1Thread1of1ForFork1_#res#1.base_95| 0) (= v_~i~0_1359 (select (select |v_#memory_int_880| v_~f~0.base_731) (+ v_~f~0.offset_729 (* v_~i2~0_347 4)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_623| (ite (or (< v_~n2~0_1216 v_~n1~0_1046) .cse0) 1 0)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_623| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_623|))) InVars {#pthreadsForks=|v_#pthreadsForks_255|, ~i~0=v_~i~0_1360, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_131|, ~f~0.base=v_~f~0.base_731, ~n1~0=v_~n1~0_1047, #memory_int=|v_#memory_int_880|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_219|, ~f~0.offset=v_~f~0.offset_729, ~e1~0=v_~e1~0_666} OutVars{~n2~0=v_~n2~0_1216, ~i~0=v_~i~0_1359, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_131|, ~f~0.base=v_~f~0.base_731, ~n1~0=v_~n1~0_1046, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_219|, ~i2~0=v_~i2~0_347, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_623|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_155|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_135|, ~f~0.offset=v_~f~0.offset_729, ~e2~0=v_~e2~0_798, ~e1~0=v_~e1~0_666, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_125|, 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_623|, #pthreadsForks=|v_#pthreadsForks_254|, #memory_int=|v_#memory_int_879|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_95|, ~tmp2~0=v_~tmp2~0_536, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_95|} AuxVars[] AssignedVars[~n2~0, ~i~0, ~n1~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1, ~e2~0, ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, #memory_int, thread1Thread1of1ForFork1_#res#1.offset, ~tmp2~0, thread1Thread1of1ForFork1_#res#1.base] and [758] L106-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_211| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_211|) (= v_~n2~0_498 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_211| (ite (and (< v_~i~0_495 v_~n~0_236) (<= 0 v_~i~0_495)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_211| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_63| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_63| 0)) InVars {~i~0=v_~i~0_495, ~n~0=v_~n~0_236} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_211|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_63|, ~n2~0=v_~n2~0_498, ~i~0=v_~i~0_495, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_211|, ~n~0=v_~n~0_236, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_63|} 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 10:32:08,729 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [895] $Ultimate##0-->L155-3: Formula: (let ((.cse0 (= v_~n1~0_1040 0))) (and (not (= (ite (= (mod v_~e1~0_662 256) 0) 1 0) 0)) (= |v_thread1Thread1of1ForFork1_#res#1.base_93| 0) (= |v_#pthreadsForks_246| (+ |v_#pthreadsForks_247| 1)) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_619| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_619|) (= v_~i2~0_343 v_~i~0_1352) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_619| (ite (or .cse0 (< v_~n2~0_1212 v_~n1~0_1040)) 1 0)) (= v_~e2~0_794 0) .cse0 (= (select (select |v_#memory_int_872| v_~f~0.base_727) (+ v_~f~0.offset_725 (* v_~i2~0_343 4))) v_~i~0_1351) (= |v_ULTIMATE.start_main_#t~pre17#1_131| |v_#pthreadsForks_247|) (= |v_#memory_int_871| (store |v_#memory_int_872| |v_ULTIMATE.start_main_~#t3~0#1.base_215| (store (select |v_#memory_int_872| |v_ULTIMATE.start_main_~#t3~0#1.base_215|) |v_ULTIMATE.start_main_~#t3~0#1.offset_127| |v_ULTIMATE.start_main_#t~pre17#1_131|))) (= |v_thread1Thread1of1ForFork1_#res#1.offset_93| 0) (= v_~tmp2~0_532 v_~n1~0_1041) (= v_~n2~0_1212 (+ v_~tmp2~0_532 1)))) InVars {#pthreadsForks=|v_#pthreadsForks_247|, ~i~0=v_~i~0_1352, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_127|, ~f~0.base=v_~f~0.base_727, ~n1~0=v_~n1~0_1041, #memory_int=|v_#memory_int_872|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_215|, ~f~0.offset=v_~f~0.offset_725, ~e1~0=v_~e1~0_662} OutVars{~n2~0=v_~n2~0_1212, ~i~0=v_~i~0_1351, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_127|, ~f~0.base=v_~f~0.base_727, ~n1~0=v_~n1~0_1040, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_215|, ~i2~0=v_~i2~0_343, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_619|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_151|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_131|, ~f~0.offset=v_~f~0.offset_725, ~e2~0=v_~e2~0_794, ~e1~0=v_~e1~0_662, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_121|, thread2Thread1of1ForFork2_#t~mem2#1=|v_thread2Thread1of1ForFork2_#t~mem2#1_229|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_619|, #pthreadsForks=|v_#pthreadsForks_246|, #memory_int=|v_#memory_int_871|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_93|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_93|, ~tmp2~0=v_~tmp2~0_532} AuxVars[] AssignedVars[~n2~0, ~i~0, ~n1~0, ~i2~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1, ~e2~0, ULTIMATE.start_main_#t~nondet16#1, thread2Thread1of1ForFork2_#t~mem2#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #pthreadsForks, #memory_int, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, ~tmp2~0] and [758] L106-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_211| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_211|) (= v_~n2~0_498 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_211| (ite (and (< v_~i~0_495 v_~n~0_236) (<= 0 v_~i~0_495)) 1 0)) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_211| 0)) (= |v_thread2Thread1of1ForFork2_#res#1.offset_63| 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_63| 0)) InVars {~i~0=v_~i~0_495, ~n~0=v_~n~0_236} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_211|, thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_63|, ~n2~0=v_~n2~0_498, ~i~0=v_~i~0_495, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_211|, ~n~0=v_~n~0_236, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_63|} 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 10:32:08,853 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 10:32:08,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4018 [2022-12-13 10:32:08,854 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 88 flow [2022-12-13 10:32:08,854 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 10:32:08,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:32:08,854 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 10:32:08,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-13 10:32:08,854 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 10:32:08,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:32:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1117401760, now seen corresponding path program 1 times [2022-12-13 10:32:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:32:08,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684025423] [2022-12-13 10:32:08,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:08,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:32:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:10,105 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 10:32:10,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:10,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684025423] [2022-12-13 10:32:10,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684025423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:32:10,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:32:10,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:32:10,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788778508] [2022-12-13 10:32:10,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:32:10,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:32:10,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:10,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:32:10,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:32:10,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:32:10,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 88 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 10:32:10,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:10,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:32:10,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:10,328 INFO L130 PetriNetUnfolder]: 29/111 cut-off events. [2022-12-13 10:32:10,329 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-12-13 10:32:10,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 111 events. 29/111 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 367 event pairs, 14 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 302. Up to 56 conditions per place. [2022-12-13 10:32:10,329 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 17 selfloop transitions, 4 changer transitions 24/45 dead transitions. [2022-12-13 10:32:10,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 272 flow [2022-12-13 10:32:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:32:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:32:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-12-13 10:32:10,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25555555555555554 [2022-12-13 10:32:10,330 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 88 flow. Second operand 9 states and 46 transitions. [2022-12-13 10:32:10,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 272 flow [2022-12-13 10:32:10,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 211 flow, removed 19 selfloop flow, removed 11 redundant places. [2022-12-13 10:32:10,331 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:10,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-13 10:32:10,331 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2022-12-13 10:32:10,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:10,331 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:10,331 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:10,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:10,331 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:10,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:10,334 INFO L130 PetriNetUnfolder]: 3/36 cut-off events. [2022-12-13 10:32:10,335 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 10:32:10,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 36 events. 3/36 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 2 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 61. Up to 8 conditions per place. [2022-12-13 10:32:10,335 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:10,335 INFO L226 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-13 10:32:15,033 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:32:15,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4703 [2022-12-13 10:32:15,034 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 77 flow [2022-12-13 10:32:15,034 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 10:32:15,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:32:15,034 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 10:32:15,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-13 10:32:15,034 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 10:32:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:32:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash 942269766, now seen corresponding path program 1 times [2022-12-13 10:32:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:32:15,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697559836] [2022-12-13 10:32:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:32:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:15,726 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 10:32:15,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:15,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697559836] [2022-12-13 10:32:15,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697559836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:32:15,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:32:15,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:32:15,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882930753] [2022-12-13 10:32:15,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:32:15,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:32:15,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:15,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:32:15,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:32:15,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:32:15,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 77 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 10:32:15,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:15,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:32:15,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:15,919 INFO L130 PetriNetUnfolder]: 29/111 cut-off events. [2022-12-13 10:32:15,919 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-13 10:32:15,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 111 events. 29/111 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 369 event pairs, 14 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 295. Up to 56 conditions per place. [2022-12-13 10:32:15,919 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 17 selfloop transitions, 4 changer transitions 24/45 dead transitions. [2022-12-13 10:32:15,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 249 flow [2022-12-13 10:32:15,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:32:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:32:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-12-13 10:32:15,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25555555555555554 [2022-12-13 10:32:15,920 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 77 flow. Second operand 9 states and 46 transitions. [2022-12-13 10:32:15,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 249 flow [2022-12-13 10:32:15,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 211 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-13 10:32:15,921 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:15,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-13 10:32:15,921 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2022-12-13 10:32:15,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:15,921 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:15,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:15,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:15,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:15,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:15,925 INFO L130 PetriNetUnfolder]: 3/36 cut-off events. [2022-12-13 10:32:15,925 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 10:32:15,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 36 events. 3/36 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 2 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 61. Up to 8 conditions per place. [2022-12-13 10:32:15,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:15,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-13 10:32:21,965 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:32:21,966 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6045 [2022-12-13 10:32:21,966 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 77 flow [2022-12-13 10:32:21,966 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 10:32:21,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:32:21,966 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 10:32:21,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-13 10:32:21,966 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 10:32:21,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:32:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2000635047, now seen corresponding path program 1 times [2022-12-13 10:32:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:32:21,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178715004] [2022-12-13 10:32:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:21,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:32:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:24,429 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 10:32:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:24,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178715004] [2022-12-13 10:32:24,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178715004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:32:24,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:32:24,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:32:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488408744] [2022-12-13 10:32:24,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:32:24,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:32:24,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:24,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:32:24,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:32:24,430 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:32:24,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 77 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 10:32:24,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:24,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:32:24,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:24,603 INFO L130 PetriNetUnfolder]: 29/111 cut-off events. [2022-12-13 10:32:24,603 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-13 10:32:24,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 111 events. 29/111 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 369 event pairs, 14 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 295. Up to 56 conditions per place. [2022-12-13 10:32:24,603 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 17 selfloop transitions, 4 changer transitions 24/45 dead transitions. [2022-12-13 10:32:24,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 249 flow [2022-12-13 10:32:24,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:32:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:32:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-12-13 10:32:24,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25555555555555554 [2022-12-13 10:32:24,604 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 77 flow. Second operand 9 states and 46 transitions. [2022-12-13 10:32:24,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 249 flow [2022-12-13 10:32:24,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 211 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-13 10:32:24,605 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:24,605 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-13 10:32:24,605 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2022-12-13 10:32:24,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:24,605 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:24,605 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:24,606 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:24,606 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:24,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:24,609 INFO L130 PetriNetUnfolder]: 3/36 cut-off events. [2022-12-13 10:32:24,609 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 10:32:24,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 36 events. 3/36 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 2 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 61. Up to 8 conditions per place. [2022-12-13 10:32:24,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:24,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-13 10:32:30,352 WARN L233 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 218 DAG size of output: 216 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 10:32:34,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:32:34,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9819 [2022-12-13 10:32:34,424 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 77 flow [2022-12-13 10:32:34,424 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 10:32:34,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:32:34,424 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 10:32:34,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-13 10:32:34,424 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 10:32:34,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:32:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash -941022552, now seen corresponding path program 1 times [2022-12-13 10:32:34,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:32:34,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325515238] [2022-12-13 10:32:34,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:34,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:32:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:35,146 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 10:32:35,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:35,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325515238] [2022-12-13 10:32:35,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325515238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:32:35,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:32:35,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:32:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761744868] [2022-12-13 10:32:35,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:32:35,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:32:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:35,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:32:35,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:32:35,147 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:32:35,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 77 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 10:32:35,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:35,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:32:35,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:35,310 INFO L130 PetriNetUnfolder]: 29/111 cut-off events. [2022-12-13 10:32:35,310 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-13 10:32:35,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 111 events. 29/111 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 367 event pairs, 14 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 295. Up to 56 conditions per place. [2022-12-13 10:32:35,310 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 17 selfloop transitions, 4 changer transitions 24/45 dead transitions. [2022-12-13 10:32:35,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 249 flow [2022-12-13 10:32:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:32:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:32:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-12-13 10:32:35,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25555555555555554 [2022-12-13 10:32:35,311 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 77 flow. Second operand 9 states and 46 transitions. [2022-12-13 10:32:35,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 249 flow [2022-12-13 10:32:35,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 211 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-13 10:32:35,312 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:35,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-13 10:32:35,312 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2022-12-13 10:32:35,312 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:35,312 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:35,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:35,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:35,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:35,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:35,315 INFO L130 PetriNetUnfolder]: 3/36 cut-off events. [2022-12-13 10:32:35,315 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 10:32:35,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 36 events. 3/36 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 2 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 61. Up to 8 conditions per place. [2022-12-13 10:32:35,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:35,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-13 10:32:43,314 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:32:43,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8003 [2022-12-13 10:32:43,315 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 77 flow [2022-12-13 10:32:43,315 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 10:32:43,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:32:43,315 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 10:32:43,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-13 10:32:43,315 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 10:32:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:32:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash 707231561, now seen corresponding path program 1 times [2022-12-13 10:32:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:32:43,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529049715] [2022-12-13 10:32:43,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:43,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:32:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:44,196 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 10:32:44,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:44,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529049715] [2022-12-13 10:32:44,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529049715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:32:44,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:32:44,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:32:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480922551] [2022-12-13 10:32:44,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:32:44,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:32:44,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:44,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:32:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:32:44,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:32:44,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 77 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 10:32:44,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:44,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:32:44,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:44,383 INFO L130 PetriNetUnfolder]: 29/111 cut-off events. [2022-12-13 10:32:44,383 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-13 10:32:44,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 111 events. 29/111 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 369 event pairs, 14 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 295. Up to 56 conditions per place. [2022-12-13 10:32:44,383 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 17 selfloop transitions, 4 changer transitions 24/45 dead transitions. [2022-12-13 10:32:44,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 249 flow [2022-12-13 10:32:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:32:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:32:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-12-13 10:32:44,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25555555555555554 [2022-12-13 10:32:44,384 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 77 flow. Second operand 9 states and 46 transitions. [2022-12-13 10:32:44,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 249 flow [2022-12-13 10:32:44,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 211 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-13 10:32:44,385 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:44,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-13 10:32:44,385 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2022-12-13 10:32:44,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:44,385 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:44,385 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:44,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:44,385 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:44,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:44,388 INFO L130 PetriNetUnfolder]: 3/36 cut-off events. [2022-12-13 10:32:44,389 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 10:32:44,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 36 events. 3/36 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 2 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 61. Up to 8 conditions per place. [2022-12-13 10:32:44,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:44,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-13 10:32:47,492 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:32:47,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3108 [2022-12-13 10:32:47,493 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 77 flow [2022-12-13 10:32:47,493 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 10:32:47,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:32:47,493 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 10:32:47,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-13 10:32:47,493 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 10:32:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:32:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1765596842, now seen corresponding path program 1 times [2022-12-13 10:32:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:32:47,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676801002] [2022-12-13 10:32:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:32:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:48,230 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 10:32:48,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:48,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676801002] [2022-12-13 10:32:48,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676801002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:32:48,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:32:48,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 10:32:48,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062043011] [2022-12-13 10:32:48,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:32:48,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 10:32:48,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:48,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 10:32:48,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 10:32:48,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:32:48,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 77 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 10:32:48,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:48,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:32:48,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:48,400 INFO L130 PetriNetUnfolder]: 29/111 cut-off events. [2022-12-13 10:32:48,400 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-13 10:32:48,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 111 events. 29/111 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 367 event pairs, 14 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 295. Up to 56 conditions per place. [2022-12-13 10:32:48,400 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 17 selfloop transitions, 4 changer transitions 24/45 dead transitions. [2022-12-13 10:32:48,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 249 flow [2022-12-13 10:32:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 10:32:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 10:32:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 46 transitions. [2022-12-13 10:32:48,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.25555555555555554 [2022-12-13 10:32:48,401 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 77 flow. Second operand 9 states and 46 transitions. [2022-12-13 10:32:48,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 249 flow [2022-12-13 10:32:48,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 211 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-13 10:32:48,402 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:48,402 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2022-12-13 10:32:48,402 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2022-12-13 10:32:48,402 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:48,402 INFO L89 Accepts]: Start accepts. Operand has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:48,402 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:48,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:48,403 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 21 transitions, 81 flow [2022-12-13 10:32:48,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:48,406 INFO L130 PetriNetUnfolder]: 3/36 cut-off events. [2022-12-13 10:32:48,406 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 10:32:48,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 36 events. 3/36 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 2 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 61. Up to 8 conditions per place. [2022-12-13 10:32:48,406 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 81 flow [2022-12-13 10:32:48,406 INFO L226 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-13 10:32:53,126 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:32:53,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4725 [2022-12-13 10:32:53,127 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 77 flow [2022-12-13 10:32:53,127 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 10:32:53,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:32:53,127 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 10:32:53,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-12-13 10:32:53,127 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 10:32:53,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:32:53,128 INFO L85 PathProgramCache]: Analyzing trace with hash -881116341, now seen corresponding path program 1 times [2022-12-13 10:32:53,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:32:53,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881592427] [2022-12-13 10:32:53,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:32:53,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:32:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:32:53,952 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 10:32:53,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:32:53,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881592427] [2022-12-13 10:32:53,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881592427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:32:53,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:32:53,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:32:53,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831819068] [2022-12-13 10:32:53,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:32:53,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:32:53,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:32:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:32:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:32:53,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:32:53,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 77 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 10:32:53,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:32:53,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:32:53,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:32:54,113 INFO L130 PetriNetUnfolder]: 29/111 cut-off events. [2022-12-13 10:32:54,113 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-13 10:32:54,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 111 events. 29/111 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 359 event pairs, 18 based on Foata normal form. 2/107 useless extension candidates. Maximal degree in co-relation 295. Up to 56 conditions per place. [2022-12-13 10:32:54,114 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 17 selfloop transitions, 4 changer transitions 22/43 dead transitions. [2022-12-13 10:32:54,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 239 flow [2022-12-13 10:32:54,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 10:32:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 10:32:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-12-13 10:32:54,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-13 10:32:54,114 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 77 flow. Second operand 8 states and 44 transitions. [2022-12-13 10:32:54,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 239 flow [2022-12-13 10:32:54,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 43 transitions, 201 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-13 10:32:54,115 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 77 flow [2022-12-13 10:32:54,115 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-13 10:32:54,115 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-12-13 10:32:54,115 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:32:54,116 INFO L89 Accepts]: Start accepts. Operand has 34 places, 21 transitions, 77 flow [2022-12-13 10:32:54,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:32:54,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:32:54,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 77 flow [2022-12-13 10:32:54,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 77 flow [2022-12-13 10:32:54,119 INFO L130 PetriNetUnfolder]: 3/36 cut-off events. [2022-12-13 10:32:54,119 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:32:54,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 36 events. 3/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 2 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 57. Up to 8 conditions per place. [2022-12-13 10:32:54,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 77 flow [2022-12-13 10:32:54,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-13 10:33:08,684 WARN L233 SmtUtils]: Spent 12.47s 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 10:33:11,209 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:33:11,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17094 [2022-12-13 10:33:11,210 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 73 flow [2022-12-13 10:33:11,210 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 10:33:11,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:33:11,210 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 10:33:11,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-12-13 10:33:11,210 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 10:33:11,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:33:11,210 INFO L85 PathProgramCache]: Analyzing trace with hash 177248940, now seen corresponding path program 1 times [2022-12-13 10:33:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:33:11,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421979213] [2022-12-13 10:33:11,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:33:11,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:33:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:33:11,413 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 10:33:11,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:33:11,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421979213] [2022-12-13 10:33:11,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421979213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:33:11,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:33:11,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:33:11,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140798361] [2022-12-13 10:33:11,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:33:11,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:33:11,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:33:11,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:33:11,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:33:11,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 10:33:11,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 73 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 10:33:11,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:33:11,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 10:33:11,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:33:11,489 INFO L130 PetriNetUnfolder]: 15/55 cut-off events. [2022-12-13 10:33:11,489 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 10:33:11,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 55 events. 15/55 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 113 event pairs, 4 based on Foata normal form. 2/54 useless extension candidates. Maximal degree in co-relation 144. Up to 24 conditions per place. [2022-12-13 10:33:11,490 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 0 selfloop transitions, 0 changer transitions 24/24 dead transitions. [2022-12-13 10:33:11,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 127 flow [2022-12-13 10:33:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:33:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:33:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2022-12-13 10:33:11,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.17857142857142858 [2022-12-13 10:33:11,490 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 73 flow. Second operand 7 states and 25 transitions. [2022-12-13 10:33:11,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 127 flow [2022-12-13 10:33:11,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 24 transitions, 111 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 10:33:11,491 INFO L231 Difference]: Finished difference. Result has 29 places, 0 transitions, 0 flow [2022-12-13 10:33:11,491 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=29, PETRI_TRANSITIONS=0} [2022-12-13 10:33:11,491 INFO L295 CegarLoopForPetriNet]: 41 programPoint places, -12 predicate places. [2022-12-13 10:33:11,491 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:33:11,491 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 0 transitions, 0 flow [2022-12-13 10:33:11,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 10:33:11,491 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 10:33:11,491 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:33:11,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 10:33:11,492 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 10:33:11,492 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 10:33:11,492 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:33:11,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 10:33:11,493 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 10:33:11,493 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 10:33:11,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 10:33:11,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 10:33:11,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 10:33:11,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 10:33:11,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-12-13 10:33:11,495 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 4, 3, 3, 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] [2022-12-13 10:33:11,497 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 10:33:11,497 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 10:33:11,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:33:11 BasicIcfg [2022-12-13 10:33:11,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 10:33:11,499 INFO L158 Benchmark]: Toolchain (without parser) took 230196.11ms. Allocated memory was 183.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 159.5MB in the beginning and 1.1GB in the end (delta: -961.6MB). Peak memory consumption was 295.1MB. Max. memory is 8.0GB. [2022-12-13 10:33:11,499 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 10:33:11,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.07ms. Allocated memory is still 183.5MB. Free memory was 159.5MB in the beginning and 142.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 10:33:11,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.15ms. Allocated memory is still 183.5MB. Free memory was 142.2MB in the beginning and 140.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:33:11,499 INFO L158 Benchmark]: Boogie Preprocessor took 34.47ms. Allocated memory is still 183.5MB. Free memory was 140.1MB in the beginning and 138.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:33:11,500 INFO L158 Benchmark]: RCFGBuilder took 486.09ms. Allocated memory is still 183.5MB. Free memory was 138.5MB in the beginning and 112.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 10:33:11,500 INFO L158 Benchmark]: TraceAbstraction took 229377.50ms. Allocated memory was 183.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 111.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 247.9MB. Max. memory is 8.0GB. [2022-12-13 10:33:11,500 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.11ms. Allocated memory is still 183.5MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.07ms. Allocated memory is still 183.5MB. Free memory was 159.5MB in the beginning and 142.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.15ms. Allocated memory is still 183.5MB. Free memory was 142.2MB in the beginning and 140.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.47ms. Allocated memory is still 183.5MB. Free memory was 140.1MB in the beginning and 138.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 486.09ms. Allocated memory is still 183.5MB. Free memory was 138.5MB in the beginning and 112.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 229377.50ms. Allocated memory was 183.5MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 111.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 247.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 818, independent: 787, independent conditional: 0, independent unconditional: 787, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 818, independent: 787, independent conditional: 0, independent unconditional: 787, 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: 818, independent: 777, independent conditional: 0, independent unconditional: 777, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1198, independent: 321, independent conditional: 321, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 818, unknown conditional: 818, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 818, Positive cache size: 787, Positive conditional cache size: 787, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 53, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 300, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 146, unknown conditional: 146, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 120, Positive conditional cache size: 120, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, independent: 89, independent conditional: 33, independent unconditional: 56, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 101, independent: 89, independent conditional: 33, independent unconditional: 56, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 101, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 12, independent conditional: 8, independent unconditional: 4, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, independent: 14, independent conditional: 10, independent unconditional: 4, dependent: 13, dependent conditional: 8, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 528, independent: 353, independent conditional: 353, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 101, unknown conditional: 101, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 209, Positive conditional cache size: 209, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 61 PlacesBefore, 60 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 838 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 536, independent: 495, independent conditional: 495, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 102, independent conditional: 65, independent unconditional: 37, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 107, independent: 102, independent conditional: 65, independent unconditional: 37, 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: 107, independent: 102, independent conditional: 0, independent unconditional: 102, 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: 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: 536, independent: 393, independent conditional: 393, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 107, unknown conditional: 107, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 311, Positive conditional cache size: 311, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 72 PlacesBefore, 71 PlacesAfterwards, 75 TransitionsBefore, 74 TransitionsAfterwards, 892 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 515, independent: 475, independent conditional: 475, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 53, independent conditional: 40, independent unconditional: 13, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 54, independent: 53, independent conditional: 40, independent unconditional: 13, 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: 54, independent: 53, independent conditional: 0, independent unconditional: 53, 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: 515, independent: 422, independent conditional: 422, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 364, Positive conditional cache size: 364, Positive unconditional cache size: 0, Negative cache size: 44, Negative conditional cache size: 44, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 75 PlacesBefore, 74 PlacesAfterwards, 89 TransitionsBefore, 88 TransitionsAfterwards, 992 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 593, independent: 559, independent conditional: 559, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 46, independent conditional: 32, independent unconditional: 14, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, independent: 46, independent conditional: 32, independent unconditional: 14, 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: 47, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 593, independent: 513, independent conditional: 513, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 47, unknown conditional: 47, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 455, Positive cache size: 410, Positive conditional cache size: 410, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 1036 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 301, independent: 283, independent conditional: 283, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 22, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 22, independent unconditional: 10, 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: 32, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 301, independent: 251, independent conditional: 251, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 487, Positive cache size: 442, Positive conditional cache size: 442, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 1052 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 517, independent: 480, independent conditional: 480, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 23, 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: 23, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 517, independent: 457, independent conditional: 457, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 510, Positive cache size: 465, Positive conditional cache size: 465, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 83 PlacesBefore, 82 PlacesAfterwards, 100 TransitionsBefore, 99 TransitionsAfterwards, 1016 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 345, independent: 319, independent conditional: 319, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, independent: 36, independent conditional: 20, independent unconditional: 16, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 36, independent conditional: 20, independent unconditional: 16, 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: 37, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 345, independent: 283, independent conditional: 283, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 547, Positive cache size: 501, Positive conditional cache size: 501, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 92 PlacesBefore, 92 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 1072 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 334, independent: 314, independent conditional: 314, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 22, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 22, independent unconditional: 6, 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: 28, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 334, independent: 286, independent conditional: 286, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 575, Positive cache size: 529, Positive conditional cache size: 529, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 1298 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 216, independent: 202, independent conditional: 202, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 19, independent unconditional: 9, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 19, independent unconditional: 9, 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: 30, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 174, independent conditional: 174, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 605, Positive cache size: 557, Positive conditional cache size: 557, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 115 PlacesBefore, 114 PlacesAfterwards, 138 TransitionsBefore, 137 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 513, independent: 483, independent conditional: 483, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 38, independent conditional: 29, independent unconditional: 9, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 41, independent: 38, independent conditional: 29, independent unconditional: 9, 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: 41, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 513, independent: 445, independent conditional: 445, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 41, unknown conditional: 41, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 646, Positive cache size: 595, Positive conditional cache size: 595, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 123 PlacesBefore, 123 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 1404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 350, independent: 330, independent conditional: 330, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 36, independent conditional: 35, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 36, independent conditional: 35, independent unconditional: 1, 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: 38, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 350, independent: 294, independent conditional: 294, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 684, Positive cache size: 631, Positive conditional cache size: 631, Positive unconditional cache size: 0, Negative cache size: 53, Negative conditional cache size: 53, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 113 PlacesBefore, 114 PlacesAfterwards, 132 TransitionsBefore, 133 TransitionsAfterwards, 1192 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 653, independent: 624, independent conditional: 624, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 68, independent conditional: 40, independent unconditional: 28, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, independent: 68, independent conditional: 40, independent unconditional: 28, 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: 70, independent: 68, independent conditional: 0, independent unconditional: 68, 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: 653, independent: 556, independent conditional: 556, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 70, unknown conditional: 70, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 754, Positive cache size: 699, Positive conditional cache size: 699, Positive unconditional cache size: 0, Negative cache size: 55, Negative conditional cache size: 55, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 117 PlacesBefore, 113 PlacesAfterwards, 129 TransitionsBefore, 126 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 263, independent: 247, independent conditional: 247, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, independent: 59, independent conditional: 41, independent unconditional: 18, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, independent: 59, independent conditional: 41, independent unconditional: 18, 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: 62, independent: 59, independent conditional: 0, independent unconditional: 59, 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: 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: 263, independent: 188, independent conditional: 188, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 62, unknown conditional: 62, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 816, Positive cache size: 758, Positive conditional cache size: 758, Positive unconditional cache size: 0, Negative cache size: 58, Negative conditional cache size: 58, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 131, independent: 112, independent conditional: 112, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 23, independent conditional: 3, independent unconditional: 20, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 0, independent unconditional: 1, dependent: 6, dependent conditional: 3, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 131, independent: 89, independent conditional: 89, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 845, Positive cache size: 781, Positive conditional cache size: 781, Positive unconditional cache size: 0, Negative cache size: 64, Negative conditional cache size: 64, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 83 PlacesBefore, 81 PlacesAfterwards, 74 TransitionsBefore, 72 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 39, independent conditional: 35, independent unconditional: 4, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 39, independent conditional: 35, 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: 42, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 71, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 887, Positive cache size: 820, Positive conditional cache size: 820, Positive unconditional cache size: 0, Negative cache size: 67, Negative conditional cache size: 67, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 87 PlacesBefore, 86 PlacesAfterwards, 82 TransitionsBefore, 81 TransitionsAfterwards, 762 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 166, independent: 142, independent conditional: 142, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 29, independent conditional: 21, independent unconditional: 8, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 29, independent conditional: 21, independent unconditional: 8, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, independent: 113, independent conditional: 113, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 919, Positive cache size: 849, Positive conditional cache size: 849, Positive unconditional cache size: 0, Negative cache size: 70, Negative conditional cache size: 70, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 94 PlacesBefore, 93 PlacesAfterwards, 91 TransitionsBefore, 90 TransitionsAfterwards, 858 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 230, independent: 203, independent conditional: 203, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 37, independent conditional: 35, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 37, independent conditional: 35, 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: 40, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 230, independent: 166, independent conditional: 166, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 959, Positive cache size: 886, Positive conditional cache size: 886, Positive unconditional cache size: 0, Negative cache size: 73, Negative conditional cache size: 73, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 816 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 62, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 13, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 13, 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: 18, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 62, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 977, Positive cache size: 901, Positive conditional cache size: 901, Positive unconditional cache size: 0, Negative cache size: 76, Negative conditional cache size: 76, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 9, 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: 12, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 63, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 989, Positive cache size: 912, Positive conditional cache size: 912, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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: 52, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 997, Positive cache size: 919, Positive conditional cache size: 919, Positive unconditional cache size: 0, Negative cache size: 78, Negative conditional cache size: 78, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 830 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 9, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 9, 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: 12, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 82, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1009, Positive cache size: 930, Positive conditional cache size: 930, Positive unconditional cache size: 0, Negative cache size: 79, Negative conditional cache size: 79, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 794 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 4, independent conditional: 0, independent unconditional: 4, 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: 50, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1014, Positive cache size: 934, Positive conditional cache size: 934, Positive unconditional cache size: 0, Negative cache size: 80, Negative conditional cache size: 80, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 105 PlacesBefore, 105 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 77, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 15, 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: 16, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 77, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1030, Positive cache size: 949, Positive conditional cache size: 949, Positive unconditional cache size: 0, Negative cache size: 81, Negative conditional cache size: 81, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 786 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1038, Positive cache size: 956, Positive conditional cache size: 956, Positive unconditional cache size: 0, Negative cache size: 82, Negative conditional cache size: 82, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 110 PlacesBefore, 109 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 808 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 82, independent conditional: 82, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 37, independent conditional: 29, independent unconditional: 8, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 37, independent conditional: 29, independent unconditional: 8, 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: 38, independent: 37, independent conditional: 0, independent unconditional: 37, 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: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 993, Positive conditional cache size: 993, Positive unconditional cache size: 0, Negative cache size: 83, Negative conditional cache size: 83, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 95 PlacesBefore, 92 PlacesAfterwards, 66 TransitionsBefore, 63 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 206, independent: 197, independent conditional: 197, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 56, independent conditional: 37, independent unconditional: 19, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 58, independent: 56, independent conditional: 37, independent unconditional: 19, 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: 58, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 206, independent: 141, independent conditional: 141, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 58, unknown conditional: 58, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1134, Positive cache size: 1049, Positive conditional cache size: 1049, Positive unconditional cache size: 0, Negative cache size: 85, Negative conditional cache size: 85, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 83 PlacesBefore, 82 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 34, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 34, independent unconditional: 8, 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: 42, independent: 42, independent conditional: 0, independent unconditional: 42, 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: 47, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1176, Positive cache size: 1091, Positive conditional cache size: 1091, Positive unconditional cache size: 0, Negative cache size: 85, Negative conditional cache size: 85, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 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: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1180, Positive cache size: 1094, Positive conditional cache size: 1094, Positive unconditional cache size: 0, Negative cache size: 86, Negative conditional cache size: 86, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 93 PlacesBefore, 92 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 16, independent: 12, independent conditional: 12, 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): 1183, Positive cache size: 1096, Positive conditional cache size: 1096, Positive unconditional cache size: 0, Negative cache size: 87, Negative conditional cache size: 87, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 91 PlacesBefore, 91 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 8, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1187, Positive cache size: 1099, Positive conditional cache size: 1099, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 96 PlacesBefore, 96 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 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: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1191, Positive cache size: 1102, Positive conditional cache size: 1102, Positive unconditional cache size: 0, Negative cache size: 89, Negative conditional cache size: 89, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 97 PlacesBefore, 97 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 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: 14, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1200, Positive cache size: 1110, Positive conditional cache size: 1110, Positive unconditional cache size: 0, Negative cache size: 90, Negative conditional cache size: 90, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1201, Positive cache size: 1111, Positive conditional cache size: 1111, Positive unconditional cache size: 0, Negative cache size: 90, Negative conditional cache size: 90, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1203, Positive cache size: 1112, Positive conditional cache size: 1112, Positive unconditional cache size: 0, Negative cache size: 91, Negative conditional cache size: 91, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1204, Positive cache size: 1112, Positive conditional cache size: 1112, Positive unconditional cache size: 0, Negative cache size: 92, Negative conditional cache size: 92, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 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: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1206, Positive cache size: 1113, Positive conditional cache size: 1113, Positive unconditional cache size: 0, Negative cache size: 93, Negative conditional cache size: 93, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 86 PlacesBefore, 83 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1207, Positive cache size: 1113, Positive conditional cache size: 1113, Positive unconditional cache size: 0, Negative cache size: 94, Negative conditional cache size: 94, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1208, Positive cache size: 1113, Positive conditional cache size: 1113, Positive unconditional cache size: 0, Negative cache size: 95, Negative conditional cache size: 95, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 87 PlacesBefore, 86 PlacesAfterwards, 78 TransitionsBefore, 77 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 17, independent conditional: 17, 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: 18, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 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] ], Cache Queries: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1130, Positive conditional cache size: 1130, Positive unconditional cache size: 0, Negative cache size: 96, Negative conditional cache size: 96, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 98 PlacesBefore, 97 PlacesAfterwards, 86 TransitionsBefore, 85 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 13, 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: 14, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 18, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1240, Positive cache size: 1143, Positive conditional cache size: 1143, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 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: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1244, Positive cache size: 1146, Positive conditional cache size: 1146, Positive unconditional cache size: 0, Negative cache size: 98, Negative conditional cache size: 98, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 4, independent: 1, independent conditional: 1, 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): 1247, Positive cache size: 1148, Positive conditional cache size: 1148, Positive unconditional cache size: 0, Negative cache size: 99, Negative conditional cache size: 99, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 112 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 602 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 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: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1254, Positive cache size: 1154, Positive conditional cache size: 1154, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 116 PlacesBefore, 116 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 586 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 4, independent: 1, independent conditional: 1, 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): 1257, Positive cache size: 1156, Positive conditional cache size: 1156, Positive unconditional cache size: 0, Negative cache size: 101, Negative conditional cache size: 101, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1261, Positive cache size: 1159, Positive conditional cache size: 1159, Positive unconditional cache size: 0, Negative cache size: 102, Negative conditional cache size: 102, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 117 PlacesBefore, 116 PlacesAfterwards, 99 TransitionsBefore, 98 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 10, 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: 11, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 15, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1272, Positive cache size: 1169, Positive conditional cache size: 1169, Positive unconditional cache size: 0, Negative cache size: 103, Negative conditional cache size: 103, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 123 PlacesBefore, 123 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 622 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 4, independent: 1, independent conditional: 1, 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): 1275, Positive cache size: 1171, Positive conditional cache size: 1171, Positive unconditional cache size: 0, Negative cache size: 104, Negative conditional cache size: 104, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 124 PlacesBefore, 124 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 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: 1, independent conditional: 1, 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): 1278, Positive cache size: 1173, Positive conditional cache size: 1173, Positive unconditional cache size: 0, Negative cache size: 105, Negative conditional cache size: 105, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 124 PlacesBefore, 121 PlacesAfterwards, 89 TransitionsBefore, 87 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 28, 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: 29, independent: 27, independent conditional: 0, independent unconditional: 27, 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: 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] ], Cache Queries: [ total: 41, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1307, Positive cache size: 1201, Positive conditional cache size: 1201, Positive unconditional cache size: 0, Negative cache size: 106, Negative conditional cache size: 106, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 111 PlacesBefore, 110 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 19, 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: 20, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 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: 32, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1327, Positive cache size: 1220, Positive conditional cache size: 1220, Positive unconditional cache size: 0, Negative cache size: 107, Negative conditional cache size: 107, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 102 PlacesBefore, 101 PlacesAfterwards, 89 TransitionsBefore, 88 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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: 13, independent conditional: 13, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1337, Positive cache size: 1229, Positive conditional cache size: 1229, Positive unconditional cache size: 0, Negative cache size: 108, Negative conditional cache size: 108, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 95 PlacesBefore, 92 PlacesAfterwards, 78 TransitionsBefore, 75 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 17, independent conditional: 17, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1350, Positive cache size: 1242, Positive conditional cache size: 1242, Positive unconditional cache size: 0, Negative cache size: 108, Negative conditional cache size: 108, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1350, Positive cache size: 1242, Positive conditional cache size: 1242, Positive unconditional cache size: 0, Negative cache size: 108, Negative conditional cache size: 108, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 96 PlacesAfterwards, 77 TransitionsBefore, 76 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 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: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1358, Positive cache size: 1249, Positive conditional cache size: 1249, Positive unconditional cache size: 0, Negative cache size: 109, Negative conditional cache size: 109, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1360, Positive cache size: 1250, Positive conditional cache size: 1250, Positive unconditional cache size: 0, Negative cache size: 110, Negative conditional cache size: 110, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 5, independent: 2, independent conditional: 2, 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): 1363, Positive cache size: 1252, Positive conditional cache size: 1252, Positive unconditional cache size: 0, Negative cache size: 111, Negative conditional cache size: 111, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 113 PlacesBefore, 112 PlacesAfterwards, 90 TransitionsBefore, 89 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 19, 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: 20, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 10, independent conditional: 10, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1383, Positive cache size: 1271, Positive conditional cache size: 1271, Positive unconditional cache size: 0, Negative cache size: 112, Negative conditional cache size: 112, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 114 PlacesBefore, 114 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 16, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1390, Positive cache size: 1277, Positive conditional cache size: 1277, Positive unconditional cache size: 0, Negative cache size: 113, Negative conditional cache size: 113, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1391, Positive cache size: 1277, Positive conditional cache size: 1277, Positive unconditional cache size: 0, Negative cache size: 114, Negative conditional cache size: 114, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 114 PlacesBefore, 114 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1392, Positive cache size: 1277, Positive conditional cache size: 1277, Positive unconditional cache size: 0, Negative cache size: 115, Negative conditional cache size: 115, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 104 PlacesBefore, 101 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1392, Positive cache size: 1277, Positive conditional cache size: 1277, Positive unconditional cache size: 0, Negative cache size: 115, Negative conditional cache size: 115, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 106 PlacesBefore, 105 PlacesAfterwards, 93 TransitionsBefore, 92 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 27, 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: 27, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 33, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1419, Positive cache size: 1304, Positive conditional cache size: 1304, Positive unconditional cache size: 0, Negative cache size: 115, Negative conditional cache size: 115, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1421, Positive cache size: 1305, Positive conditional cache size: 1305, Positive unconditional cache size: 0, Negative cache size: 116, Negative conditional cache size: 116, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 110 PlacesBefore, 110 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 4, independent conditional: 0, independent unconditional: 4, 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: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1426, Positive cache size: 1309, Positive conditional cache size: 1309, Positive unconditional cache size: 0, Negative cache size: 117, Negative conditional cache size: 117, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 115 PlacesBefore, 115 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 5, independent: 1, independent conditional: 1, 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): 1429, Positive cache size: 1311, Positive conditional cache size: 1311, Positive unconditional cache size: 0, Negative cache size: 118, Negative conditional cache size: 118, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 125 PlacesBefore, 124 PlacesAfterwards, 97 TransitionsBefore, 96 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 12, independent: 8, independent conditional: 8, 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): 1432, Positive cache size: 1313, Positive conditional cache size: 1313, Positive unconditional cache size: 0, Negative cache size: 119, Negative conditional cache size: 119, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 129 PlacesBefore, 129 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 6, independent: 2, independent conditional: 2, 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): 1435, Positive cache size: 1315, Positive conditional cache size: 1315, Positive unconditional cache size: 0, Negative cache size: 120, Negative conditional cache size: 120, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 127 PlacesBefore, 127 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1437, Positive cache size: 1316, Positive conditional cache size: 1316, Positive unconditional cache size: 0, Negative cache size: 121, Negative conditional cache size: 121, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 126 PlacesBefore, 126 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1438, Positive cache size: 1316, Positive conditional cache size: 1316, Positive unconditional cache size: 0, Negative cache size: 122, Negative conditional cache size: 122, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 122 PlacesBefore, 122 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1439, Positive cache size: 1316, Positive conditional cache size: 1316, Positive unconditional cache size: 0, Negative cache size: 123, Negative conditional cache size: 123, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 121 PlacesBefore, 121 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1440, Positive cache size: 1317, Positive conditional cache size: 1317, Positive unconditional cache size: 0, Negative cache size: 123, Negative conditional cache size: 123, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 123 PlacesBefore, 123 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 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: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1442, Positive cache size: 1318, Positive conditional cache size: 1318, Positive unconditional cache size: 0, Negative cache size: 124, Negative conditional cache size: 124, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 112 PlacesBefore, 110 PlacesAfterwards, 78 TransitionsBefore, 77 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1442, Positive cache size: 1318, Positive conditional cache size: 1318, Positive unconditional cache size: 0, Negative cache size: 124, Negative conditional cache size: 124, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 107 PlacesBefore, 106 PlacesAfterwards, 90 TransitionsBefore, 89 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 16, 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: 17, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1459, Positive cache size: 1334, Positive conditional cache size: 1334, Positive unconditional cache size: 0, Negative cache size: 125, Negative conditional cache size: 125, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 112 PlacesBefore, 111 PlacesAfterwards, 86 TransitionsBefore, 85 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 10, 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: 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: 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: 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] ], Cache Queries: [ total: 13, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1470, Positive cache size: 1344, Positive conditional cache size: 1344, Positive unconditional cache size: 0, Negative cache size: 126, Negative conditional cache size: 126, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 111 PlacesAfterwards, 85 TransitionsBefore, 84 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 5, independent: 1, independent conditional: 1, 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): 1473, Positive cache size: 1346, Positive conditional cache size: 1346, Positive unconditional cache size: 0, Negative cache size: 127, Negative conditional cache size: 127, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 114 PlacesBefore, 114 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 12, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1479, Positive cache size: 1351, Positive conditional cache size: 1351, Positive unconditional cache size: 0, Negative cache size: 128, Negative conditional cache size: 128, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 120 PlacesBefore, 120 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1480, Positive cache size: 1352, Positive conditional cache size: 1352, Positive unconditional cache size: 0, Negative cache size: 128, Negative conditional cache size: 128, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 127 PlacesBefore, 127 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1481, Positive cache size: 1352, Positive conditional cache size: 1352, Positive unconditional cache size: 0, Negative cache size: 129, Negative conditional cache size: 129, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 135 PlacesBefore, 135 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1481, Positive cache size: 1352, Positive conditional cache size: 1352, Positive unconditional cache size: 0, Negative cache size: 129, Negative conditional cache size: 129, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 136 PlacesBefore, 136 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 612 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 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: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1483, Positive cache size: 1353, Positive conditional cache size: 1353, Positive unconditional cache size: 0, Negative cache size: 130, Negative conditional cache size: 130, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 129 PlacesBefore, 129 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1485, Positive cache size: 1354, Positive conditional cache size: 1354, Positive unconditional cache size: 0, Negative cache size: 131, Negative conditional cache size: 131, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 130 PlacesBefore, 130 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, 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): 1486, Positive cache size: 1355, Positive conditional cache size: 1355, Positive unconditional cache size: 0, Negative cache size: 131, Negative conditional cache size: 131, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 124 PlacesBefore, 124 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 15, 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: 20, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 54, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1506, Positive cache size: 1374, Positive conditional cache size: 1374, Positive unconditional cache size: 0, Negative cache size: 132, Negative conditional cache size: 132, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 120 PlacesBefore, 116 PlacesAfterwards, 83 TransitionsBefore, 81 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1508, Positive cache size: 1375, Positive conditional cache size: 1375, Positive unconditional cache size: 0, Negative cache size: 133, Negative conditional cache size: 133, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1508, Positive cache size: 1375, Positive conditional cache size: 1375, Positive unconditional cache size: 0, Negative cache size: 133, Negative conditional cache size: 133, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1509, Positive cache size: 1375, Positive conditional cache size: 1375, Positive unconditional cache size: 0, Negative cache size: 134, Negative conditional cache size: 134, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 112 PlacesBefore, 111 PlacesAfterwards, 84 TransitionsBefore, 83 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 5, independent conditional: 5, 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): 1512, Positive cache size: 1377, Positive conditional cache size: 1377, Positive unconditional cache size: 0, Negative cache size: 135, Negative conditional cache size: 135, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 120 PlacesBefore, 119 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 27, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1526, Positive cache size: 1391, Positive conditional cache size: 1391, Positive unconditional cache size: 0, Negative cache size: 135, Negative conditional cache size: 135, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 123 PlacesBefore, 123 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 13, 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: 14, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 30, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1540, Positive cache size: 1404, Positive conditional cache size: 1404, Positive unconditional cache size: 0, Negative cache size: 136, Negative conditional cache size: 136, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 120 PlacesBefore, 120 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1541, Positive cache size: 1404, Positive conditional cache size: 1404, Positive unconditional cache size: 0, Negative cache size: 137, Negative conditional cache size: 137, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 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: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1543, Positive cache size: 1405, Positive conditional cache size: 1405, Positive unconditional cache size: 0, Negative cache size: 138, Negative conditional cache size: 138, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 116 PlacesBefore, 115 PlacesAfterwards, 83 TransitionsBefore, 82 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1554, Positive cache size: 1416, Positive conditional cache size: 1416, Positive unconditional cache size: 0, Negative cache size: 138, Negative conditional cache size: 138, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 117 PlacesBefore, 117 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1555, Positive cache size: 1416, Positive conditional cache size: 1416, Positive unconditional cache size: 0, Negative cache size: 139, Negative conditional cache size: 139, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 118 PlacesBefore, 116 PlacesAfterwards, 76 TransitionsBefore, 75 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 12, 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: 13, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 20, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1568, Positive cache size: 1428, Positive conditional cache size: 1428, Positive unconditional cache size: 0, Negative cache size: 140, Negative conditional cache size: 140, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 111 PlacesBefore, 111 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1570, Positive cache size: 1429, Positive conditional cache size: 1429, Positive unconditional cache size: 0, Negative cache size: 141, Negative conditional cache size: 141, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 107 PlacesBefore, 107 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1571, Positive cache size: 1429, Positive conditional cache size: 1429, Positive unconditional cache size: 0, Negative cache size: 142, Negative conditional cache size: 142, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 100 PlacesBefore, 98 PlacesAfterwards, 62 TransitionsBefore, 61 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1575, Positive cache size: 1433, Positive conditional cache size: 1433, Positive unconditional cache size: 0, Negative cache size: 142, Negative conditional cache size: 142, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1575, Positive cache size: 1433, Positive conditional cache size: 1433, Positive unconditional cache size: 0, Negative cache size: 142, Negative conditional cache size: 142, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 105 PlacesBefore, 105 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1576, Positive cache size: 1433, Positive conditional cache size: 1433, Positive unconditional cache size: 0, Negative cache size: 143, Negative conditional cache size: 143, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1576, Positive cache size: 1433, Positive conditional cache size: 1433, Positive unconditional cache size: 0, Negative cache size: 143, Negative conditional cache size: 143, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 101 PlacesBefore, 101 PlacesAfterwards, 64 TransitionsBefore, 65 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 10, 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: 11, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 13, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1587, Positive cache size: 1443, Positive conditional cache size: 1443, Positive unconditional cache size: 0, Negative cache size: 144, Negative conditional cache size: 144, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 99 PlacesBefore, 99 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1588, Positive cache size: 1443, Positive conditional cache size: 1443, Positive unconditional cache size: 0, Negative cache size: 145, Negative conditional cache size: 145, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 88 PlacesBefore, 88 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1589, Positive cache size: 1443, Positive conditional cache size: 1443, Positive unconditional cache size: 0, Negative cache size: 146, Negative conditional cache size: 146, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 64 PlacesBefore, 59 PlacesAfterwards, 34 TransitionsBefore, 30 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: 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: 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: 11, independent: 4, independent conditional: 4, 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): 1596, Positive cache size: 1450, Positive conditional cache size: 1450, Positive unconditional cache size: 0, Negative cache size: 146, Negative conditional cache size: 146, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 38 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 20 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 6, independent unconditional: 5, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 17, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1607, Positive cache size: 1461, Positive conditional cache size: 1461, Positive unconditional cache size: 0, Negative cache size: 146, Negative conditional cache size: 146, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1607, Positive cache size: 1461, Positive conditional cache size: 1461, Positive unconditional cache size: 0, Negative cache size: 146, Negative conditional cache size: 146, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1607, Positive cache size: 1461, Positive conditional cache size: 1461, Positive unconditional cache size: 0, Negative cache size: 146, Negative conditional cache size: 146, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.8s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1607, Positive cache size: 1461, Positive conditional cache size: 1461, Positive unconditional cache size: 0, Negative cache size: 146, Negative conditional cache size: 146, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1607, Positive cache size: 1461, Positive conditional cache size: 1461, Positive unconditional cache size: 0, Negative cache size: 146, Negative conditional cache size: 146, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1607, Positive cache size: 1461, Positive conditional cache size: 1461, Positive unconditional cache size: 0, Negative cache size: 146, Negative conditional cache size: 146, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1607, Positive cache size: 1461, Positive conditional cache size: 1461, Positive unconditional cache size: 0, Negative cache size: 146, Negative conditional cache size: 146, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.1s, 30 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1607, Positive cache size: 1461, Positive conditional cache size: 1461, Positive unconditional cache size: 0, Negative cache size: 146, Negative conditional cache size: 146, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: 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: 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: 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): 1607, Positive cache size: 1461, Positive conditional cache size: 1461, Positive unconditional cache size: 0, Negative cache size: 146, Negative conditional cache size: 146, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 161]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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: 229.3s, OverallIterations: 115, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 66.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14208 SdHoareTripleChecker+Valid, 25.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14208 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 21.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 949 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49171 IncrementalHoareTripleChecker+Invalid, 50120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 949 mSolverCounterUnsat, 4 mSDtfsCounter, 49171 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1514 GetRequests, 164 SyntacticMatches, 8 SemanticMatches, 1342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 16.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1348occurred in iteration=12, InterpolantAutomatonStates: 1025, 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.3s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 57.0s InterpolantComputationTime, 2633 NumberOfCodeBlocks, 2632 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 2510 ConstructedInterpolants, 11 QuantifiedInterpolants, 55729 SizeOfPredicates, 75 NumberOfNonLiveVariables, 2398 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 123 InterpolantComputations, 115 PerfectInterpolantSequences, 8/16 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 10:33:11,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...